FULL STORY

OpenAI Open-Sources 722 AI Math Manuscripts

OpenAI open-sourced 722 AI-generated math manuscripts, sparking wide debate. A follow-up work by Sela Navot extended the matrix multiplication proof from complex fields to arbitrary fields.

2026-10-07 ~ 2026-10-09 · 2 episodes · 270 posts

Episode 1 · OpenAI Open-Sources 722 AI-Generated Math Results, Shattering Matrix Multiplication Record (2026-10-07, 268 posts)

On October 7, OpenAI announced a batch of new mathematical results produced by an internal frontier model and open-sourced the openai/math repository, publishing an upper bound on the matrix multiplication exponent of 9/4 (about O(n^2.25)) — the largest drop in 47 years. The unprecedented scale of the release, aimed at decades-old open problems and generated by an AI model, shook both the mathematics and AI communities, marking a first case of systematic AI-driven research output, though verification has become the new bottleneck.

Confirmed

  • OpenAI published the blog post "Sharing AI progress in mathematics" and open-sourced the openai/math repository containing 722 manuscripts (with Lean proofs, preprints and reasoning traces) covering 372 result families; per @WorldofAI, the model was tested on roughly 4,000 public research questions, and the model itself remains unreleased.
  • The release process involved the IAS "Independent Advisory Group on Mathematics and AI"; per @emollick citing Scott Aaronson's blog "The Mathocalypse," the group includes Timothy Gowers and Edward Witten, and the 372 results were released at once on its advice.
  • Per @kimmonismus, prior reports included a Navier-Stokes-related announcement and claims that an internal model solved hundreds of decades-old problems within months; OpenAI executive Mark Chen said the model accomplished in one week what represents ten years of mathematical progress, and plans to apply these tools to life sciences and next-generation model training.
  • Matrix multiplication: OpenAI showed it can be done in O(n^2.25) operations, beating the prior O(n^2.37) record; after Strassen's 2.81 (1969) and Coppersmith–Winograd's 2.376 (1990), the record had long been nearly stagnant.
  • Follow-up improvements are underway: per @Elivnurotic's Reddit thread, researchers have already made substantive improvements in the integer-mult-bounds repository, all Lean-verified, countering claims that AI proofs are "slop."
  • Per @CSProfKGD, algorithm researcher AlgoSvensson noted OpenAI fully solved an open k-median-type problem his student team had worked on for over a year. Reddit discussions citing Prinz highlighted the model's "research taste" in problem selection, echoing Mark Chen's framing.
  • OpenAI researcher Noam Brown, citing Mark Chen, argued LLMs have crossed a threshold: on some research problems they now exceed top human experts, a qualitative difference.

Unconfirmed

  • The manuscripts and the O(n^2.25) preprint are not peer-reviewed; the Navier-Stokes counterexample awaits expert verification. Mathematicians reportedly admit no one can yet read through the results; @Wes Roth stresses verification is the new bottleneck, and r/mathematics reactions are polarized. The advisory group's stated position that frontier AI companies should not test advanced math problems on internal models has been read as criticism of OpenAI's process, and debates over whether the release is PR persist (@mathandcobb vs @tszzl).

Why it matters

  • The exponent ω caps the theoretical speed of all matrix computation, directly affecting LLM training and inference costs; its repeated刷新 by AI models shows AI's potential to feed back into fundamental algorithm research, and community Lean-verified improvements show the results are actually digestible.
  • The batch release marks AI's first systematic entry into research-grade mathematics, with IAS involvement providing a precedent for how AI research output enters the academic community — though gaps in verification could limit its academic value.

248 more related posts →

Episode 2 · OpenAI's Fast Matrix Multiplication Proof Generalized to Arbitrary Fields (2026-10-07, 2 posts)

A new work by Sela Navot generalizes OpenAI's fast matrix multiplication algorithm achieving the exponent bound ω≤9/4 (O(n^2.25)) from the complex field to arbitrary fields, with the proof formalized and verified in Lean.