Doug Colkitt: OpenAI problem #109 tightened to κ = 2^-59 (from 2^-182)
Doug Colkitt @0xdougX
Why it matters
Third conditional tightening in one day (κ = 2^-59, a 2^123-fold larger exponent saving than OpenAI’s original), the post that went viral through quote posts.
Summary
Posted 19:35 UTC. κ = 2^-59 from a redesigned finite network that shares intermediate computations and scratch space, plus tighter recursion and Gaussian estimates. Quotes the 13:56 UTC post. The repository says the work was done with OpenAI Codex and remains conditional on OpenAI’s unverified manuscript.
Archived text
We are publishing an update to OpenAI problem #109 Integer multiplication) with another substantial further tightening:
κ = 2⁻⁵⁹ (from OpenAI’s original κ = 2⁻¹⁸²)
Approximately 500 thousand fold improvement over our previous result and a 2¹²³ fold improvement over the original OAI result.
The latest redesigned the finite network to share intermediate computations and scratch space, then tightened the recursion and Gaussian estimates.
Quoting @0xdoug: We are publishing an update to OpenAI Problem #109 (integer multiplication) with a substantial further tightening: