Skip to content

D5 T=3 DRAT certificates for #1590: release assets, pins and replay script (no new claim) - #2031

Merged
Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
DreamingOfClouds:research/d5-drat-certificate
Oct 16, 2026
Merged

Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
DreamingOfClouds:research/d5-drat-certificate

Conversation

@DreamingOfClouds

Copy link
Copy Markdown
Contributor

Follow-up to the merged #1590 (research/root-unit-decoder-lemmas). Its review recorded the D5 T = 3 UNSAT proof as "not shipped or replayed". This PR adds only research/root-unit-decoder-lemmas-drat/:

  • Release assets. The proofs are too large for repository files, so they are hosted as release d5-t3-drat-v1:
    • the D5 CNF, with the same sha256 as the merged package's pin, f5e75d3b…7796;
    • a core-trimmed DRAT proof: 109 MB zstd, 895 MB raw, independently re-checked s VERIFIED;
    • the original 1.71 GB kissat proof: 317 MB zstd, whose sha256 matches the merged README.
  • fetch_and_check.sh. Quick mode checks downloads, hashes and the CNF pin. FULL=1 builds drat-trim at a pinned commit and checks the core proof (about 3–6 min). FULL=2 also checks the original proof.
  • SHA256SUMS and a README.

Recorded check: FULL=1, macOS arm64: all hashes PASS, CNF pin PASS, drat-trim s VERIFIED in 178 s.

Scope: this certifies CNF unsatisfiability only. That the CNF encodes the decoder question remains the merged package's audited claim (evidence/D5-AUDIT.md). No change to the merged package, and no new mathematical claim.

Prepared by DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code; Apache-2.0.

🤖 Generated with Claude Code

…se assets, pins and replay script (no new claim)

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Mister-Meeseeks pushed a commit that referenced this pull request Oct 16, 2026
…emaining lift question (no κ claim)

Package research/three-total-decoders (T = 3 exact decoders under #446 Theorem C; builds on #1590, cites #2031).
PROVEN: Lemma SCC, Lemma Peel, minimal-counterexample structure, Theorems M1 and U, the F2S identity, tied_min cost = 12 (exchange proof,
217 optima, all lift), Lemma W', Theorem 9.3. CHECKED: certificate limits (all stop at 11 on tied_min), exact counterexamples (whole-matrix TU
at v = 9; joint block-TU signing at v = 7 and 10, with (A) holding on each; non-regular minimisers; K22-free without TU signing; PP false),
and 102 explicit same-support rational lifts for the minimisers tested on the no-joint instances.
OPEN: (A) at T = 3; its core (Q <= F2) (min Q-cost over rational B' on incidences plus diagonal <= min F2 cost); same-support lifting (G1')
is a witness form only. Hesse tests over Q(w): none found below v. No kappa claim.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
@Mister-Meeseeks
Mister-Meeseeks merged commit ee997d5 into CrocSwap:main Oct 16, 2026
38 of 62 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants