Six contributors followed with 19 pull requests that lifted κ by 1.4% in about 13 hours, bringing the unverified complex bound within 1.7% of the bit side limit of 0.001733. Overall activity reached 518 pull requests in 24 hours from 64 contributors, including 20 first time participants, with OpenAI's Codex cited in 73% of submissions and Anthropic's Claude in 19%. Colkitt merged roughly 760 pull requests on Oct. 14.
The parameter κ measures the exponent saving in the theoretical running time bound T(n) = O(n(log n)^(1−κ)), which OpenAI initially published at κ = 2⁻¹⁸². Contributor Rohan Arun cautioned that generating the full Lean formal proof could still take months, while a developer prediction market opened at 40% odds on the project's κ reaching 0.01 by Nov. 19.