mirror of
https://github.com/saymrwulf/ltl-accumulator-verified.git
synced 2026-09-05 20:10:43 +00:00
mrwulf
801ae08fe8
Path (prover-side inclusion path, paper SS5.3) with termination via the kbelow bounds; self-contained list lemmas (getD_take, getD_drop - no stdlib-name dependence); equation lemmas MTH_single/MTH_split/Root_one/ Root_left/Root_right (Option.map form; matcher side conditions closed explicitly); Theorem 1 by functional induction on Path with a k-fold discipline against the let-bound split point. incl_complete cone: [propext, Classical.choice, LTLAcc.sha256, Quot.sound] - pinned exactly in check.sh alongside Path. THE button green end to end. LTL untouched. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
33 lines
1.8 KiB
Markdown
33 lines
1.8 KiB
Markdown
# 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 hash-fold + root binding (Lemma 2) | pending |
|
|
| L5 | inclusion/consistency soundness as collision extractors (Theorems 2, 3) | pending |
|
|
| 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.
|