OpenAI Claims Cryptography Breakthrough, No Immediate Bitcoin Threat

OpenAI said its AI system has disproved the Exponential Time Hypothesis, a long-standing assumption about the computational difficulty of certain logic problems. The Oct. 26 announcement has led researchers to organize an independent review. The disclosed result does not show a practical attack on Bitcoin. ETH in this context is the Exponential Time Hypothesis, not Ether. The hypothesis concerns 3SAT, which asks computers to assign true-or-false values that satisfy a set of logical conditions. It holds that worst-case solutions require time growing exponentially with the number of variables. A manuscript dated Oct. 17 and revised Oct. 25 claims a deterministic algorithm for exactly counting satisfying assignments of fixed-width Boolean formulas, with subexponential running time and polynomial space. Subexponential running time grows more slowly than an exponential bound as problem size rises, but that does not mean current computers can solve the problem easily. The disclosed bound does not establish a polynomial-time algorithm or resolve P=NP. P=NP asks whether every decision problem with solutions verifiable in polynomial time also has solutions computable in polynomial time. OpenAI said the Lean proof assistant verified the result. A Lean scope note describes a weaker subexponential time bound than the manuscript's strongest claim. The researchers organizing the independent examination have explicitly withheld certification. Their letter said: "Our involvement should not be taken as certification of the claim." CryptoSlate examined only the first eight introductory pages, not the complete proof. Bitcoin mining and authorization to spend involve different security tasks. Miners seek a block-header hash below a target. Signatures prove permission to spend. Bitcoin uses ECDSA and Schnorr signatures over the secp256k1 elliptic curve, as BIP340 describes. The security assumptions in BIP340 involve elliptic-curve discrete logarithms and hash functions. Key recovery asks whether an attacker can derive a private key from the corresponding public key. Disproving a worst-case SAT assumption does not by itself show how to defeat those specific mechanisms. A practical attack would require an appropriate encoding, a working implementation and a comparison of costs for the targeted task. A SAT formula's variable count cannot substitute for a cryptographic key or hash bit length. The Lean scope expresses the bound in terms of the encoded formula's variables and input length. Inserting a cryptographic bit count into the bound would bypass the necessary representation of the actual problem. Bitcoin adjusts the mining target every 2,016 blocks. The adjustment governs block production, not signature authorization. It would not eliminate the value of a private mining advantage. On Oct. 7, Justin Drake urged preparations for "bunker mode" after an earlier OpenAI mathematics announcement. Drake's warning concerned a potential future attack; the earlier announcement demonstrated no practical break of ECDSA or RSA. OpenAI's Oct. 26 claim concerns a separate result. Ryan Williams said he, Russell Impagliazzo and Mohan Paturi had been asked to arrange an open, independent examination without nondisclosure agreements or payment. Williams separately said he had asked OpenAI to check whether existing cryptosystems were compromised and relayed that they apparently remained safe. Williams's account is secondhand information about a check requested from OpenAI, not an independent cryptographic audit. OpenAI says substantial additional research is necessary for practical improvements. Williams said he did not know whether developers would see benefits, leaving open both progress within 12 months and no such development. The organizers plan to publish findings during the examination.