III.T21 — τ-Admissibility Collapse Theorem (v1)

For τ-admissible NP instances (bounded interface width K): witness search reduces to O(k^c) canonical address refinements at primorial depth k. Therefore τ-P_adm = τ-NP_adm. CRT independence bounds per-prime search; reconstruction functor assembles global witness in polynomial time.