Integer multiplication algorithm reportedly breaks the n log n barrier

A new algorithm is claimed to multiply integers faster than the long-standing O(n log n) bound, beating Schönhage–Strassen-style methods. The result has stunned the algorithms community, with observers joking that LLMs have gone from failing at multiplication to improving it.

2026-10-07 ~ 2026-10-07 · 2 related posts

• Integer multiplication faster than N log N? Algorithm fans call it "cursed" — QuintinPope5 · 2026-10-07
• From flubbing 3-digit multiplication to beating n log n: AI cracks integer multiplication in 5 years — CatAstro_Piyush · 2026-10-07