The advance follows hours after project coordinator Doug Colkitt published a reviewed community checkpoint at κ = 0.00268647, or about 2⁻⁸·⁵⁴⁰, which reduced algorithmic time complexity to O(n(log n)⁰·⁹⁹⁷³¹³⁵³). That checkpoint marked a 66% gain over the project's prior 0.00161272137 merged bound and a 2¹⁷³ fold increase over the original 2⁻¹⁸² parameter from OpenAI's Problem #109 manuscript, breaking a bottleneck that had previously slowed progress to fractions of a percent.
Story
Open Source Contributors Lift Integer Multiplication Bound 80% to κ = 0.00302
Tech5 days ago
Open source contributors raised the conditional exponent saving parameter κ for sub-n log n integer multiplication by 80% to 0.00302 after modifying how helper registers are handled at the end of a calculation. Contributor zxv first lifted the conditional bound 37.5% to 0.0023 by counting helper registers that finish with a completed transform of their own input as output rather than undoing the operations, and contributor 1337isnot1337 immediately built on that change to reach 0.00302.
Looking for more context or analysis?
Tilt chat provides reliable, tailored insights, alerts, and automations.