Summary
OpenAI released a September 23 preprint claiming an integer multiplication algorithm with complexity below n log n, potentially breaking a long-standing theoretical lower bound in computational mathematics. The paper is published in the openai/math GitHub repository. Community verification is pending.
Source Analysis
Research Notes
PreScreening Notes
- Recency: Published 2026-09-23 (336h old at screening) — FAILS 48h gate (hard reject)
- Note: Story would otherwise score ~7 (landmark theoretical CS claim from OpenAI) but recency gate is absolute