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).
More from Fun
- "OpenAI solves math while I answer Stripe billing pages — basically the same" — generativist · 2026-10-07
- "Convert all 722 preprints into 3blue1brown videos. Don't make mistakes" goes viral as a prompt meme — willcb · 2026-10-07
- AI turns OpenAI's 199-page zeta proof into a 2-minute 3D animation claiming first zero-free strip past 7/8 — imjustnewatai · 2026-10-07
- DevDayer flashes OpenAI's DevDay Gameboy to get RuneScape running on it — JasonBotterill · 2026-10-07
- From idea to working 'dots photo booth' in 48 hours at OpenAI DevDay after-party — gabrielchua · 2026-10-07
- Paul Allen overheard Gates plotting to dilute his stake during cancer treatment—kept shares, worth $40B — SumitGup · 2026-10-07