← Back to live feed1 story
Project coordinator Doug Colkitt published a reviewed community checkpoint that raises the exponent saving parameter κ for sub-n log n integer multiplication to 0.00268647, marking a 66% increase over the previous bound.
Content history (2)
- 2026-10-21 · Summary · vi · Replaced stored textCác đóng góp viên trong cộng đồng nguồn mở đã cùng nhau nâng giới hạn nhân hai nguyên số …Điều phối viên dự án Doug Colkitt đã công bố một checkpoint cộng đồng đã qua kiểm duyệt, …
- 2026-10-21 · Title · vi · Replaced stored textCác đóng góp viên nguồn mở nâng giới hạn nhân hai nguyên số lên 66% đến κ = 0.00268647Các cộng tác viên mã nguồn mở nâng giới hạn nhân số nguyên lên 66% đạt κ = 0,00268647
Sign in to suggest
Key sources
- SUPPORT@sj_swapnil_jain“Eleventh update to OpenAI problem #109 (integer multiplication): κ rises to 2⁻¹⁰·⁵⁴⁷, still past 2⁻¹¹.”x.com
- SOURCE@0xdoug“New community checkpoint for integer multiplication: κ = 0.00268647 ≈ 2⁻⁸·⁵⁴⁰ T(n) = O(n(log n)⁰·⁹⁹⁷³¹³⁵³) A 66% improvement since last announcement. A 2^173 fold improvement from the OAI result”x.com
- SUPPORT@0xdoug“New community checkpoint for integer multiplication: κ = 0.00161272137 ≈ 2⁻⁹·²⁷⁶ T(n) = O(n(log n)⁰·⁹⁹⁸³⁸⁷²⁸) Reviewed and merged to main. A cumulative community result”x.com
- SOURCE@rohanarun“A free model, @opencode Space Bunny Max, has successfully proposed a new best bound for Integer Multiplication! Conditional κ = 0.001730189061233850760095”x.com
- SUPPORT@rohanarun“a free model, @opencode's Space Bunny Max, just set the record for the first time, 4 times in a row!”x.com
- SUPPORT@0xdoug“6 days later and with huge help from @jdb1729 it looks like we proved in Lean the integer multiplication sub-n log n result from @OpenAI!”x.com
- SUPPORT@anderssandberg“Always fun when math turns into a team sport with daily updates (the current bound is 0.001467289440740487).”x.com
- SUPPORT@0xdoug“This release includes substantial increase in verification and safety of BendSVM itself.”x.com