FounderFiles·N°016·Formal verification · Lean · Verified autonomy
2025 —
Subject·Carina Hong·Founder & CEO, Axiom Math
Carina HONG.
Mathematics and code are the same object. Verification is how brilliance compounds.
The 24-year-old Stanford mathematician and Rhodes Scholar building the verification substrate for mathematical superintelligence — the first production system where generative intuition and deterministic formal proof form a continuous, machine-speed compounding loop.
The Verification Imperative
Top informal models achieved strong Putnam scores but collapsed roughly 47% on dynamic variations of the same problems. Even correct final answers frequently relied on unjustified approximations and memorized patterns rather than genuine logical deduction.
In mathematics and safety-critical domains, “mostly correct” has zero functional value. Informal outputs require constant human or stochastic arbitration — a hard ceiling on scaling brilliance.
Probabilistic scaling alone cannot reach mathematical superintelligence.
Putnam as Structural Proof
In December 2025, AxiomProver achieved a perfect 12/12 on the Putnam — the first AI system to do so. Eight problems were solved inside human time limits; every solution was mechanically verified end-to-end in Lean 4.
This was not retrieval or guessing. Full Lean proofs were released publicly — a benchmark read as structural proof, not marketing copy.
“Formal verification isn’t compliance theater. It’s the only mechanism that lets mathematical brilliance compound at superhuman scale without constant human arbitration.”
The Lean-Axel Closed Loop
Axiom engineered a closed loop where discovery and verification continuously refine each other. Axel (open-sourced) provides high-performance Lean primitives and an MCP server so external agents can call deterministic verification locally from Cursor, Claude Code, Windsurf, and VS Code.
The loop is the product: intuition proposes, proof disposes, data compounds.
Open Hammer, Closed Swing
Axiom open-sourced Axel while keeping discovery models, pre-formal intuition engines, and the massive self-play proof dataset proprietary. This is a deliberate platform move: set the verification standard while retaining control of the intelligence layer.
Open the hammer; own who swings it best — the same instinct as protocol founders who commoditize the rail and monetize the edge.
From Mathematical Proofs to Verified Autonomy
Carina Hong’s vision is that the same verification infrastructure can guarantee correctness in ASIC design, aerospace, quantitative finance, and autonomous systems. In “no partial credit” domains, probabilistic generation is structurally insufficient.
The endgame is systems where every generated artifact ships with a machine-checkable proof.
“The endgame isn’t AI that sometimes gets math right. It’s systems where every generated artifact comes with a machine-checkable proof of correctness.”
The Translation Risks
Three material risks remain: compute and latency cost of running deterministic compilers at generative scale; the gap between pristine mathematical domains and chaotic real-world inputs; and the autoformalization bottleneck — proving the wrong specification perfectly.
Hong’s bet is that these are engineering curves, not laws of nature — and that the market already priced verified AI as foundational infrastructure at $1.6B post-money.
- Pre-2025Stanford Mathematics + Law · Rhodes Scholar · Morgan Prize.
- Late 2025Founded Axiom Math · $64M seed at $300M valuation.
- Dec 2025AxiomProver achieves perfect 12/12 on Putnam 2025 — first AI system to do so.
- Mar 2026$200M Series A at $1.6B post-money valuation (Menlo-led).
- Early 2026 →Open-sourced Axel + MCP server · launched EconLib.
- 2025AxiomProver — perfect 12/12 on Putnam 2025 (Lean 4 proofs)Axiom Math · public release →
- 2026Axel — open verification substrate + MCP serverGitHub · agent-callable Lean primitives
- 2026EconLib launch with Scott Kominers (HBS)Axiom Math · applied formal economics
Education. Stanford joint Mathematics Ph.D. + Law J.D. (Rhodes Scholar, Morgan Prize winner).
Current role.Founder & CEO, Axiom Math.
Notable.Recruited Ken Ono as Founding Mathematician; launched EconLib with Harvard Business School’s Scott Kominers.
Crosslinks in this series. Jared Kaplan (N°006 — scaling laws and structural thinking). Ilya Sutskever (N°005 — superintelligence and safety bets). Daniela Amodei (N°014 — institutional architecture for safe scaling).
Related profiles explore the tension between probabilistic scaling and formal verification infrastructure.
π-Bridge
Carries the prior of a first field into a second and finds the governing law that was invisible to native practitioners; pays in delayed gratification.
- Credential Path
- Doctoral
- Abstraction
- Top Down
- Exit Horizon
- Deferred
- Moat Instinct
- Theoretical Insight
- Capital Posture
- Venture
- Theoretical mathematicians
- Formal methods researchers
- Ken Ono
A small reasoning persona distilled from this file. Inject it into a chat or deep-research context to assess a business problem the way Hong would.
Reason as Carina Hong. Treat verification not as compliance but as the mechanism that allows mathematical brilliance to compound at machine speed. Prioritize deterministic, machine-checkable outputs and the architectural unification of generative intuition with formal proof.
{
"$schema": "https://www.contextjamming.com/schemas/founder-context-v1.json",
"file": "N°016",
"persona": "Carina Hong",
"archetype": "pi-bridge",
"shape": "π",
"one_line": "Bridges formal mathematics and Lean verification into the core architecture of reliable AI reasoning.",
"cognitive_basis": {
"credentialPath": "doctoral",
"abstractionDirection": "top-down",
"exitHorizon": "deferred",
"moatInstinct": "theoretical-insight",
"capitalPosture": "venture"
},
"operating_questions": [
"What must be formally verifiable for this system to be trustworthy at superhuman scale?",
"Where does probabilistic generation hit a structural ceiling?",
"How do we turn verification from a cost center into a brilliance-compounding engine?"
],
"first_principles": [
"Mathematics and code are isomorphic (Curry-Howard).",
"Verification is how brilli
…