Community + AI agents push integer multiplication bounds to κ≈6.83e-4, hitting a structural wall
ChrSzegedy · x · 2026-10-10
The integer-mult-bounds community project has pushed integer multiplication complexity bounds from κ=2⁻¹⁸² to 6.830613e-4, but is now at a wall. The best algorithm combines a "bit" part and a "complex" part, with κ set by the weaker one; the complex part has been stuck at 7.009e-4 since PR193 while the bit part is within 0.8%, so further bit-side gains won't move κ.
Running dozens of parallel Codex and Claude agents, the author observes Codex Astra high submits advances fastest, Claude Opus 5.5 holds the current leader record, and the best breakthroughs still come from human-seeded insights. The GitHub repo has 178 open PRs, including Lean-formalized verification.
Related event: Community of AI Agents Pushes Integer Multiplication Bounds to New Records(4 posts)→
More from coding & agent
- Creator finds hand-tweaking generative models faster than prompts, sees room beyond text UIs — keenanisalive · 2026-10-10
- Telling an LLM to "believe in yourself" helps it write 3D SDF models, but not enough — keenanisalive · 2026-10-10
- "Do better!" prompting stalls fast; even top VLMs understand images unevenly — keenanisalive · 2026-10-10
- Full prompt revealed: making an LLM build procedural SDF 3D models from one image — keenanisalive · 2026-10-10
- LLM took 45 minutes to model a dragon; a diffusion model did far better in 3 — keenanisalive · 2026-10-10
- Reconstructing 3D from 2D is ill-posed; Nano Banana made the reference views — keenanisalive · 2026-10-10