>OpenAI proves the Exponential Time Hypothesis false, pointing towards P = NP being true, the biggest computer science breakthrough in 70 years time Literally false. P vs. NP is a totally different problem from proving that NP problems can be solved in subexponential time. Also, the algorithm itself is far, far slower than even a naive implementation of a 3SAT solver for any real-world use case. It's just another pure math bs.