ltl-accumulator-verified/verification/Proofs
mrwulf db45c0e33f S7 Fable re-audit: close the cone-audit COVERAGE gap (52/52), verify button by exit code
Re-derived S7 as Fable, practicing the standing rule (check exit code +
ALL GREEN, not tail). Confirmed committed button genuinely exits 0.

FINDING: the cone audit had a COVERAGE gap — 34 of 52 proven objects
were pinned; 18 (incl. core defs kbelow/hleaf/hnode and the pin-store
defs pinAccept/pinExtract/acceptCons, plus intermediate lemmas) were
never cone-audited. Transitively safe (Phase 1 forbids axiom under
Proofs/, Phase 2 forbids sorry, universally) — but 'transitively
covered' is not good enough for an externally-reviewed corpus. Closed:
every proven theorem/def now has its EXACT cone pinned, read from
#print axioms (not guessed). Coverage now 52/52, empty unaudited list.

Cones of note: hleaf/hnode = [LTLAcc.sha256] only; kbelow and the pure
arithmetic/list helpers = no hash axiom; the def-level objects that
touch MTH carry the single sha256 boundary. No surprise axioms anywhere.

Button verified: EXIT 0, ALL GREEN, FIDELITY GREEN, 164,479/164,224
pinned. LTL untouched.

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
2026-07-11 20:56:17 +02:00
..
AxiomCheck.lean S7 Fable re-audit: close the cone-audit COVERAGE gap (52/52), verify button by exit code 2026-07-11 20:56:17 +02:00
AxiomCheck.olean S6: Proposition 1 (pin-store safety) — the last theorem, Merkle-layer share 2026-07-11 20:23:49 +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
PinStore.lean S6: Proposition 1 (pin-store safety) — the last theorem, Merkle-layer share 2026-07-11 20:23:49 +02:00
PinStore.olean S6: Proposition 1 (pin-store safety) — the last theorem, Merkle-layer share 2026-07-11 20:23:49 +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 drill (2nd pass): anchor refactor-equivalence provenance to git history 2026-07-11 19:55:38 +02:00
Refactor.olean S5.3 drill (2nd pass): anchor refactor-equivalence provenance to git history 2026-07-11 19:55:38 +02:00
Theorem3.lean S5.4: THEOREM 3 COMPLETE — extractCons assembly + non-vacuity witness 2026-07-11 20:07:20 +02:00
Theorem3.olean S5.4: THEOREM 3 COMPLETE — extractCons assembly + non-vacuity witness 2026-07-11 20:07:20 +02:00