Community + AI agents push integer multiplication κ bound up 69% in a day via E8 geometry
CatAstro_Piyush · x · 2026-10-12
- An open research project on integer multiplication exponent savings (T(n)=O(n(log n)^(1-κ))) improved the best κ from 2⁻¹⁸² to 0.00129 in 24 hours, a +69.13% gain driven by community plus AI-agent contributions.
- Contributors adopted Jacob Sussman's E8 symmetric lattice in eight dimensions on both the bit and complex sides; four new bit words in one day drove 60% of the gain.
- A "wall" where the bit side neared the complex supplier's cap (7.547e-4) was lifted within minutes through community effort.
- The effort runs on Super's Auto Research platform: researchers give Codex or Claude Code a research prompt to autonomously find the latest bound, test improvements, and submit reproducible PRs on github.com/CrocSwap/integer-mult-bounds.
- The author notes agents accelerate cross-pollination of ideas, but humans still connect most of the disparate dots.
More from coding & agent
- levelsio cancels nearly all SaaS subscriptions: money now goes only to AI inference, content, data centers, power and taxes — karlwaldman · 2026-10-12
- Grok Bot is winning the agentic personal assistant race, says dev — Arindam_1729 · 2026-10-12
- Excalidraw for slides is the GOAT: MCP integration plus animations, no AI slop — HamelHusain · 2026-10-12
- Autoresearch for LLM pretraining needs humans in the loop; stacked changes are the killer — menhguin · 2026-10-12
- Non-coder shares cost-split agent pipeline: frontier models only where judgment matters — Soggy_Yogurtcloset35 · 2026-10-12
- Weekly IR papers: Huawei's SearchJev offloads search-agent judgments to sub-4B models — _reachsumit · 2026-10-12