mirror of https://github.com/saymrwulf/ltl-accumulator-verified.git synced 2026-09-03 19:53:48 +00:00

No description

Find a file

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
verification	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
README.md	S5.3: consRecBinding PROVEN — Theorem 3 steps 1-2 kernel-checked (the hardest object)	2026-07-11 19:18:26 +02:00

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

verification

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

README.md

S5.3: consRecBinding PROVEN — Theorem 3 steps 1-2 kernel-checked (the hardest object)

2026-07-11 19:18:26 +02:00

README.md

ltl-accumulator-verified

Lean 4 mechanization of the security analysis (§6) of the paper "The Lean Transparency Log" (https://ltl.zkdefi.org/paper): the Merkle accumulator's own correctness and soundness theorems, kernel-checked, in the same discipline as the four *-ed25519-verified subject corpora.

Status: layer scaffold (work in progress — honest ledger below)

layer	content	status
L1	bytes, hleaf/hnode, domain separation (Lemma 1)	done (domsep: axiom-free)
L2	MTH, Root, ConsRec definitions + termination	done (cones: propext, LTLAcc.sha256, Quot.sound)
L3	inclusion completeness (Theorem 1)	done (incl_complete: propext, Classical.choice, LTLAcc.sha256, Quot.sound)
L4	frontier binding content (Lemma 2)	inlined in the extractor walk (extractIncl); standalone receipt-uniqueness theorem queued for S4 restoration in extractor form
L5	inclusion soundness = EXPLICIT extractor `extractIncl` (Theorem 2) done, non-vacuous
L6a	descent extractor `extractMTH` (Theorem 3 step 3 = Lemma 2, WHOLE-TREE instance) done, non-vacuous
—	Lemma 2, PATH instance (receipt-uniqueness of `Root`): deleted with the vacuous `root_binding` in S3.5 and not yet restored; optional, not needed for Theorem 3
L6b	ConsRec binding + Theorem 3 assembly (extractCons)	in progress (S5): stage-1 arithmetic/list infrastructure done (kbelow_prefix_eq, take surgery); stage-1 infra + extractConsNode extractor DEFINED (faithful to ConsRec by inspection — NOT yet machine-checked); consRecBinding PROVEN (Theorem 3 steps 1-2, kernel-checked, no sorry); extractCons assembly (step 3 join) = S5.4
L6	pin-store state machine safety (Proposition 1)	pending

Discipline (identical to the subject corpora)

verification/Proofs/ contains ZERO axiom declarations; the single sanctioned axiom site is verification/gen/ — here, one opaque function: SHA-256. The theorems are constructive collision extractors, so collision resistance is never assumed, only interpreted.
verification/check.sh is THE button: compiles every file through lean-guard (memory cap, core pinning, timeout, single-flight lock) and axiom-audits every certificate against its documented exact cone.
Expected boundary: propext, Classical.choice, Quot.sound plus LTLAcc.sha256 for hash-touching certificates — documented per certificate in check.sh, audited both directions.

The finished certificates are destined for the LTL itself as attestation leaves: the log carrying kernel-checked proofs of its own machinery.