ltl-accumulator-verified/verification/Proofs
mrwulf a3b8b3ecea S7 drill (2nd pass): pin the load-bearing gen/ instance cones; document audit surface
Audit-of-the-coverage-audit. Its 18 added cone values re-verified against
the observed #print outputs (all match). Methodology blind spots found:
abbrev Bytes (bare alias, no cone content — excluded by nature) and the
two ANONYMOUS gen/ instances, which are silently load-bearing
(DecidableEq Hash powers ConsRec's 'if C = []' and pinAccept's root
compare; Inhabited Hash powers every getD default). Transitivity covered
them, but no hand-waves before external review: cones read and pinned —
instInhabitedHash = [propext], instDecidableEqHash = AXIOM-FREE. The
audit-surface definition is now documented in check.sh itself.

Button verified by exit code: EXIT 0, ALL GREEN, FIDELITY GREEN.
54 pinned cones. LTL untouched.

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
2026-07-11 21:07:08 +02:00
..
AxiomCheck.lean S7 drill (2nd pass): pin the load-bearing gen/ instance cones; document audit surface 2026-07-11 21:07:08 +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