ltl-accumulator-verified/verification/Proofs/AxiomCheck.lean

/- Axiom-cone observation for the audit (Phase 3 of check.sh). -/
import Proofs.Basic
#print axioms LTLAcc.domsep
#print axioms LTLAcc.kbelow_pos
#print axioms LTLAcc.kbelow_lt
#print axioms LTLAcc.le_two_kbelow
#print axioms LTLAcc.MTH
#print axioms LTLAcc.Root
#print axioms LTLAcc.ConsRec
L1+L2: hashing shapes, domain separation, MTH/Root/ConsRec with termination Accumulator pyramid layers 1-2, mechanizing paper SS5.3/SS6 groundwork: - gen/LTLAcc/HashExternal.lean: the single sanctioned axiom, opaque sha256 (no properties assumed - the soundness theorems downstream are constructive collision extractors). - Proofs/Basic.lean: hleaf/hnode (0x00/0x01 domain stamps); Lemma 1 (domsep) proven AXIOM-FREE; kbelow (largest power of two below n) with pos/lt/le-two bound lemmas; MTH, Root (Option = rejection), ConsRec (four cases, b-flag, pinned anchor) - all with kernel-checked termination via the kbelow bounds. - check.sh: estate discipline (stub audit, axiom-smuggling gate, lean-guard compilation, boundary-exact per-certificate cone audit). All green; observed cones pinned exactly. Zero contact with the live LTL: no appends, no server, accumulator frozen at 12 leaves throughout this project. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com> 2026-07-10 21:58:00 +00:00			`/- Axiom-cone observation for the audit (Phase 3 of check.sh). -/`
			`import Proofs.Basic`
			`#print axioms LTLAcc.domsep`
			`#print axioms LTLAcc.kbelow_pos`
			`#print axioms LTLAcc.kbelow_lt`
			`#print axioms LTLAcc.le_two_kbelow`
			`#print axioms LTLAcc.MTH`
			`#print axioms LTLAcc.Root`
			`#print axioms LTLAcc.ConsRec`