A frontier AI model has produced the first machine-checked proof of a theorem that stood unformalized for twenty years — and it nearly gave up halfway through. Vals AI reported on Wednesday that OpenAI's GPT-6.2 Astra formalized Smoktunowicz's Gap Theorem in Lean, the proof assistant that checks every logical step by machine: 1,794 lines of verified code, produced in 94 minutes, for $21.58. As far as Vals knows, nobody had ever formalized the result before.

The claim surfaced on r/singularity, where the thread's top comments did something unusual for a hype post: they corrected the record in the model's favour and against it at the same time, laying out exactly where the run stumbled and why the ending still counts. That is the story here — not just a new entry on a benchmark leaderboard, but a run that failed in public, was forced to continue, and then succeeded.

What Astra actually proved#

The theorem belongs to abstract algebra. The Gelfand–Kirillov dimension is a number that measures how fast an algebra grows; Smoktunowicz's Gap Theorem, proved on paper in 2006 by Agata Smoktunowicz, now a professor at the University of Edinburgh, says that for graded domains there is a forbidden zone — no such algebra can have a dimension strictly between 2 and 3. It is the kind of result mathematicians have known for two decades without ever having a computer verify it line by line.

Vals' wording is careful, and worth quoting precisely: the theorem is one that, 'as far as we know, had never been formalized,' and Astra is 'not only the only language model we tested to formalize Smoktunowicz's theorem, it's also the only formalization we've ever heard of.' The proof is also genuinely the model's own work in an important sense: Vals says the argument 'takes a different route from the published one' — a formal proof of the theorem, not a formalization of Smoktunowicz's proof.

An abstract proof tree with one step glowing as accepted while surrounding steps wait in shadow
AI-generated editorial illustration.

Ninety-four minutes, one false finish#

The run's most interesting detail is the one a vendor would normally leave out. Forty-seven minutes in, Astra submitted a proof with a gap in it. The grader rejected it, and the model did something models are rarely credited with: it filed an honest 'unsolved' report instead of papering over the failure.

It did not get to stop there. Autoform-Hard does not let a model quit until it has spent $20, and Astra had spent about $8, so the harness sent it back to work. It spent the next nine minutes thinking without writing any code, then started on a new approach — and the grader accepted the full proof 39 minutes after the 'unsolved' report. The whole run cost $21.58.

The Reddit thread that carried the news got the timeline right. The top commenter, michaelTM_ai, laid out the near-quit in detail and still called the result 'the first machine-checked version of it, in lean.' Another commenter, JasonBellUW, who knew Smoktunowicz, wrote that he 'had no idea it would be so difficult to formalize.' Nobody in the thread disputed that the proof was accepted.

Why the check matters more than the clock#

Ninety-four minutes is a striking number, but the verification is the part that makes the claim worth reporting. A Lean proof is not a persuasive essay: the proof assistant checks every step mechanically, and a proof with a gap in it does not pass. Vals says Autoform-Hard accepts a proof only under clean-room grading — the statement has to match the original theorem exactly, the proof may use only Lean's standard axioms, and an independent kernel then replays the whole thing. This one, Vals reports, builds with no sorry placeholders and no warnings, uses no native_decide, new axioms, unsafe code or redefinitions of benchmark objects, and its statement matches Theorem 1 of the paper, including the finite-dimensional degree-zero part.

That rigour is also what separates this from the benchmark leaderboard it sits on. Autoform-Hard is a set of 56 research-level formalization tasks drawn from Meta FAIR's AutoformBench, whose Lean statements were written and audited by experts. Exactly one task separates the top of the board: GPT-6.2 Sol and Claude Fable 5.2 solve the same 48 tasks, and Astra solves a 49th — this one — and is the only model on the board to do so.

A chalkboard covered in abstract algebra diagrams with a visible gap between two marked dimension levels
AI-generated editorial illustration.

What to watch#

Three things to watch. First, independent scrutiny: the proof is machine-checked, but no mathematician outside Vals has publicly assessed it yet, and Vals' own 'as far as we know' leaves room for a prior formalization to surface. The claim to watch is not the 94 minutes — it is whether the proof survives expert eyes.

Second, whether Autoform-Hard becomes a serious yardstick. One task separating the top three models is a thin margin, and a benchmark is only as good as its grading — but a benchmark where the deciding task is a real theorem, checked by an independent kernel, is a harder target to game than most.

And third, the pattern. This is the fourth machine-checked mathematics story in a month: a KITP panel validated OpenAI's AI-generated Yang-Mills proof, Google's Antigravity agents formalized the Weil conjectures and settled a 2013 open problem, and an unreleased Anthropic model settled the Aaronson–Ambainis conjecture. Formalization is becoming a frontier-model capability race in its own right — and at $21.58 a theorem, the economics of checking mathematics are changing faster than the mathematics itself.

Sources: Vals AI, ''GPT-6.2 Astra Formalizes Smoktunowicz's Gap Theorem''; r/singularity thread on the Vals AI report; AGI Hunt summary of the Vals AI report.