Integer Multiplication Breaks the n log n Barrier, with AI Leading the Way

Starting October 7, researchers on social media reported that integer multiplication has for the first time been pushed below the long-assumed O(n log n) lower bound—faster than Schönhage–Strassen–type algorithms—with AI credited as the main contributor. Together with recent results such as 3-sum at n^1.999, the news triggered widespread discussion and debate in the algorithms and complexity-theory community, flooding timelines to the point that some bloggers joked about buying a Texas Instruments calculator instead.

Confirmed

Unconfirmed

Why it matters

2026-10-07 ~ 2026-10-09 · 11 related posts

Full story(4 episodes)→

Primary sources