{"schema":"postcutoff/event@1","as_of":"2026-10-30T13:42:00+01:00","url":"https://postcutoff.com/e/2026-10-27-axiom-cfsg-classification-finite-simple-groups-lean/","md":"https://postcutoff.com/e/2026-10-27-axiom-cfsg-classification-finite-simple-groups-lean/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-10-27-axiom-cfsg-classification-finite-simple-groups-lean","date":"2026-10-27","date_precision":"day","short_title":"Axiom: Classification of Finite Simple Groups formalized in Lean","deck":null,"takeaway":"On 27 Oct 2026 Axiom Math published a Lean 4 formalization of the Classification of Finite Simple Groups (CFSG). The proof was originally spread over hundreds of papers and an estimated 10,000–15,000 pages. Axiom says it is sorry-free, follows the first-generation proof, and was built by AI agents working with about 30 mathematicians and engineers. Press reports put the build time at 24 days. Along the way the team found a false step in one published route to the Unbalanced Group Theorem and wrote a replacement argument. The project is self-reviewed: outside experts have not yet re-run the build or checked that the Lean statement matches CFSG.","category":"science","category_label":"Science & math","importance":5,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"Axiom: Classification of Finite Simple Groups in Lean (project page)","url":"https://cfsg.axiommath.ai/","type":"official","group":"primary","domain":"cfsg.axiommath.ai"},{"n":2,"title":"GitHub: AxiomMath/CFSG (README, sorry-free claim)","url":"https://github.com/AxiomMath/CFSG","type":"code","group":"primary","domain":"github.com"},{"n":3,"title":"Axiom on X: 'The largest math proof in human history is now computer-verified' (3.3M views)","url":"https://x.com/axiommathai/status/2115089794867040584","type":"official","group":"primary","domain":"x.com"},{"n":4,"title":"TauCeti: CFSG statement used as the target","url":"https://github.com/TauCetiProject/TauCeti/blob/6e0c6acab5f4c6f42e5f5bab9bd5e4e84f74c380/TauCeti/GroupTheory/SpecificGroups/CFSG/Classification.lean#L52-L56","type":"code","group":"primary","domain":"github.com"},{"n":5,"title":"FormaTheoria (Aug 2026): AI-built Lean theories toward CFSG (earlier partial effort)","url":"https://arxiv.org/abs/2608.10894","type":"paper","group":"primary","domain":"arxiv.org"},{"n":6,"title":"Axiom: Formalizing the Enormous Theorem (blog, 26 Oct 2026)","url":"https://axiommath.ai/research/the-enormous-theorem-formalized/","type":"official","group":"primary","domain":"axiommath.ai"},{"n":7,"title":"Hexagon 2610.00575v1: The Unbalanced Group Theorem (Defant, Ono contributors)","url":"https://hexagonmath.org/2610.00575?version=1","type":"paper","group":"primary","domain":"hexagonmath.org"},{"n":8,"title":"36Kr: Dozens of agents spent 24 days … uncovered a 40-year-old unnoticed loophole","url":"https://eu.36kr.com/en/p/4045021328675973","type":"press","group":"press","domain":"eu.36kr.com"},{"n":9,"title":"Kingy AI: Axiom says AI formalized a 15,000-page math proof in 24 days (what is not disclosed)","url":"https://kingy.ai/blog/axiom-ai-math-proof-15000-pages-24-days/","type":"press","group":"press","domain":"kingy.ai"},{"n":10,"title":"OfficeChai: Axiom formally verifies the 'Enormous Theorem'","url":"https://officechai.com/ai/axiom-enormous-theorem/","type":"press","group":"press","domain":"officechai.com"},{"n":11,"title":"Unite.AI: Axiom Math releases 43.1M-line Lean proof of group classification","url":"https://www.unite.ai/axiom-math-releases-43-1m-line-lean-proof-of-group-classification/","type":"press","group":"press","domain":"unite.ai"},{"n":12,"title":"Hacker News discussion (217 points)","url":"https://news.ycombinator.com/item?id=50261647","type":"discussion","group":"reactions","domain":"news.ycombinator.com"},{"n":13,"title":"HN: Classification of Finite Simple Groups Formalized in Lean (237 points)","url":"https://news.ycombinator.com/item?id=50261647","type":"discussion","group":"reactions","domain":"news.ycombinator.com"}],"official":7,"filed":"2026-10-28","updated":"2026-10-29","orgs":["Axiom Math"],"title":"Axiom releases a sorry-free Lean proof of the Classification of Finite Simple Groups (43.1M lines, AI agents, about 24 days) and reports a flawed step in Walter's 1986 Unbalanced Group Theorem route","summary":"Axiom Math's CFSG repository (github.com/AxiomMath/CFSG, created 27 Oct 2026) claims \"a sorry-free Lean4 (v4.35.0-rc3) proof of the Classification of Finite Simple Groups (CFSG), built on Mathlib and TauCeti, using the standard axioms Classical.choice, propext, and Quot.sound (no native_decide)\", following the first-generation proof. The project page reports 43.1M lines of Lean, 2.05M declarations and 715 source papers and books. The final statement is TauCeti's ClassificationStatement: every finite simple group is isomorphic to a group on an explicit classification list. Axiom's announcement on X (\"The largest math proof in human history is now computer-verified\") had 3.3M views within a day. The team also reports a counterexample to a closure assertion in one published argument for the Unbalanced Group Theorem and gives an alternative route.","key_facts":["Claim (README, verbatim): 'A sorry-free Lean4 (v4.35.0-rc3) proof of the Classification of Finite Simple Groups (CFSG), built on Mathlib and TauCeti, using the standard axioms Classical.choice, propext, and Quot.sound (no native_decide). We primarily follow the first generation proof of CFSG.'","Statement: TauCeti's `ClassificationStatement : ∀ (G : Type u) [Group G] [Finite G] [IsSimpleGroup G], ∃ i : CFSGIndex, Nonempty (G ≃* i.Group)`, i.e. every finite simple group is isomorphic to one of the explicitly constructed groups on the list: cyclic of prime order, alternating, of Lie type, or one of the 26 sporadic groups","Scale (project page): 43.1M lines of Lean, 2.05M declarations, 100 milestones, 715 papers and books. The build needed 'a few open changes to Lake and some optimizations we plan to upstream soon to get this project's build time under 24 hours'","People (project page): core contributors Dean Cureton, Vasily Ilin, Bhavik Mehta and Niels Voss; about 30 further mathematical and engineering contributors; Letong Hong listed as principal investigator. Richard Lyons and Ronald Solomon were consulted (36Kr; no quotes given)","AI role: the page describes 'the initial blueprint we gave the agents'. An Axiom staff member wrote on Hacker News that 'a swarm of agents was tasked with going through all these sources' (more than 500 articles and books) and that the hard part was assembling 'a coherent whole'. Which models were used is not stated. 36Kr reports 'dozens' of agents with a changing multi-model mix plus Axiom's own AxiomProver, working about 1–26 Oct. Kingy AI reports Axiom's figure of 24 days and notes that compute, cost and person-hours are not disclosed","Gap found: an agent found a counterexample, built from PSL₂(49) (whose induced involution gives PSL₂(7)), to a closure assertion in John Walter's 1986 route to the Unbalanced Group Theorem. The team proved a replacement result ('Preservation of simple tops', Theorem 2.3 of a 35-page paper on Hexagon), and an alternative route uses Solomon's 1976 theory of maximal 2-components (36Kr, Kingy AI). The reports say this does not overturn the Unbalanced Group Theorem or CFSG","Status: self-assessed (the repository marks review as team self-assessment). Axiom asks experts to re-run the check and confirm that the Lean statement says what CFSG says. No independent build or expert audit reported as of 28 Oct","Reach: Axiom's X post (27 Oct, 14:34 UTC) had 3.31M views, 6.3k likes and 1.6k reposts by 28 Oct (fxtwitter); Hacker News thread 217 points, 67 comments","Context: the human Lean CFSG effort (Renaissance Philanthropy 'modular human–AI approach') and the AI-assisted FormaTheoria project (Aug 2026; about 994k lines through Bender–Suzuki, Feit–Thompson, Glauberman Z*, Brauer–Suzuki) were partial. A second-generation (Gorenstein–Lyons–Solomon) proof is still being published","Axiom's blog post 'Formalizing the Enormous Theorem' (26 Oct): 'there were 34 noteworthy deviations from the published record that needed to be resolved', the most substantial in the Unbalanced Group Theorem; a second flaw sat in a lemma of the Aschbacher–Smith quasithin volumes, where 'The agents found a counterexample involving the group SL₂(5)' (a quantity was 1 where the asserted equality needed 2), repaired with an inequality and a new case split","Scale and process (blog): the work was split 'into 108 milestones and about 380 smaller tasks'; the formalization 'incorporates ~1.2 million lines of code from' the Qiuzhen-CFSG repository; on models it says only that 'The agents used a changing mix of models, with coordinating tools supporting their work'. Axiom names Richard Lyons, Dan Nakano and Ron Solomon as external advisors and will keep 'curating and resolving the errata in partnership with an advisory board of group theorists'","New mathematics: the blog says a preservation result 'is a new result in group theory proved by AxiomProver, stated as Theorem 2.3'. The accompanying Hexagon paper 'The Unbalanced Group Theorem' (hexagon:2610.00575v1, 27 Oct, contributed by Colin Defant and Ken Ono of Axiom Math) is tagged 'Primarily human-written text'","Independent checks as of 29 Oct: none found. AxiomMath/CFSG on GitHub (created 27 Oct) had no open issues, 132 stars and 15 forks; the HN thread (237 points) showed no group theorist or Lean maintainer weighing in; no comment from Lyons, Solomon, Aschbacher or Buzzard"],"key_numbers":[],"tags":["math","group-theory","finite-simple-groups","cfsg","lean","formalization","autoformalization","agents","axiom"],"science":{"field":"mathematics","subfield":"group theory (finite simple groups), formal verification","problem":"Classification of Finite Simple Groups (announced c. 1983, quasithin gap closed by Aschbacher–Smith 2004): formal machine-checked proof","result":"Claimed complete, sorry-free Lean 4 formalization of the first-generation CFSG proof against TauCeti's statement, plus a repaired step in one published route to the Unbalanced Group Theorem","open_since":"1983","ai_system":["AxiomProver","Axiom agents (models not disclosed)"],"human_role":"AI agents formalized the literature from a human-written blueprint; about 34 named mathematicians and engineers; experts Lyons and Solomon consulted","verification":{"key":"lean","label":"Lean-verified","text":"Lean 4 kernel check claimed by the team (sorry-free, standard axioms); not yet independently rebuilt or audited"},"status":"pending","shock":"A formalization effort that experts had expected to take decades (the proof spans an estimated 10,000–15,000 pages) is reported done in weeks by AI agents"},"body_md":"## What happened\n\nThe Classification of Finite Simple Groups says that every finite simple group is cyclic of prime order, alternating, of Lie\ntype, or one of 26 sporadic groups. Group theorists sometimes call it the \"periodic table of symmetry\". Its proof was assembled by\nabout a hundred mathematicians from the 1950s to 2004 and is spread over hundreds of papers. It is often called the longest proof\nin mathematics, at an estimated 10,000–15,000 journal pages.\n\nOn 27 Oct 2026 Axiom Math published a Lean 4 development that it says proves the classification with no `sorry` placeholders,\nusing only Lean's three standard axioms and no `native_decide`. The target statement is taken from the separate TauCeti project,\nso the theorem being proved was fixed in advance by someone else. The development follows the \"first-generation\" proof. Axiom\nsays AI agents worked from a blueprint the team wrote, with about 30 mathematicians and engineers. The models have not been\nnamed, and compute and cost have not been disclosed. Building the project takes almost a day even with patched build tools.\n\nWhile formalizing, an agent found that a closure assertion in John Walter's 1986 work toward the Unbalanced Group Theorem is\nfalse, with a counterexample built from PSL₂(49). The team proved a replacement lemma and gave another route. Reports stress that\nthe theorem itself is not in doubt.\n\n## Why it matters\n\nIf outside checks confirm it, this is the largest formal proof ever produced, about 43 million lines. It would remove the old\nworry that a proof no single person has read in full might hide a gap. Experts had expected a human formalization to take\ndecades. On Hacker News, commenters noted that what still needs human checking is mainly the Lean statement and the kernel, not\nthe 43 million lines. The run also found a real flaw in the published literature on the way.\n\nOpen questions: nobody outside Axiom has yet rebuilt it, the review is self-assessed, and the models and compute are not disclosed.","disputed":[{"label":"Verification","text":"Lean 4 kernel check claimed by the team (sorry-free, standard axioms); not yet independently rebuilt or audited","sources":[]}],"related":[{"id":"2026-10-28-ai-assisted-results-october-28-listing","url":"https://postcutoff.com/e/2026-10-28-ai-assisted-results-october-28-listing/","date":"2026-10-28","date_precision":"day","short_title":"AI-assisted results in the 28 Oct 2026 sweep","deck":"Bialostocki–Lotspeich (1992), part of Gross–Prasad in geometric Langlands, Fuglede in 𝔽₂⁸, a TEMPO structure found by Claude, agent swarms on fractional Chern insulators, and a human digest of GPT-6 Astra's Smale counterexample","takeaway":"The 28 Oct sweep covered the arXiv announcement of 26–27 Oct submissions and late papers from 23–26 Oct. Five results have their own entries: Axiom's Lean proof of the Classification of Finite Simple Groups, OpenAI's spin-one Haldane gap proof (found through Hal Tasaki's follow-up), OpenAI's De Giorgi dimension-eight claim, Morgan–Mullen with Claude and Lean, and formula minimization with GPT-Sol-6.1. This page lists the rest. Claude, GPT-6 Astra and GPT-6 Pro supplied ideas, counterexamples or whole arguments in papers on zero-sum sequences, geometric Langlands, quantum dynamics, fire-blocking and spectral bounds.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":21,"official":19,"filed":"2026-10-28","updated":"2026-10-28","orgs":["OpenAI","Anthropic","Google DeepMind","various researchers"]},{"id":"2026-10-16-openai-2d-area-law-lean-formalized-axiom","url":"https://postcutoff.com/e/2026-10-16-openai-2d-area-law-lean-formalized-axiom/","date":"2026-10-16","date_precision":"day","short_title":"OpenAI's 2D area law proof Lean-verified by Axiom","deck":null,"takeaway":"One of the physics claims in OpenAI's October maths release, an entropy area law for gapped 2D lattice ground states (open since Hastings' 1D proof in 2007), now has a complete Lean 4 proof with a frozen statement layer and comparator check, produced by AI agents under a human auditor.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":6,"official":5,"filed":"2026-10-18","updated":"2026-10-18","orgs":["Axiom Math","OpenAI"]},{"id":"2026-10-12-cureton-thorner-dedekind-zeta-zero-free-axiomprover","url":"https://postcutoff.com/e/2026-10-12-cureton-thorner-dedekind-zeta-zero-free-axiomprover/","date":"2026-10-12","date_precision":"day","short_title":"Cureton and Thorner, with AxiomProver, extend the quasi-Riemann zero-free half-plane to every Dedekind zeta function (Re s > 31/32, Lean-formalized)","deck":null,"takeaway":"It is one of the first results to build directly on OpenAI's claimed quasi-Riemann breakthrough.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":4,"official":3,"filed":"2026-10-18","updated":"2026-10-18","orgs":["Axiom Math"]},{"id":"2026-10-06-hironaka-resolution-of-singularities-lean-fable-agents","url":"https://postcutoff.com/e/2026-10-06-hironaka-resolution-of-singularities-lean-fable-agents/","date":"2026-10-06","date_precision":"day","short_title":"Hironaka's resolution of singularities formalized in Lean by agents","deck":null,"takeaway":"Resolution (resolution.org) reports that an orchestrated team of agents, mostly Claude Fable 5.1 with occasional checks by GPT-6 Astra, autoformalized Hironaka's 1964 theorem in characteristic zero between 4 and 10 Sept 2026, together with refinements by Kollár, Włodarczyk and Bierstone–Milman. That took about 100B input tokens, 300M output tokens and roughly $135k. A human mathematician intervened about 30 times. The repository says neither library contains a sorry.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":5,"official":4,"filed":"2026-10-26","updated":"2026-10-29","orgs":["Resolution","Anthropic"]},{"id":"2025-12-06-axiomprover-putnam-2025","url":"https://postcutoff.com/e/2025-12-06-axiomprover-putnam-2025/","date":"2025-12-06","date_precision":"day","short_title":"AxiomProver produces machine-checked Lean proofs for all 12 Putnam 2025 problems","deck":null,"takeaway":"Formal verification removes grading disputes like those around informal IMO proofs, and showed formal provers catching up with informal LLMs on hard competition maths.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":2,"official":2,"filed":"2026-09-29","updated":"2026-09-29","orgs":["Axiom Math"]}],"people":[{"id":"kevin-buzzard","name":"Kevin Buzzard","url":"https://postcutoff.com/person/kevin-buzzard/"}],"posts":[{"id":"x-axiommathai-2115089794867040584","title":"“The largest math proof in human history is now computer-verified. Today, Axiom announces…”","url":"https://postcutoff.com/p/x-axiommathai-2115089794867040584/"}],"videos":[],"models":[],"changes":[{"date":"2026-10-29","type":"edit","text":"Added Axiom's blog details (34 deviations, SL₂(5) quasithin flaw, 108 milestones, Qiuzhen-CFSG code, advisors), the Hexagon paper and the state of independent checks (science agent)"},{"date":"2026-10-28","type":"filed","text":"Created (science agent; project page, README and GitHub API, fxtwitter, HN thread, 36Kr, Kingy AI)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-28","run":null,"sources_read":null,"updated":"2026-10-29","human_review":null,"version":{"date":"2026-10-29"}},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":180,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":119,"in_training_data":false},{"model_id":"gemini-4-argon","name":"Gemini 4 Argon","cutoff":"2026-03","days_after":210,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":149,"in_training_data":false}],"short_url":"https://postcutoff.com/s/axiom-classification-finite"}