OpenAI's Navier-Stokes claim and mathematician backlash

Despite headlines describing a solved Millennium Prize Problem, OpenAI's result addresses a forced version of the 3D Navier-Stokes equations - specifically statements C and D of Charles Fefferman's official Clay problem formulation - not the unforced version most mathematicians associate with the classic $1 million question ^[1]. OpenAI has said it will not claim the prize itself ^[2]. Critics online have framed the result less as a general proof and more as a counterexample: agents found conditions under which a smooth forcing term drives the equations to a finite-time singularity for a specific case, not a fix covering every scenario. The Clay Mathematics Institute has not accepted the result and still lists Navier-Stokes as unsolved, describing its review process as 'deliberately unhurried' and 'absolutely rigorous' ^[4]. That gap between the AI-formalized claim and institutional validation is the core reason the story is being treated as a claim, not a solution.

NYU mathematician Tristan Buckmaster alleges that he and collaborator Levent Alpoge reportedly spent about a year developing an unpublished approach to finite-time blowup in the related 3D Euler equations. That work built on a route opened by Luis Cordoba and Diego Martinez-Zoroa ^[3]. Reporting indicates OpenAI accelerated its own Navier-Stokes push shortly after learning of that unpublished progress, then produced its result within days using massive compute ^[6]. During negotiations, OpenAI's math lead Sebastien Bubeck reportedly offered a joint release conditioned on removing Alpoge as a co-author ^[6], and Buckmaster has described the broader exchange as an attempt at intimidation ^[7]. Buckmaster also says he asked OpenAI directly whether its model had been trained on or had access to the pair's private Codex drafting sessions, and did not get a clear answer on the training question - OpenAI has denied that its researchers or agents saw the pair's work before its public release ^[5].

To reach its result, OpenAI ran roughly 10,000 concurrent sub-agents for about 88 hours, followed by another 17 hours in which a separate model formalized the result in the Lean proof assistant ^[3]. The agents exchanged nearly 5 million messages in total, with roughly 2.7 million messages and about 130 billion output tokens spent on the Navier-Stokes problem alone, out of some 300 billion tokens across every problem attempted in the run ^[3]. Estimates put the compute cost at around $15 million, described as a 1,000-fold scale-up over OpenAI's past math-focused runs ^[6]. Coverage of the effort has framed it less as a routine experiment than as a resource-intensive demonstration of what massed AI agents can do against a single famous problem ^[8].

On September 11, 25 Fields Medal-winning mathematicians - organized around Terence Tao - published an open letter titled 'A Severe Misalignment of AI in Mathematics,' warning that rushed AI-driven proof announcements skip proper writeup, isolation of new methods, and citation of prior work ^[9]. The letter followed days of escalating friction, during which OpenAI withdrew its sponsorship of a Caltech math event after researchers criticized the company ^[10]. Tao has separately warned that 'the indiscriminate strip-mining of open problems for solutions may destroy the ecosystem from which the next generation of mathematical techniques, problems, and practitioners would have developed,' framing the risk less as a single credit dispute and more as a structural threat to how mathematics trains itself ^[7].

A Lean formalization means the logical steps of OpenAI's proof have been mechanically checked, but that is a different bar than human peer review. Charles Fefferman, who wrote the Clay Institute's official Navier-Stokes problem statement, said the result appears to match the problem as formulated but needs a conventional rewrite and review by several experts - a process he estimated would take months ^[11]. The Clay Mathematics Institute has echoed that timeline, emphasizing a deliberately slow validation process before any prize consideration ^[4]. Buckmaster himself has raised the risk of what he calls a 'clanker proof': technically verified by a machine but not yet made humanly comprehensible or independently vetted, a distinction that matters more for a Millennium Prize claim than for an ordinary machine-learning benchmark.