Lean verification registry · Authored proofs · The Logos Architecture
Verified sequents with unresolved formal parts
Axiom-free: true · 1 checked theorem statements.
Lean establishes the listed formal statements and dependencies. The exact authored source, Ground, known premise meanings, application validation and empirical evidence remain separately typed. No unencoded section is certified by a neighboring theorem.
Original source author: Maclain Hunter. Machine formalization: Replit Agent. No original wording was rewritten.
Source registered: not established (not original authorship).
Formalized: 2026-10-03T10:37:05.082Z.
Checked: 2026-10-03T10:41:45.014Z.
Independent timestamp: 2026-10-03T10:42:55.000Z.
Authored source SHA-256: 6862cd530b23f9ac5cf15008ce12cdc1198590279b5d5162069f0e8d016aa25e
Lean source · Verification JSON · Exact archived source JSON · Compiler report · Current authored source page · Signed release and verification instructions
Lean (version 4.7.0, commit v4.7.0, Release) exitCode=0 'HunterAuthored.generated_signature_invariants' does not depend on any axioms
Formal statement: ∀v ∈ number[]: verifySignature(generateSignature(v)) = true
The exact depth, product and signed-state invariants listed in the authored proof, for every integer input list and deterministic parity function. Host hash encoding, floating-point intake and the Boolean verifier implementation are not substituted for this typed mathematical certificate.
Formal statement: ∀v ∈ number[]: verifySignature(generateSignature(v)) = true Proof: Verification recomputes the same invariants as generation