From flubbing 3-digit multiplication to beating n log n: AI cracks integer multiplication in 5 years
CatAstro_Piyush · x · 2026-10-07
A viral thread highlights a new result: integer multiplication can now be done faster than the long-standing O(n log n) bound, with AI as a key contributor.
The poster points out the striking arc: five years ago LLMs hallucinated 3-digit multiplication; now they help fundamentally improve the multiplication algorithm itself—leaping from getting arithmetic wrong to discovering faster algorithms. Commenters noted the result caught them off guard.
Related event: Integer Multiplication Breaks the n log n Barrier, with AI Leading the Way(11 posts)→
More from AGI Musings
- Viral demo economics: why AI teams will never ship a real GTA rival — cocktailpeanut · 2026-11-22
- Gary Marcus warns Anthropic bulls: Lean-verified math wins won't generalize — GaryMarcus · 2026-11-22
- 2010s mainstream AI safety planned an aligned singleton overriding governments — jessi_cata · 2026-11-22
- Benjamin Bratton mocks The Atlantic's AI coverage as 'AI cope' — bratton · 2026-11-22
- Fields Medalist Bao Chau Ngo on AI proof of Riemann Hypothesis: treat AI output as data — Dr_Atoosa · 2026-11-22
- AI math pace outruns expert timelines: two Millennium Prize-level problems now reportedly solved — haider1 · 2026-11-22