Claude formalizes the full Ternary Goldbach proof in Lean 4, no sorry, three axioms
Singularitarian · x · 2026-11-11
Claude has completed a formalization of the Ternary Goldbach conjecture in Lean 4 and Mathlib — every odd integer greater than 5 is a sum of three primes. The proof follows Harald Helfgott's 2013 announcement, whose long and hard-to-follow computations had led some experts to question its correctness.
Per the project README:
- The proof is complete: no sorry, main theorems rely only on Lean's three standard axioms
- Two published numerical results are explicit hypotheses: Platt's GRH verification (RH up to 10^8 at q=1) and binary Goldbach verified up to 4×10^18
A landmark for AI-driven mathematical formalization, and an answer to verification concerns around Helfgott's proof.
More from AGI Musings
- Reddit take: $200k GDP per capita is the threshold for a post-labor AI world — deferare · 2026-11-11
- Who owns scientific progress under gradual disempowerment? — najoungkim · 2026-11-11
- Terence Tao: AI lacks its Shannon theory, so nobody knows scaling's limits — burny_tech · 2026-11-11
- The same people cite an existential AI race with China and want looser GPU export controls — austinc3301 · 2026-11-11
- Turing Post editorial: the anxiety of abundance in AI is burning out top performers — TheTuringPost · 2026-11-11
- Redwood reframed: doing narrow safety work to buy odds, not solve AI safety broadly — austinc3301 · 2026-11-11