The revised rules for the Millennium Prize Problems were adopted by the Board of Directors of the Clay Mathematics Institute on 26 September, 2018. Please read this document carefully before contacting CMI about a proposed solution. In particular, please note that:
On the Navier–Stokes Millennium Prize Problem
We’re sharing an AI-generated solution to the Navier–Stokes Millennium Prize Problem, including a writeup and a formal proof in Lean.
Noam Brown on Twitter / X
And yes we did try other major problems without success. Sadly no Millennium Prize problems (yet).But also, we didn’t spend a lot on each problem. It’s possible to push test-time compute much further.— Noam Brown (@polynoamial) August 1, 2026
Bartosz Naskręcki on Twitter / X
Congrats to @LechMazur for the solution and to Terence Tao for the digestion and storytelling. You see the trend. Mathematicians are still needed if we want to make any sense of the formal proofs. For now... Maybe the next gen LLMs will simply read allthe blogs of Terry and… https://t.co/yXiISCrNAF— Bartosz Naskręcki (@nasqret) August 13, 2026
Deedy on Twitter / X
The International Math Olympiad (IMO) 2026, the hardest math contest for high schoolers, just ended.I ran Fable (high), Sol (xhigh), K3 (max) and Axiom against it and all got a perfect score of 42/42 (repo below if you want to check their solutions):— Claude Fable 5 was the… pic.twitter.com/6oH7FiAjEP— Deedy (@deedydas) July 21, 2026
Has an AI discovered new maths?
Michael Truell on Twitter / X
We believe Cursor discovered a novel solution to Problem Six of the First Proof challenge, a set of math research problems that approximate the work of Stanford, MIT, Berkeley academics. Cursor's solution yields stronger results than the official, human-written solution.…— Michael Truell (@mntruell) March 3, 2026
Ten advances in mathematics and theoretical computer science
OpenAI shares new results on long-standing open problems in mathematics and theoretical computer science, including advances in geometry, cryptography, and complexity.
The Wolfram S Combinator Challenge
Wolfram is offering a total of $20,000 in prize money to determine if the S combinator is universal. Statement of problem to be solved, full guidelines, committee of judges and submission guidelines.
Mathematics with large language models as provers and verifiers
During 2024 and 2025 the discussion about the theorem-proving capabilities of large language models started reporting interesting success stories, mostly to do with difficult exercises (such as problems from the International Mathematical Olympiad), but also with conjectures [Feldman & Karbasi, arXiv:2509.18383v1] formulated for the purpose of verifying whether the artificial intelligence could prove it. In this paper we report a theorem proving feat achieved by ChatGPT by using a protocol involving different prover and verifier instances of the gpt-5 model working collaboratively. To make sure that the produced proofs do not suffer from hallucinations, the final proof is formally verified by the lean proof assistant, and the conformance of premises and conclusion of the lean code is verified by a human. Our methodology is by no means complete or exact. It was nonetheless able to solve five out of six 2025 IMO problems, and close about a third of the sixty-six number theory conjectures in [Cohen, Journal of Integer Sequences, 2025].
Mathematics with large language models as provers and verifiers
During 2024 and 2025 the discussion about the theorem-proving capabilities of large language models started reporting interesting success stories, mostly to do with difficult exercises (such as problems from the International Mathematical Olympiad), but also with conjectures [Feldman & Karbasi, arXiv:2509.18383v1] formulated for the purpose of verifying whether the artificial intelligence could prove it. In this paper we report a theorem proving feat achieved by ChatGPT by using a protocol involving different prover and verifier instances of the gpt-5 model working collaboratively. To make sure that the produced proofs do not suffer from hallucinations, the final proof is formally verified by the lean proof assistant, and the conformance of premises and conclusion of the lean code is verified by a human. Our methodology is by no means complete or exact. It was nonetheless able to solve five out of six 2025 IMO problems, and close about a third of the sixty-six number theory conjectures in [Cohen, Journal of Integer Sequences, 2025].
AI contributions to Erdős problems
A community database for the problems on the erdosproblems.com site - teorth/erdosproblems
. · openai/ten-proofs@94bc0fe
Lean certificates accompanying proofs in mathematics and theoretical computer science - . · openai/ten-proofs@94bc0fe
. · openai/ten-proofs@d0e1ae7
Lean certificates accompanying proofs in mathematics and theoretical computer science - . · openai/ten-proofs@d0e1ae7
An OpenAI model has disproved a central conjecture in discrete geometry
An OpenAI model solved the 80-year-old unit distance problem, disproving a major conjecture in discrete geometry and marking a milestone in AI-driven mathematics.
