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 algorithm reportedly breaks the n log n barrier(2 posts)→
More from AGI Musings
- Turing laureate Patterson: AI will replace all jobs by end of 2030, knowledge work to drop below 1% of today's price — davidpattersonx · 2026-10-07
- Blogger Slams Anthropic's Effective Altruism Culture: Ideology Isn't Humanity's Consent — VraserX · 2026-10-07
- Grady Booch: a non-small number of mathematicians are deep in soul-searching — Grady_Booch · 2026-10-07
- eigenrobot: ethical norms work like evolved organisms, not rational machines — eigenrobot · 2026-10-07
- The Model Is Not the Mind: Rethinking Agent Economics via Erlang/BEAM — arthurcolle · 2026-10-07
- Average Math Result Took 3 Hours of ChatGPT Pro Compute, Sparking Scaling Debate — birchlse · 2026-10-07