Researchers debate whether sub-n-log-n multiplication is breakthrough or hack
thomasahle · x · 2026-10-07
A discussion around the result pushing integer multiplication below O(n log n): one view asks whether shaving small constants off known exponents is a fundamental breakthrough with better results ahead, or just a hack — history offers many asymptotic improvements with 'galactic' constants and no practical impact.
Respondent thomasahle concedes these algorithms aren't useful on their own (like most TCS algorithms, he says), but argues they show how much we still don't know.
More from Research
- COLM'26: MathDuels self-play benchmark co-evolves difficulty across 19 frontier models — AI4Code · 2026-10-08
- Apple's Stepped MoE: one model scales 1-4B parameters, beating dense counterparts — apple · 2026-10-08
- Apple-style compression: LSP learns which subspaces to drop, cutting LLM weights 70% — Massimo Bini · 2026-10-08
- Cisco ships VLoc Bench: 500 real vulnerabilities to test if AI agents can find buggy code — aminkarbasi · 2026-10-08
- ByteDance Seed Paper Explains Phase Blind Spots in KV Compression Behind DeepSeek's Erratic Long- Context Performance — teortaxesTex · 2026-10-08
- VeriSoftBench: repo-scale Lean 4 verification benchmark, best LLM scores just 41% — xiye_nlp · 2026-10-08