Updated October 8, 2026 · 7 min read

GPT-6 Astra cracked a 59-year-old fusion problem: the Grad conjecture story

In September 2026, OpenAI's GPT-6 Astra Pro did something no researcher had managed since 1967: it wrote down exact, explicit solutions to the plasma-equilibrium problem behind the Grad conjecture — a claim that had shadowed the stellarator approach to fusion for 59 years. Here is the verified timeline, the math in plain English, and what it says about where AI science is heading.

What the Grad conjecture says

Fusion reactors have to hold a plasma at over 100 million degrees inside a doughnut-shaped "magnetic cage." The ideal cage is a set of nested magnetic surfaces — like an onion — with magnetic field lines wrapping around each layer, pressure falling smoothly from the core outward, and the plasma's outward push exactly balanced by magnetic forces everywhere (magnetohydrodynamic, or MHD, equilibrium).

There are two main routes to building that cage. Tokamaks (like ITER) are symmetric. Stellarators (like Germany's Wendelstein 7-X) use deliberately twisted, asymmetric coils. The problem: in 1967, Harold Grad of NYU's Courant Institute published a conjecture in Physics of Fluids asserting that smooth toroidal equilibria without symmetry were unlikely to exist — and in 1985 he sharpened it, claiming no smooth families of such solutions exist at all. For 59 years, stellarator physics ran on numerical approximations without knowing whether the perfect equilibrium it approximated strictly existed.

How Astra found the solutions, step by step

The story comes from Matt Landreman, a plasma physicist at the University of Maryland, who documented the entire exchange. He posted his paper to arXiv on September 22, 2026, with the prompts and verification scripts in the paper's GitHub repository:

How the math was verified

This is the part that separates the result from AI hype. Verification happened at two levels:

The 147-page proof the day before

Astra did not act alone. On September 21, 2026 — one day before Landreman's arXiv posting — a paper titled Counterexamples to the Grad conjecture appeared, by Javier Gómez-Serrano (Brown University), Mitchell Taylor (Oxford), and Lukas Liehr (Bar-Ilan University). Their route was pure mathematics: a 147-page construction of wreath-shaped equilibria whose only symmetry is a single cyclic rotation, backed by a formal proof in the Lean 4 theorem prover.

That team worked differently: the authors built the construction roadmap themselves, then used GPT-5.6 Sol, Claude Fable 5, and Claude Opus 5 to fill in technical details, assist computations, and find errors — switching to GPT-6 Astra and Claude Fable 5.1 for late-stage Lean verification and final proofreading. Together, the two papers overturned both Grad's 1967 conjecture and his stronger 1985 claim within a single week. Within days of publication, other mathematicians were feeding the results back to Astra and Claude Opus 5.5 to mine further counterexample families.

Why it matters — beyond the headline

Three takeaways:

Frequently asked questions

Did GPT-6 Astra really "solve" the problem on its own?

The model produced the explicit solutions, but not in a vacuum: a domain expert posed the problem with precise mathematical constraints, judged the outputs, pushed back on the first result, and independently verified every equation. It is best described as human-AI collaboration where the AI supplied the breakthrough construction.

Is the Grad conjecture officially "disproven"?

The two September 2026 papers — Landreman's explicit AI-found solutions and the Gómez-Serrano team's Lean-formalized proof — both construct valid counterexamples, so the conjecture as originally stated fails. Formal peer review of the papers is ongoing, and one counterexample family was found with AI assistance before full formal verification.

Which version of the model was used?

GPT-6 Astra Pro, per the paper's acknowledgments. The companion proof used a mix of earlier and current models (GPT-5.6 Sol, Claude Fable 5, Claude Opus 5, then GPT-6 Astra and Claude Fable 5.1).

Where can I read the paper?

Landreman's paper was posted to arXiv on September 22, 2026, and its GitHub repository includes the exported prompt conversations as PDFs plus the verification scripts — an unusually transparent record for an AI-assisted result.

Does this change what GPT-6 Astra is good at?

It sharpens the picture rather than changing it. Astra's published strengths are long agentic tasks and hard reasoning with checkable outputs — see our honest benchmarks breakdown and review. The fusion result is the strongest public evidence yet for the "checkable-output" pattern.