Integer multiplication below n log n
Summary
OpenAI released the openai/math repository containing 722 manuscripts in 372 research families — spanning results like integer multiplication below n log n, the irrationality exponent of π, and Mahler conjectures — produced by an unreleased internal model over ~4,000 problems, with many results formalized in Lean.
View Cached Full Text
Cached at: 10/06/26, 11:54 PM
openai/math
Source: https://github.com/openai/math
Readme
This repository contains mathematical manuscripts and supporting proof artifacts produced by an internal OpenAI model.
As part of model development, we evaluate our models on open research problems. We expanded these evaluations after performance on our existing mathematical evaluations saturated. Some outputs build upon earlier results produced by the models.
This collection includes results at different stages of verification. Not all have accompanying Lean formalizations. We will continue to update this repository with Lean formalizations as we obtain them.
Some of the unformalized results could have issues. We will endeavor to fix any such issues quickly. We are also exploring community-hosted repositories for these materials.
Navigating the collection
The current catalogue contains 722 manuscripts organized into 372 families. A family groups related papers, which may include a principal result, companion arguments, consequences, or alternative proofs. Each family is classified by mathematical discipline.
- Start with the overview for descriptions of the families.
- Use the manuscript map to find individual papers and their supporting materials.
- The
preprints/directory contains PDFs, source files, and manuscript-specific citation and build instructions. - The Lean library and formalization catalogue describe the available formal proofs, their associated papers, and verification configurations. See the Comparator instructions for additional checking instructions. Many, but not all, of the manuscripts have been formalized.
Reasoning summaries
We are also releasing abridged summaries of the model’s reasoning, covering the following results:
How the results were produced
The vast majority of results were obtained with the same procedure using an unreleased internal OpenAI model. On average, each result used three hours of ChatGPT Pro thinking compute with that model. Over the course of the evaluation, the model was posed approximately 4,000 problems. Aggregating the output into result families and manuscripts and requiring an appropriate level of significance led to the catalog outlined above.
Exceptions to this fixed procedure include work on a zero-free region for the Riemann zeta function and proof of the Hodge Conjecture for CM abelian varieties. Additionally, the writeup for the Re(s) > 11/12 zero-free region for the Riemann zeta function was human edited for readability.
Versions and citations
We will preserve the public release history of this collection. Corrections and revisions will be recorded as new versions, with previously released versions remaining accessible.
To cite the individual manuscript, use the BibTeX block in its directory.
Similar Articles
Auto Research: Integer multiplication below n log n
An automated research run exploring integer multiplication algorithms with complexity below n log n, providing reproducible contributions, a repository contribution guide, and interactive visualization of ideas and pull requests.
OpenAI just dropped 700 preprints of mathematical proofs and counterexamples
OpenAI released a repository containing 722 mathematical manuscripts (700 preprints) grouped into 372 families of proofs and counterexamples generated by an unreleased internal model, along with some Lean formalizations and abridged reasoning traces. The results span areas like the Riemann zeta function, Mahler conjectures, and free group factors, and were produced using roughly three hours of ChatGPT Pro thinking compute per result on about 4,000 posed problems.
Mathematicians still don’t know the fastest way to multiply numbers
The article explores the unsolved problem in computer science of finding the fastest possible multiplication algorithm, tracing its history from the grade-school O(n²) method to modern breakthroughs like Karatsuba's 1960 discovery and the recent 2024 result, and explains why this matters for AI, encryption, and other digital tasks.
Recent OpenAI research has demonstrated the ability of LLMs to solve frontier problems in mathematics (1 minute read)
OpenAI research shows LLMs can solve nine open math problems from COLT, FOCS, commutative algebra, and Erdős problems using a simple pipeline with GPT-5.5 Pro and Claude Opus 4.8, with Lean formalizations.
@OpenAI: We’re releasing the manuscripts, formal Lean certificates, and reasoning walkthroughs so mathematicians can examine the…
OpenAI releases manuscripts, formal Lean certificates, and reasoning walkthroughs for ten AI-achieved advances in mathematics and theoretical computer science, including results on sphere packing, non-sofic groups, and quantum parallel repetition.