Newshot

OpenAI's GPT-6 Astra tackles the Standard Model's toughest math problem on a lattice

Summary

OpenAI physicist Nathaniel Craig used GPT-6 Astra to tackle a problem that had stumped particle physicists for over 25 years. The AI model took Craig's strategy for defining the full Standard Model on a computational lattice and turned it into a working proof. Craig says a lot of work remains before realistic simulations are possible. The article OpenAI's GPT-6 Astra tackles the Standard Model's toughest math problem on a lattice appeared first on The Decoder .

Original text(via The Decoder)

OpenAI's GPT-6 Astra tackles the Standard Model's toughest math problem on a lattice

Image description
Image description

OpenAI's GPT-6 Astra helped produce a proof that could solve a 50-year-old problem in particle physics.

Physicist Nathaniel Craig of UC Santa Barbara, currently a visiting scientist at OpenAI, presented the approach on the OpenAI blog and as a preprint paper. Craig leads the particle theory group at UCSB and is a permanent member of its Kavli Institute for Theoretical Physics.

Physicists can simulate parts of the Standard Model, the theory describing all known particles and fundamental forces, on a computer grid called a lattice. That has already led to breakthroughs like calculating the proton's mass from first principles. But putting the full theory on a lattice has been impossible. The weak force, which governs certain types of radioactive decay, treats left- and right-handed particles differently. On simple lattices, this asymmetry creates unwanted ghost particles. Special lattice particles called overlap fermions can filter them out, but for over 25 years, nobody could set their phase correctly.

Craig had a strategy to fix the phase by comparing progressively finer lattices, but couldn't prove it worked in all the cases it needed to cover. GPT-6 Astra turned the idea into a working construction and took the lead on the detailed proof. Lattice field theorists Maarten Golterman, Andreas Kronfeld, and Yigal Shamir reviewed the proof and raised questions that Craig says helped build confidence in the result. He calls the work "much more a beginning than an end" and says a lot remains before realistic simulations are possible.

The result follows a run of AI advances in mathematics that started in January 2026. In May, OpenAI's disproof of Erdős's unit distance conjecture became the first AI proof worthy of math's top journal. Days later, Google Deepmind's AlphaProof Nexus solved nine of 353 open Erdős problems for a few hundred dollars, and by October its results had passed peer review.

The most far-reaching claim came in September, when OpenAI submitted a 166-page proof for the Navier-Stokes Millennium Prize Problem and the Clay Mathematics Institute said it had "apparently been settled". The solution remains under review, and mathematicians have questioned whether OpenAI fully understands its own proof. Across the field, mathematicians have mixed feelings as AI keeps cracking unsolved problems.

AI News Without the Hype – Curated by Humans

Subscribe to THE DECODER for ad-free reading, a weekly AI newsletter, our exclusive "AI Radar" frontier report six times a year, full archive access, and access to our comment section.

The text above was extracted automatically from the source page and may miss images, tables or code blocks. The original is authoritative.

Published by The Decoder
This site only summarises and aggregates; copyright stays with the original author. Headlines and summaries follow the source — where they differ, the original wins.
Read the original ↗