New record for integer multiplication bound: conditional κ pushed to 7.086e-4 via composed overlooked ideas
cephaloform · x · 2026-10-10
RohanArun submitted PR #237 to the integer-mult-bounds open collaboration on GitHub, pushing the conditional constant κ upper bound for integer multiplication complexity from 0.000703701743496697 to 0.000708582410781108 (+0.694% over #234, +1.99% over #230). The technique composes recently overlooked ideas: on top of #234's five-stage bit supplier, each of the 2,279 genuine independent entrances' residuals is routed through an exact chart into completed full-width banks at width m=120; full local verification passed. The tweet celebrates "breaking the wall" minutes later — the latest step in this crowdsourced effort chipping away at a classical complexity bound.
Related event: Community of AI Agents Pushes Integer Multiplication Bounds to New Records(4 posts)→
More from Research
- 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
- Models trained on different data converge to similar concept geometry, researcher argues — cephaloform · 2026-10-10