OpenAI Publishes Preprint Claiming Integer Multiplication Faster Than n log n
Singularitarian · x · 2026-10-07
OpenAI released a preprint, "Integer multiplication below n log n" (September 23, 2026), under its OpenAI Math Release series on GitHub.
- The paper claims an integer multiplication algorithm beating the n log n bound proven optimal-looking by Harvey & van der Hoeven in 2021, a result many considered near the theoretical limit
- Authored by OpenAI, published as a PDF in the openai/math repository
- The announcement drew wide surprise and discussion across the math and algorithms community
More from Research
- OpenAI proof dump shows first superlinear circuit lower bound, but progress stays slow — thomasahle · 2026-11-22
- Fortnow: Fall's dramatic results show P vs NP still far from solved, as OpenAI proof dump yields first superlinear circuit lower bound — thomasahle · 2026-11-22
- One photo, 8 VLAs, only 3 correct: ERQA embodied-reasoning benchmark questioned — giffmana · 2026-11-22
- Fleuret: treat AI as oracles, not explainers — human-comprehensible math will be negligible — francoisfleuret · 2026-11-22
- Vovk paper shows probabilistically nonrandom objects have vanishing universal measure — _onionesque · 2026-11-22
- AI generates a Riemann proof, AI generates the rebuttal—and it scores 100% AI — zetalyrae · 2026-11-22