Lean verification registry · Authored proofs · The Logos Architecture
Verified sequents with unresolved formal parts
Axiom-free: false · 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:37:46.866Z.
Independent timestamp: 2026-10-03T10:42:55.000Z.
Authored source SHA-256: a2a5c4da4b0602feec70eb02bea120499d45d7c68b837311032d8274213b8349
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.finite_fixed_point_clamp_bounds' depends on axioms: [Classical.choice, propext, Quot.sound]
Formal statement: ∀array ∈ MCBExponent[]: exponentCoherence(array) ∈ [0, 1]
The source's clamp stage on every finite fixed-point/rational representation with a positive denominator: numerator lies between 0 and the denominator, hence the normalized score lies in [0,1]. Variance computation, nonfinite floating values and the current host binding are not certified by this clamp theorem.
Formal statement: ∀array ∈ MCBExponent[]: exponentCoherence(array) ∈ [0, 1] Proof: Standard deviation of binary values bounded by 0.5