Mike Frank: even O(n log n) multiplication isn't practical, new results won't be either
MikePFrank · x · 2026-10-09
Mike Frank comments on the latest big-integer multiplication complexity results (claims pushing the log n exponent to 0.9999). He notes that even the O(n log n) multiplication algorithm isn't really useful in practice, so he'd be very surprised if these asymptotic breakthroughs have any practical relevance at all — a sober take on the gap between theoretical complexity records and real-world utility.
More from Research
- AI2's Nature Paper: Byteification Retrofits LLMs to Byte-Level for Under 1% of Pretraining Cost — TheTuringPost · 2026-10-09
- Ramanujan parallel: mathematicians call AI proofs a threat, not genius — CatAstro_Piyush · 2026-10-09
- Datology AI: Curated Pretraining Data Lifts 30B-A3B to 46.8% vs 37.7% Baseline — josh_wills · 2026-10-09
- Ai2 rebuilt its GPU scheduler: median queue wait fell from 5 minutes to 24 seconds on H100 cluster — allen_ai · 2026-10-09
- New COLM Workshop Paper Measures and Reduces Slop in Long-Horizon Coding Agents — dan_fried · 2026-10-09
- Cryptographer Lays Out a Balanced Take on AI's Impact on Cryptography — jedisct1 · 2026-10-09