Signed p-adic Residual Encodings of Finite-Domain All-Different Systems with a Sudoku Case Study

We study signed, weighted affine $p$-adic residual objectives as native encodings of finite-domain constraints. For primes that separate the finite alphabet, sufficiently weighted positive unary rows pin each coefficient to its allowed set, while negative rows reward unequal endpoints or clause sati