Karatsuba explained: why integer multiplication's O(n^1.58) bound is just fractal complexity
snikolov · x · 2026-10-08
- Responding to a viral debate, @bzogrammer argues the discussed integer multiplication result isn't crazy—it's a typical fractal complexity bound.
- Naive big-integer multiplication is O(n²), long assumed optimal until Karatsuba found an O(n^log2(3))≈O(n^1.58) algorithm.
- The standard algorithm recurses into 4 smaller multiplications plus cheap additions; Karatsuba's polynomial identities reduce this to 3 multiplications at the cost of more adds/subtracts.
- Intuition: like a square whose area grows 4x per doubling, except you can remove one of the four sub-squares each time—hence the exponent drops from 2 to log2(3).
Related event: Integer Multiplication Breaks the n log n Barrier, with AI Leading the Way(11 posts)→
More from Research
- Stanford CS312 teaches deep learning by experiment prediction; suggested as synthetic-data seed for frontier labs — jasondeanlee · 2026-11-22
- John Langford weighs in on FBT note: fixed-point convergence and quantized caching — JohnCLangford · 2026-11-22
- Fields Medalist Bao Chau Ngo on AI proof of Riemann Hypothesis: treat AI output as data — Dr_Atoosa · 2026-11-22
- AI-written six-page proof of Deligne's bound lands, checked only by Claude models — Singularitarian · 2026-11-22
- AI math pace outruns expert timelines: two Millennium Prize-level problems now reportedly solved — haider1 · 2026-11-22
- Darmok AI solves all 7 Times Crossword Championship puzzles, beats human champ by 3m13s — rohanpaul_ai · 2026-11-22