Chapter 60: Witness Search as Address Resolution

Chapter 56 established that τ-admissible computations factor through a single finite quotient ℤ/Prim(k₀)ℤ. This chapter applies that collapse to NP witness search. In Category τ, a witness is a canonical address whose ABCD coordinates structure the search space, and the CRT decomposition factorizes the search into independent per-prime problems. The main result (Proposition [prop:polynomial-refinement]) shows that the total search cost is O(k² log k)—polynomial in the primorial depth—because the CRT converts a product of per-prime costs into a sum.