ltl-accumulator-verified/verification/Proofs
mrwulf 406750887f S5.3 Fable re-audit: machine-verify the ConsRec base refactor (permanent artifact)
Re-derived S5.3 (all done under an Opus switch) from zero. consRecBinding
STATEMENT re-confirmed faithful to paper Thm 3 steps 1-2 (y=MTH D₁ = the
hash-fold condition; some=>collision / none=>x=MTH(D₁.take n₀) = the two
Lemma-2 outcomes); non-vacuous (some-branch is a SPECIFIC-pair IsCollision,
not pigeonhole-provable; none-branch a real equality needing hcons).

FINDING + FIX: Opus changed ConsRec's base definition (list-match →
decidable if) with only 'recompiled clean' as evidence — a definition
that mirrors the deployed verifier. Now machine-checked: consRec_base_
false_eq / consRec_base_true_eq prove the decidable-if base EQUALS the
exact list-match forms it replaced. Kept as PERMANENT cone-audited
theorems (F1 discipline: keep the evidence), not a throwaway probe.

QUEUED for S5.4: extractCons_correct (Theorem 3 endpoint) MUST carry a
permanent non-vacuity witness like extractIncl_nonvacuous/extractMTH_
nonvacuous. S7 must re-confirm the NEW ConsRec base vs Python.

26 certs green. LTL untouched.

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
2026-07-11 19:25:04 +02:00
..
AxiomCheck.lean S5.3 Fable re-audit: machine-verify the ConsRec base refactor (permanent artifact) 2026-07-11 19:25:04 +02:00
AxiomCheck.olean S5.3 Fable re-audit: machine-verify the ConsRec base refactor (permanent artifact) 2026-07-11 19:25:04 +02:00
Basic.lean S5.3: consRecBinding PROVEN — Theorem 3 steps 1-2 kernel-checked (the hardest object) 2026-07-11 19:18:26 +02:00
Basic.olean S5.3: consRecBinding PROVEN — Theorem 3 steps 1-2 kernel-checked (the hardest object) 2026-07-11 19:18:26 +02:00
Binding.olean S3/L4-L5: root binding (Lemma 2, Path instance) + Theorem 2, constructive 2026-07-11 13:21:17 +02:00
Binding3.lean S5.3: consRecBinding PROVEN — Theorem 3 steps 1-2 kernel-checked (the hardest object) 2026-07-11 19:18:26 +02:00
Binding3.olean S5.3: consRecBinding PROVEN — Theorem 3 steps 1-2 kernel-checked (the hardest object) 2026-07-11 19:18:26 +02:00
Completeness.lean S3.5: explicit collision extractor — Theorem 2 made non-vacuous, vacuous forms removed 2026-07-11 15:31:21 +02:00
Completeness.olean S3.5: explicit collision extractor — Theorem 2 made non-vacuous, vacuous forms removed 2026-07-11 15:31:21 +02:00
Consistency.lean S5 stage 2: extractConsNode extractor defined (consistency, Theorem 3 steps 1-2) 2026-07-11 17:55:51 +02:00
Consistency.olean S5 stage 2: extractConsNode extractor defined (consistency, Theorem 3 steps 1-2) 2026-07-11 17:55:51 +02:00
Descent.lean S4: descent extractor extractMTH (Theorem 3 step 3 + F2 restoration), non-vacuous 2026-07-11 16:46:58 +02:00
Descent.olean S4: descent extractor extractMTH (Theorem 3 step 3 + F2 restoration), non-vacuous 2026-07-11 16:46:58 +02:00
Extract.lean S3.5 Fable re-audit: permanent non-vacuity witness + honest ledger 2026-07-11 16:38:34 +02:00
Extract.olean S3.5 Fable re-audit: permanent non-vacuity witness + honest ledger 2026-07-11 16:38:34 +02:00
Probe.olean S3.5: explicit collision extractor — Theorem 2 made non-vacuous, vacuous forms removed 2026-07-11 15:31:21 +02:00
ProbeAx.olean S5.3: consRecBinding PROVEN — Theorem 3 steps 1-2 kernel-checked (the hardest object) 2026-07-11 19:18:26 +02:00
ProbeInduct.olean S5.3: consRecBinding PROVEN — Theorem 3 steps 1-2 kernel-checked (the hardest object) 2026-07-11 19:18:26 +02:00
ProbeRefactor.olean S5.3 Fable re-audit: machine-verify the ConsRec base refactor (permanent artifact) 2026-07-11 19:25:04 +02:00
Refactor.lean S5.3 Fable re-audit: machine-verify the ConsRec base refactor (permanent artifact) 2026-07-11 19:25:04 +02:00
Refactor.olean S5.3 Fable re-audit: machine-verify the ConsRec base refactor (permanent artifact) 2026-07-11 19:25:04 +02:00