GATE D22
Implicit global-signature elimination
What changed
D21-S showed that writing down the complete family of starting fingerprints is astronomically large, but that only blocks the two explicit ways to materialize it, not every method. The product of the per-prime fingerprint sets is not a state space anyone must build; constraints linking the primes can rule out most states before they are ever generated. D22 reverses the order once more. Instead of listing all starting fingerprints and then filtering, it keeps the unknown bounded object as symbols, projects it onto one prime at a time, asks the fast narrowed local feasibility question, and cuts away impossible states with a proof for every cut. Two symbolic pictures are piloted in parallel: a coefficient master carrying the symmetric functions of the squared speeds, and a root master carrying the squared speeds themselves. Each local subproblem returns a match witness, a certified empty, or an honest open, and every pruning cut must carry a theorem and a proof hash, so nothing is discarded without justification. No compute budget increase is authorized, and nothing about the conjecture is decided by opening this gate. LRC(13) remains open.
Evidence
Verification: double · I2 · 8 artifacts (reports, verifiers, corruption suites, manifest with SHA-256)