Independent researchers tighten OpenAI problem #109 bound to κ > 2^-16, a 2^166x improvement
basedjensen · x · 2026-10-08
- Independent researchers report a fifth update on OpenAI's integer multiplication problem #109, tightening κ from 2^-182 to κ > 2^-16.
- The exact witness is 1.548×10⁻⁵, about 1.3x over the previous 1.197×10⁻⁵ and 3.7x over round three — a cumulative 2^166x improvement over the original OpenAI result.
- The construction uses their own interchange network, and assembly and moment certificates are now checked in Lean's kernel.
More from Research
- Engineered petunias become living canvases: painting flowers with dexamethasone — NikoMcCarty · 2026-10-08
- Mathematician coins 'mathslopcalypse': none of the hundreds of new papers readable without AI — rrwilliams · 2026-10-08
- GOTT hits 90-96% success driving dexterous hands across three real robot platforms — ChongZzZhang · 2026-10-08
- Economist Open-Sources Tool That Turns Papers Into AI-Chat, Interactive Web Versions — Afinetheorem · 2026-10-08
- Economist Kevin Bryan's PhD tech stack: reproducible, efficient, open — with GitHub, LaTeX and Cursor — Afinetheorem · 2026-10-08
- New Paper Measures Time Awareness in LLM Agents, Astra Leads — maksym_andr · 2026-10-08