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 proves matrix multiplication solvable in O(n^2.25) operations — but no algorithm yet — Pascallisch · 2026-10-07
- Melanie Mitchell fires back: cites recent LLM research, two NeurIPS papers — MelMitchell1 · 2026-10-07
- Integer multiplication faster than N log N? Algorithm fans call it "cursed" — QuintinPope5 · 2026-10-07
- OpenAI Researcher Surprised AI Lab Math Results So Far All Hold Up — willdepue · 2026-10-07
- Frontier LLMs as simulators of human biologists will land faster than 'virtual cells' — CatAstro_Piyush · 2026-10-07
- AI claims progress on 90 of 500 major open math problems, including partial Riemann Hypothesis results — DavidSKrueger · 2026-10-07