GATE D21

Signature-narrowed certified compatibility

partialEvidence I2Verify: doublePublic claim: No2026-07-19

What changed

D20 was blocked because it asked for the complete unconstrained local-cover universe before any cross-prime information had narrowed the query. D21 reverses the order: propagate a partial global signature first, then ask only for local covers compatible with that signature. Two corrections and one architectural win carry it. First, the padding correction: a full thirteen-speed cover is a minimal core plus a padding multiset, and padding is not harmless because it changes multiplicities, symmetric coefficients, the projective orbit and CRT compatibility, so the oracle must query the full thirteen-multiset, not just a minimal core. This is proved and checked against brute force. Second, the narrowed oracle: once a target signature is fixed, the squared-speed multiset is pinned up to the quadratic-residue scale action, so every matching cover is found by scanning the half-group of scales, a cost linear in the prime rather than the blocked full enumeration. Measured on the D20-hard primes up to 2267, each narrowed query terminates in a fraction of a second with a replayable certificate, exactly where the old route was blocked. Every query still returns one of matches-complete, empty-certified or open-incomplete, a solver refutation is invalid without a machine-checkable proof, and a timeout is open. The honest boundary: the per-query enumeration wall is removed, but the full campaign still needs a meet-in-the-middle seed at the first prime, so no campaign verdict is claimed yet. LRC(13) remains open.

Evidence

check 1Padding decomposition PROVED and brute-verified: every 13-multiset cover = minimal core + padding; padding changes multiplicity, symmetric coefficients, projective orbit and CRT compatibility, so a minimal-core-only oracle is incomplete
check 2Signature-narrowed oracle scans the quadratic-residue scale half-group, cost linear in p; measured to terminate under 0.35s on D20-hard primes up to 2267 where full enumeration was blocked; three-valued with replayable certificates, UNSAT-without-proof rejected, timeout is OPEN
check 3Two verifiers ACCEPT, 158 of 158 corruption rejected; pilot passes with the mandatory padding-required case and timeout injection
check 4D21-S: the seed-completeness theorem is proved (every counterexample enters a retained seed), but both explicit seed materialization routes are BLOCKED-COMPUTE (distinct signatures 6 to 15511 from p=23 to 29; complete set at least 2^519). Scope: this blocks the two explicit routes, not every implicit method. Campaign NOT reached; the frontier moves to D22 implicit symbolic elimination. LRC(13) OPEN

Verification: double · I2 · 24 artifacts (reports, verifiers, corruption suites, manifest with SHA-256)

Graph impact

All gates