OpenAI claims to refute Exponential Time Hypothesis, researchers launch independent review

OpenAI announced that its AI system has refuted the Exponential Time Hypothesis, a longstanding assumption about the difficulty of solving certain logic problems. The announcement, made on Oct. 26, has prompted researchers to organize an independent examination of the result. The finding concerns the 3-SAT problem and claims a deterministic algorithm that counts satisfying assignments in subexponential time, but the disclosed bound does not establish a practical attack on Bitcoin or settle P=NP.