๐Ÿ“œ
VERIFIED ยท LEAN 4
FORMALLY VERIFIED

Proven, not promised.

The mathematics under Atomadic is machine-checked โ€” nothing left to trust.

Most platforms benchmark. We prove. The foundation is formally verified in Lean 4 โ€” a machine-checked build that elaborates 872 theorems with zero gaps and zero parameters fit to data.

872
theorems & lemmas
0
sorry
0
admit
0
free parameters
THE RECEIPT

A signed Lean 4 build attestation

โœ…

Build: PASS

lake build completed with return code 0 โ€” the corpus elaborates clean.

๐Ÿ”ข

872 ยท 0 ยท 0 ยท 0

872 theorems & lemmas, 0 sorry, 0 admit, and 0 free parameters fit to data, across 30 modules.

๐Ÿ”ง

Lean 4

Verified with Lean 4 (4.29.1). Proof tactics are standard and decidable: native_decide, norm_num, omega, simp.

๐Ÿชช

Attested

Issued by the Atomadic Research Center on 2026-05-06 โ€” counts and content hashes only.

ZERO FREE PARAMETERS

Derived, not tuned

Every numerical constant in the system is derived from classical integer group theory and combinatorics โ€” none is tuned or fit to experimental data. There are no sorrys, no admits, and no user-declared axioms beyond Lean's core. The handful of declared axioms are protocol thresholds plus two well-known classical lattice results (Niemeier, 1973; Conway & Sloane, SPLAG, Thm 4.13) โ€” cited, not invented. That's what 0 free parameters means: nothing was bent to fit a desired answer.

INDEPENDENTLY CHECKABLE

Recompute the hash

The attestation publishes a reproducibility anchor โ€” a SHA-256 over the sorted per-module content hashes. Given the proof tree, anyone can recompute it and confirm the bit-identical corpus existed at attestation time.

sha256 ยท sorted module hashes216b2d5091fccd966b2e2b4313ebc1894f8846d793f57abca2fdb118f8e21561

The attestation discloses counts and content hashes only โ€” never theorem statements, proof tactics, or proprietary content. We don't claim a benchmark score. We don't say "trust us." We hand you the hash to check.

Trust, measured.