| |
| ResearchAudio.io |
Aug 4, 2026 |
|
OpenAI Cited the Declaration That Warned About This
Ten proofs. About 2,000 dollars in tokens. The strongest verification any machine-produced mathematics has cleared, and three questions it still leaves open.
|
|
|
|
On August 1, OpenAI published ten new results in mathematics and theoretical computer science. Each one answers a problem that had seen no progress on its main result for at least a decade, and in most cases far longer. The arguments were produced by an internal version of Astra, which OpenAI describes as its next major model.
The number everyone repeated was the price. OpenAI put the tokens needed to find all ten solutions at roughly 2,000 dollars at Sol API rates. That number is doing a lot of work in a lot of arguments this week, and it deserves a closer look.
But the part that matters for anyone shipping with frontier models is not the price. It is that every argument came with a machine-checkable Lean certificate. You do not have to trust OpenAI. You can run the checker. That single property changes what a claim costs to evaluate, and it is the thing worth stealing.
It also has a hard edge. Two months before any of this shipped, roughly 3,400 mathematicians signed a document naming the precise gap that a Lean certificate does not close. OpenAI linked to that document in its own announcement.
|
|
§ 01 / What shipped
Ten results, one repository, three artifacts
The release has three parts. A 249 page manuscript collecting the ten arguments. A second document in which the model narrates how each solution came together. And a public repository of Lean 4 formalizations, one file per result.
The workflow OpenAI describes is worth reading carefully, because the division of labor is unusual. The model generated the mathematical arguments. Humans, working with the same model, turned those arguments into manuscripts. Then the model formalized each argument into Lean. OpenAI says it takes responsibility for correctness while attributing the arguments themselves to the system.
The results span high-dimensional geometry, coding theory, group theory, operator algebras, arithmetic circuit complexity, quantum complexity, lattice cryptography, and extremal combinatorics.
|
|
Figure 1 / the ten, and what kind of claim each one is
|
| Result |
Type |
Lean file |
| Sphere packing, bounds to the Cohn-Elkies threshold | bound | SpherePacking |
| Binary and spherical codes, exponentially stronger bounds | bound | MetricCodes |
| Non-sofic groups, an explicit construction | resolution | NonSoficGroup |
| Connes's rigidity conjecture, a counterexample | resolution | ConnesRigidity |
| Permanent, arithmetic formula lower bound at n⁴/log n | bound | Permanent |
| Quantum parallel repetition for two-player games | theorem | QuantumParallelRepetition |
| Closest vector problem, polynomial-factor hardness | theorem | GapCVP |
| Ehrhart's volume conjecture, sharp in every dimension | resolution | EhrhartVolumeInequality |
| Multicolor triangle Ramsey, Erdős problem 183 | bound | MulticolorTriangleRamsey |
| Compactness and degeneracy, Erdős problems 146 and 180 | resolution | CompactnessAndDegeneracy |
|
|
Roughly half the ten resolve a named conjecture. The rest improve bounds, which is a real contribution and a different claim. Source: OpenAI publication and the openai/ten-proofs README. The repository lists twelve formal endpoints for these ten results, because the coding and graph theory entries each carry two claims.
|
|
|
§ 02 / The mechanism
Trust moved from the producer to the artifact
In May, when OpenAI announced a machine-generated disproof of the Erdős unit-distance conjecture, the validation was social. Outside mathematicians read the argument and vouched for it. That is a strong signal, but it does not travel. To repeat the check you need the same expertise, and the check is a judgment rather than a result.
A Lean certificate is a different kind of object. Lean has a small trusted kernel. Feed it the formalization and it returns a binary verdict: the proof term type-checks against the stated theorem, or it does not. No credentials required. The repository pins its environment to Lean 4.32.0 with mathlib, so the check is reproducible by anyone with a laptop and the toolchain.
|
This is the structural change. Before, evaluating a frontier-model claim meant trusting the lab or hiring the experts. With a certificate attached, the claim carries its own audit. The cost of checking collapses toward the cost of compiling.
|
The repository goes further than most formalization releases. Its manifest declares which axioms the development relies on, and the list contains three entries, all of them the standard foundations that come with the library. Nothing exotic was assumed to make the proofs go through. The repo also ships configurations for checking the exported proofs with a second, independent kernel.
|
|
Figure 2 / formalization.yaml, as published
|
| 1 | version: "v0.3" |
| 2 | project: |
| 3 | license: "Apache-2.0" |
| 4 | sources: [] |
| 5 | axioms: |
| 6 | - "propext" |
| 7 | - "Classical.choice" |
| 8 | - "Quot.sound" |
| 9 | main_results: # twelve entries |
| 10 | review: |
| 11 | status: "agent-reviewed" |
|
|
Three axioms, all standard, so no extra assumptions were introduced to close the arguments. The last line is the one worth sitting with. Source: openai/ten-proofs, formalization.yaml.
|
|
|
§ 03 / The gap
What a kernel check actually certifies
Here is the part that gets skipped in most coverage. A successful kernel check establishes that the encoded conclusion follows from the encoded definitions and assumptions. That is all it establishes.
It does not establish that the formal statement faithfully captures the historical conjecture. It does not catch a definition that quietly weakens the problem into something easier. It does not judge whether the theorem matters. Those are review questions, and they are answered by people who know the field, on a timeline measured in months.
So the certificate is real and the certificate is narrow. Both at once.
|
|
Settled by the kernel
The argument is valid given the formal statement
·
No unstated axioms were introduced
·
No unfinished goals left in the main results
·
Anyone can rerun it, no expertise needed
·
A second kernel can confirm it independently
|
Still open
Does the formal statement match the conjecture
·
Did a definition weaken the problem
·
Does the result carry the significance claimed
·
How many attempts failed before these ten
·
Who picked the problems, and on what basis
|
|
Figure 3. The left column is machine-decided in minutes. The right column is human-decided in months. Both are required before "solved" is the right word.
|
|
|
§ 04 / The missing number
Ten wins, zero published failures
Ernie Davis, writing to Gary Marcus, asked the question that decides how impressed to be: how many conjectures were attempted? If ten were picked at random from the space of open problems and Astra closed all ten, that is astonishing. If fifty were picked because they looked tractable and ten landed, that is still notable and considerably less astonishing. If the model was run against every open Erdős problem and a thousand others, the failures are the more informative number.
The 2,000 dollar figure has the same shape. It is the token cost of finding the solutions that worked. It is a safe assumption that it excludes the runs that went nowhere, and it certainly excludes the salaries of the research staff who picked the problems, prepared the manuscripts, and shepherded the formalizations.
To OpenAI's credit, one of its own researchers said the quiet part out loud. Noam Brown noted that the effort produced "no Millennium Prize Problems (yet)" and added that they had not spent heavily on any single problem, leaving room to push test-time compute much further. That is a more honest framing than most of what circulated on X.
|
If you publish a numerator without a denominator, you have published a marketing metric. This applies to lab announcements and it applies to your own eval reports.
|
Reception among mathematicians has been split rather than dismissive. Thomas Bloom, who maintains the Erdős problems database, called the results big news and rated them significant as constructions, while rejecting the idea that any of this replaces mathematicians. Henry Yuen, reviewing the write-up of one result, found the prose characteristic of model-generated proofs: heavy on setup, casual at the point where the difficulty actually lives.
|
|
§ 05 / The declaration
Written in June, describing August
In its announcement, OpenAI links to the Leiden Declaration on Artificial Intelligence and Mathematics, published on June 2, 2026, endorsed by the International Mathematical Union, and signed by several thousand mathematicians including Terence Tao, Peter Scholze, and Kevin Buzzard. OpenAI cites it while making an argument about attribution: that claiming human authorship for a machine-generated proof would misrepresent both the system and the nature of human intellectual work. On that specific point the company is aligned with the document.
What makes the citation interesting is the rest of the declaration. Its first listed threat is that automated techniques produce plausible but unreliable arguments that are hard to distinguish from correct proofs, and it says explicitly that this applies to formalizations too, because the difficulty sits in the translation between the computer-encoded statement and the human concept it is supposed to represent.
That is Figure 3's right column, written by mathematicians two months before Astra existed publicly. Its fourth threat covers results announced through blog posts on market timelines, ahead of community evaluation. And its recommendations for policymakers include a section headed "don't believe the hype", advising governments to consult mathematicians rather than press releases. That recommendation was published nine weeks before Sam Altman demonstrated Astra to officials in Washington.
The fair reading is not that OpenAI ignored the document. It published a full manuscript rather than a bare press release, released the reasoning narrations, formalized everything, and named the division of labor. The uncomfortable reading is that a checked proof and a checked claim are different objects, and the mathematical community said so in advance.
|
|
§ 06 / The product
Astra is a name, not yet a model you can call
If you are planning around this, keep the two stories separate. The proofs are a capability demonstration from an internal build. Astra as a shipping product is barely specified.
|
|
Figure 4 / astra, as of this issue
|
|
Reported
A new model class alongside Sol, Terra and Luna
Built for long-running work, coordinating multiple agents across hours or days
Demonstrated to officials in Washington
Expected to be the first model through the planned federal pre-release review
|
Unspecified
Whether it ships as a sixth generation or a point release
Release date, context window, pricing, model sizes
Safety card, tool support, availability tiers
Whether the shipping model resembles the internal build that produced the proofs
|
|
Left column via The Information, reported by The Decoder. Right column is what has not been stated anywhere.
|
|
|
One caution on the long-running design. The known weakness of multi-agent setups is compounding error as context grows, and prior work has found that coordination overhead can make additional agents actively worse on tightly coupled tasks like planning. Mathematics is an unusually forgiving domain for this architecture, because a proof attempt either verifies or does not. Most production workloads do not behave that way.
|
|
§ 07 / Carry-out
Four things to take into your own stack
| 01 |
Ship the checker with the claim. The reason these ten results landed differently from every prior mathematics announcement is that the audit is attached. Whatever your model produces, ask what artifact could travel alongside it that lets a skeptic verify without trusting you: a test suite, a replay log, a schema validation, a proof obligation. |
| 02 |
Keep the checker independent of the generator. Lean's kernel was not written by the model whose output it validates, and that independence is the whole value. When your evaluation harness is generated by the same model it evaluates, you have built agreement, not verification. |
| 03 |
Watch the translation layer, not the pass rate. A green suite proves your code satisfies the assertions you wrote. It says nothing about whether those assertions encode the requirement. That gap is where the interesting failures live, and it is exactly the gap the mathematicians flagged in a domain with far better formal tools than yours. |
| 04 |
Record the denominator. Attempts, not successes, is the number that predicts behavior in production. A cost figure computed over the runs that worked will mislead you about your own system just as reliably as it misleads readers about someone else's. |
|
|
What this issue does not establish
I did not build the Lean project or check the certificates, and no peer-reviewed publication or field-specialist verdict on the ten-result bundle has appeared in the days since release. The manuscript acknowledges mathematicians as critical readers of individual chapters, but I did not confirm those names against the manuscript directly, so I have left them out. The claim that Astra coordinates multiple agents over long horizons comes from reporting on unnamed sources, not from OpenAI. And the manifest field reading "agent-reviewed" describes the formalization review process in OpenAI's own tooling vocabulary; I am reading it as written rather than asserting what it excludes.
|
|
|
The ten arguments are in the open, formalized, and rebuildable by anyone who wants to spend an afternoon on it. That is a genuinely higher bar than the industry has cleared before. It is also the easy half. The half that decides what this release means is the one no kernel can compute, and it belongs to people who will take months to answer.
|
|
|
| ResearchAudio.io |
Written for engineers shipping on frontier models |
|
|