OpenAI says its AI system has refuted the Exponential Time Hypothesis, a longstanding claim about the difficulty of solving certain logic problems. The Oct. 26 announcement has prompted researchers to organize an independent examination, while the disclosed result does not establish a practical attack on Bitcoin.
The manuscript, dated Oct. 17 and revised Oct. 25, claims a deterministic algorithm that exactly counts satisfying assignments for fixed-width Boolean formulas in subexponential time and polynomial space. The problem involves 3-SAT, where a computer searches for true-or-false assignments that satisfy logical rules. OpenAI says the work was verified in Lean, but the formalization’s scope note covers a weaker subexponential bound than the manuscript’s sharpest claim.
Why it matters
A subexponential result is not the same as a practical algorithm for today’s machines. It also does not establish a polynomial-time algorithm or settle P=NP. The researchers organizing the review have said their involvement should not be treated as certification, and they intend to publish findings as the examination progresses.
The relevance to Bitcoin depends on separating two security questions. Mining requires finding a block-header hash below a target, while spending authorization relies on ECDSA and Schnorr signatures over the secp256k1 curve. Those systems depend on elliptic-curve discrete-log resistance and hash-function security, not simply on the worst-case difficulty of SAT.
Market impact
The claim does not by itself show that an attacker can recover Bitcoin private keys, forge signatures or gain a practical mining advantage. A concrete attack would require an appropriate encoding, an implementation and a cost comparison. The variable count in a SAT formula also cannot be substituted directly for a cryptographic key or hash bit length.
Bitcoin’s difficulty adjustment recalculates the mining target every 2,016 blocks, but that mechanism governs block production rather than signature authorization. For markets, the immediate signal is continued scrutiny of the result, not a demonstrated change in Bitcoin’s security assumptions.
Frequently asked questions
-
What problem does OpenAI’s claimed breakthrough target?
The result targets 3-SAT and related counting problems involving Boolean formulas. It concerns worst-case computational complexity rather than a demonstrated attack on Bitcoin.
-
Does the result settle P=NP?
No. The disclosed work does not establish a polynomial-time algorithm or settle the question of whether every efficiently verifiable problem is also efficiently solvable.
-
Why does the result not immediately threaten Bitcoin signatures?
Bitcoin spending authorization uses ECDSA and Schnorr signatures over secp256k1. A worst-case SAT result does not by itself provide a method to recover private keys or forge those signatures.
-
Could the breakthrough give miners an immediate advantage?
No immediate mining advantage has been demonstrated. Bitcoin mining requires finding a block-header hash below a target, and a practical attack would need an implementation and cost comparison.
-
What happens next with the OpenAI claim?
Researchers are organizing an independent examination without treating their involvement as certification. They intend to share findings as the review progresses.
CryptoSlate