Sub-n log n FFT, subcubic APSP and subquadratic 3SUM in one day stun algorithmists
burny_tech · x · 2026-10-07
Researcher Aran Nayebi reacted to a remarkable day in algorithms: a sub-n·log n FFT (faster-than-ever integer multiplication), subcubic APSP, and subquadratic 3SUM all landing at once.
- "Today has shaken my belief that humans were ever good at algorithms," he wrote
- He joked he's updated toward "maybe P = NP after all," via some clever n^c-time SAT algorithm (c 10^6) that GPT-8 might discover
- The original quip came from AcerFur's surprise at the new integer multiplication bound beating n log n
A snapshot of how alarmed — and excited — theory folks are getting about AI-assisted algorithm discovery.
More from Fun
- 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
- eigenrobot: In 2020 I'd have bet we'd prove the Riemann hypothesis before fixing obesity — eigenrobot · 2026-11-22
- Dev shows off browser pinball game polished with Gemini 4 Neon's help — AI_Andrew · 2026-11-22
- Sentdex asks for ~150 free H100s right after Martin Shkreli posted wanting to buy them — Sentdex · 2026-11-22
- r/antiai deletes Riemann hypothesis post for making people think too much — generativist · 2026-11-22