Integer multiplication faster than N log N? Algorithm fans call it "cursed"
QuintinPope5 · x · 2026-10-07
QuintinPope quotes @mgostIH's claim that integer multiplication is now even faster than N log N, calling it "cursed." He jokes that it's like failing an intro-to-algorithms final and having the TA explain your solution was asymptotically slower by a factor of log(n)^(2^-182) — a jab at how such vanishingly tiny complexity gains are theoretically real but practically invisible. Integer multiplication complexity is a classic problem in theoretical CS: Harvey and van der Hoeven proved O(n log n) achievable in 2019, so any further improvement would be a major theoretical result (this post is second-hand and unverified).
Related event: Integer Multiplication Breaks the n log n Barrier, with AI Leading the Way(11 posts)→
More from Fun
- Kid casting a 'Riemann Hypothesis movie': Robert Pattinson to play Claude — matthew_d_green · 2026-11-22
- Viral demo economics: why AI teams will never ship a real GTA rival — cocktailpeanut · 2026-11-22
- LATENT SPACE: free Pokemon-style ROM hack where you catch AI models — Teknium · 2026-11-22
- Photo: dinner with Geoffrey Hinton at a restaurant in Glasgow — satnam6502 · 2026-11-22
- The favorite unsolved math problem: the private key to Satoshi's wallet — rez0__ · 2026-11-22
- Agent ran for hours playing Smash Ultimate but botched the replay-saving task — anpaure · 2026-11-22