News
OpenAI Claims Breakthrough in 3-SAT Problem
OpenAI announced that its AI system has refuted the Exponential Time Hypothesis concerning the 3-SAT problem. The claim, detailed in a manuscript dated October 17 and revised October 25, suggests a deterministic algorithm that counts satisfying assignments of Boolean formulas in subexponential time. However, the result does not establish a practical attack on Bitcoin and is currently under review. Researchers are organizing an independent examination of the claim, which has been declined for certification.