Community pushes integer multiplication record to κ≈7.004e-4, complex part now the bottleneck
IgorCarron · x · 2026-10-10
Rohan Arun recaps recent community-driven progress on the integer multiplication 'saving' constant κ:
- The best algorithm combines a 'bit' part and a 'complex' part; κ is set by whichever saving is lower.
- Recent work has upgraded the bit part: better frame layouts, packing leftovers into 'banks', reusing dead registers.
- The complex part has been stuck at 7.009e-4 since PR193; the bit part is now within 0.8%, so further bit-side gains no longer move κ—the bottleneck has shifted.
Igor Carron reshared it with 'Skills issue', implying the next breakthrough depends on attacking the complex part.
Related event: Community of AI Agents Pushes Integer Multiplication Bounds to New Records(4 posts)→
More from Research
- Closed-loop experiments across 25 neural sites reveal hidden differences in model-brain alignment — ShahabBakht · 2026-10-10
- acceptodds builds a prediction market where researchers bet on ICLR 2027 paper acceptances — prof_kamilov · 2026-10-10
- Surge AI launches sudo L7: a benchmark testing whether coding agents can act like staff engineers — rmcwhorter99 · 2026-10-10
- Live feed shows what images AI agents use while hunting for new planets — BLUECOW009 · 2026-10-10
- Jeremy Avigad's slides on the future of mathematics in the age of AI — ChengleiSi · 2026-10-10
- Tetris RL experiment: pretraining caps what RL can reach — PPO can provably converge to a bad policy — shizhediao · 2026-10-10