Update — August 11, 2026: Anthropic published a comparable claim with a comparable evidence package — an unreleased Claude research model raised the proven lower bound for Riemann zeta zeros on the critical line from 41.6% to 67.2%, also with a public Lean formalization and named external reviewers. The same caveat applies to both: a Lean certificate proves the formal statement, not that the formal statement matches the informal claim.
Update — August 4, 2026: OpenAI's own announcement thread put the price tag on the results — roughly $2,000 worth of GPT-5.6 Sol API tokens for the ten proofs combined. See the original post and follow-up thread below.
Update — August 3, 2026: Elon Musk replied to the Astra discussion with “Welcome to the Singularity.” Our explainer covers what the AI singularity means after that welcome.
OpenAI says an internal version of Astra solved ten long-standing problems in mathematics and theoretical computer science. That is an extraordinary claim. It is also unusually inspectable: OpenAI released a 249-page manuscript collection, model-written reasoning walkthroughs, and public Lean certificates for all ten results.
OpenAI's thread frames the stakes plainly: mathematics underpins everyday technology, from GPS to weather forecasting to medical imaging, so progress on foundational open problems can ripple outward. The video above walks through how the ten results were selected and verified.
The careful conclusion is not “AI has unquestionably settled ten famous problems.” It is that OpenAI has published ten concrete mathematical claims with substantially more verification material than a benchmark score or a lab announcement normally provides. The Lean artifacts raise the evidentiary bar. Independent mathematicians still have to verify that each formal statement matches the intended problem, judge novelty against the literature, and determine how much the results change their fields.
TL;DR — what was actually released?
| Question | Direct answer |
|---|---|
| How many results? | Ten, across pure mathematics and theoretical computer science |
| Which model? | An internal version of Astra, described as OpenAI’s next major model family |
| What evidence is public? | Manuscripts, reasoning walkthroughs, and Lean certificates in a public repository |
| What did humans do? | OpenAI says humans prepared manuscripts with the model; Astra generated the arguments and formalized them |
| Is this peer review? | No. Formal checking is powerful evidence, but independent mathematical review remains necessary |
| How much did it cost? | OpenAI says roughly $2,000 in GPT-5.6 Sol API tokens across all ten results |
| Biggest implication? | Frontier AI evaluation is moving from short-answer tests toward original, auditable research outputs |
The ten Astra results, in plain language
OpenAI’s August 1 announcement says the selected problems had seen no progress on their main result for at least a decade, and usually longer. The accompanying manuscript collection gives precise statements.
| Area | What OpenAI claims Astra established | Why it matters |
|---|---|---|
| High-dimensional sphere packing | New upper bounds reaching the asymptotic Cohn–Elkies threshold | Improves a general exponent that had resisted progress since 1978 |
| Binary and spherical codes | Exponentially improved upper bounds at prescribed minimum distance | Connects geometry, information theory, and error-correcting codes |
| Non-sofic groups | An explicit construction proving non-sofic groups exist | Addresses a central existence question in group theory |
| Connes rigidity | Infinitely many nonisomorphic property-T groups sharing a von Neumann algebra | Disproves a rigidity expectation linking groups to operator algebras |
| Arithmetic circuit complexity | Lower bounds for computing the permanent, including formula size on the order of n^4 / log n | Advances a difficult program in algebraic complexity |
| Quantum parallel repetition | An exponential repetition theorem for every finite two-player entangled game | Extends a foundational classical principle into quantum complexity |
| Closest vector problem | A direct reduction giving polynomial-factor approximation hardness | Matters to lattice complexity and post-quantum cryptography |
| Ehrhart volume | The sharp maximum (n+1)^n / n! under the conjecture’s conditions | Resolves a convex-geometric extremal problem in every dimension |
| Multicolor Ramsey numbers | A superexponential lower bound, summarized as R_k(3) = k^{Theta(k)} | Resolves Erdős problem 183 |
| Extremal graph theory | Counterexamples to compactness and degeneracy conjectures | Resolves Erdős problems 146 and 180 |
This breadth is part of the story. The results do not all come from one reusable trick. They touch geometry, algebra, quantum games, cryptography, coding theory, and combinatorics. That makes the release more consequential than a system solving ten variations of one benchmark format.
It also makes expert review harder. A single mathematician cannot credibly validate the significance of all ten. Each claim needs specialists who understand the relevant definitions, earlier partial results, and hidden equivalences.
Why the Lean certificates matter
Lean is an interactive theorem prover. Instead of asking a human reader to follow persuasive prose, it requires a mathematical claim and its proof to be expressed in a formal language. Lean’s small kernel then checks whether the proof term follows from the definitions, assumptions, and axioms.
OpenAI’s public ten-proofs repository contains a separate Lean file for each result. Its manifest reports sorry_count: 0, meaning the published formalizations do not leave declared proof holes using Lean’s usual sorry escape hatch. The manifest lists only standard logical dependencies such as propositional extensionality, classical choice, and quotient soundness.
That is strong evidence. A long informal proof can hide a missing case, a reversed inequality, or an unjustified leap. A compiled Lean proof cannot simply wave those steps away.
But “Lean verified” has a precise boundary:
- Lean verifies the theorem as formalized, not a newspaper headline.
- Humans must check that the definitions capture the intended mathematical objects.
- Experts must confirm the formal theorem is genuinely equivalent to, or strong enough to resolve, the historical problem.
- A proof assistant does not judge whether a result is novel, already implicit in prior work, or important in the way its framing suggests.
- Repository metadata and reproducible compilation are not substitutes for independent review of the entire mathematical package.
This is why the best description is machine-checked evidence plus an open invitation to audit, not “trust the lab” and not “case closed.” Our guide to AI, Lean, and the future of mathematicians explains why formalization is becoming a central bridge between generated arguments and community confidence.
Discovery, manuscript preparation, and formalization are different jobs
OpenAI’s attribution statement is unusually direct. The company says the mathematical arguments were generated by Astra, while humans helped prepare the manuscripts and the model later formalized each argument in Lean. It says claiming human authorship for an AI-generated proof would misrepresent how the work was produced.
That splits the pipeline into three stages:
- Discovery: finding the construction, counterexample, inequality, or reduction that moves the problem.
- Exposition: turning the discovery into a manuscript that specialists can read, critique, and situate.
- Formal verification: translating the claim and proof into definitions and proof terms accepted by Lean.
The distinction matters because success at one stage does not automatically imply success at the others. A beautiful informal idea can be formalized incorrectly. A valid formal theorem can be weaker than the famous conjecture people think it resolves. A correct and novel proof can still be poorly explained.
OpenAI also released reasoning walkthroughs describing failed approaches, perspective shifts, and the route to each solution. Those documents are useful research narratives, but they should not be confused with raw, complete internal reasoning traces. OpenAI describes them as notes written by a model after reading the original work and papers. They are reconstructions intended to make discovery legible.
How this compares with OpenAI’s earlier Erdős result
In May 2026, OpenAI published an AI-generated disproof of the Erdős unit-distance conjecture. That announcement explicitly described checks by outside mathematicians. The August ten-proof announcement does not make the same broad external-review claim for the new set.
That difference should remain visible. It does not mean the new results are false. It means readers should avoid transferring the validation status of the May result onto ten different August manuscripts.
The earlier result also showed what happens after a credible AI contribution enters mathematics: human researchers connect it to other questions, strengthen it, simplify it, or find new applications. OpenAI’s new release cites follow-on work inspired by the unit-distance disproof. If the Astra results survive scrutiny, their importance will be measured partly by that downstream human research—not just by the original announcement.
Does this mean AI can replace mathematicians?
No single release answers that question. It does, however, eliminate an increasingly weak fallback claim: that frontier models can only interpolate textbook exercises or perform formal clerical work.
If Astra generated genuinely new solutions across these domains, then AI can contribute at the research frontier. The remaining human work is not cosmetic. Researchers still choose problems, define standards of importance, challenge assumptions, compare proofs, explain ideas, train students, and decide what should be trusted.
The more realistic transition is from mathematician-versus-machine to a layered workflow:
problem selection
-> AI search and conjecture generation
-> human mathematical review
-> AI-assisted formalization
-> independent reproduction
-> community interpretation and follow-on research
That resembles the “Big Mathematics” future discussed in our mathematician career analysis: humans coordinate questions and meaning while machines search larger spaces and help make proofs auditable.
The right standard for evaluating Astra’s claims
A binary reaction—breakthrough or hype—throws away useful information. A better audit asks five questions for each paper:
1. Is the formal statement the historical target?
Specialists should compare the manuscript, Lean definitions, and original conjecture. Small changes in quantifiers, regularity assumptions, dimensions, or approximation factors can radically change a theorem.
2. Does the Lean project reproduce?
Independent users should build the repository with pinned dependencies, inspect axioms, and confirm the headline declarations are reached without placeholders.
3. Is the argument novel?
Search and expert memory matter. A model may rediscover an unpublished observation, combine known lemmas in a new way, or produce a genuinely new method. Those are different contributions.
4. Can humans explain the mechanism?
A machine-checked proof may be correct yet unenlightening. The best outcome is a proof that changes how mathematicians see the problem, not merely a certificate that a statement follows.
5. Does the result generate more mathematics?
Follow-on theorems, simpler proofs, stronger bounds, and new connections are better measures of impact than launch-day attention.
These standards also clarify the separate debate over whether Astra counts as superintelligence. Ten frontier results could demonstrate extraordinary mathematical capability without establishing broad superiority in virtually every cognitive domain.
Bottom line
OpenAI has not merely posted a score. It has put forward ten named results, full manuscripts, and formal artifacts that experts can attack line by line. That makes the Astra release one of the strongest public tests yet of AI as an original mathematical researcher.
The correct response is neither automatic belief nor reflexive dismissal. Compile the certificates. Check the statement mappings. Invite the relevant communities to review novelty and significance. Then watch whether the proofs produce better proofs and new ideas.
If the set holds up, the milestone will not be that a chatbot became good at math. It will be that an AI system entered the research record with work designed to be independently audited.
Related on explainx.ai
- When answers get cheap, trust becomes the job — the human side of why Lean certificates exist: until a proof is checked, it is not different from slop
- What is the AI singularity? Musk’s August welcome explained
- OpenAI Astra announced: what we know about the next major model
- Has AI reached superintelligence? The Astra debate
- Will AI replace mathematicians?
- DeepMind’s four pathways from AGI to ASI
- How to read AI benchmarks without getting fooled
- The history of artificial intelligence, 1950–2026
Primary sources: OpenAI’s ten-advances announcement · Ten manuscripts · Reasoning walkthroughs · OpenAI ten-proofs repository
This article reports OpenAI’s claims and the public verification material available on August 2, 2026. It does not certify the novelty or correctness of the ten results. Those judgments belong to independent specialists and the relevant mathematical communities.