Crowdsourced push on integer multiplication bounds stalls: κ improves only 0.7%, geometry experts sought
iskander · x · 2026-10-12
Rohan Arun's crowdsourced math project hit a hard wall again, improving conditional κ (now ≈ 0.001467) by only 0.7% overnight on a trick to cheapen one step of FFT-like transforms for huge-integer multiplication. They label inputs and helper registers with geometries like E8; hosting tricks are exhausted so gains must come from the complex local word or its geometry. A public GitHub experiment log tracks claimed PRs (gains of 5.79%–9.42% in 24h, best open proposal at 1.6e-3), and they invite lattice/coding-theory/finite-geometry experts to suggest new structures, with plans to let agents collaborate across teams.
More from Research
- JetBrains study: coding-agent benchmarks should match real users' task flows — JetBrains-Research · 2026-10-12
- NYU paper: LLMs can generate replay and pick targets to preserve their own skills — newyorkuniversity · 2026-10-12
- Cameron Wolfe to talk at AIE NYC: a roadmap for evaluating highly-subjective LLM tasks — cwolferesearch · 2026-10-12
- Gaël Varoquaux compiles his AI blog series: a researcher's take on AI and society — GaelVaroquaux · 2026-10-12
- OpenAI's AI solves famous math problems—researchers recognize their own ideas in them — GaelVaroquaux · 2026-10-12
- LLMs predict edit sequences to optimize molecular synthesizability, new Nature MI paper — lulzxdxdxd · 2026-10-12