OpenAI has proven ETH to be false, and users of Twitter in the crypto world are asking questions.

OpenAI , a 67-page document describingAI whether or not to eliminate the exponential time hypothesisETH of crypto traders

It matters.
OpenAI states that the company'sAI model found a way to circumvent an exponential time hypothesis (ETH) in computer science, which is not$ETH emblematic of Ethereum and does not directly relate to price or co-founder e.g. The Vitalik Buterin Company reports that a 67-page document dated October 17 and edited on October 25 specifies an algorithm that counts how many ways corresponding 3-SAT problems grow slower than any exponential function in time as the number of variables increases.

Reaction in the crypto world.
When this message was posted on social media, an X user named Takumi posited that the automated traders had just been trading.$ETH While Andrew Jiang noted that Vitalik has remained silent since the news appeared but OpenAI clarifiedETH that it is a computational complexity hypothesis and not a digital asset.

What is the exponential time hypothesis?
Russell Impagliazzo and Ramamohan Paturi proposed the hypothesisETH with Francis Zane in 1980.1999 It is related to the 3-SAT problem, a logical game that requires choosing true or false according to three-choice polynomial conditions.ETH They say it's difficult to solve faster than trying all meaningful sets of values. Hundreds of research papers have used this assumption to show that problems in graph theory, computational biology, data science, and algebra tend not to be solved quickly, as reported by OpenAI .

What is OpenAI claimed and how was it verified?
OpenAI states thatAI a hypothetical deletion was foundETH on October 16, then formalized in Lean, which is software that automatically checks every logical step. On October 17, both sets of data were at GitHub , the same trajectory as the company had originally published 722 mathematical pieces earlier in the month; only 162 of them contained main results prepared through computer-aided validation. A formal abstract description has been provided without any randomization for each set of values corresponding to the 3-SAT problem.

An independent expert examined it.
Russell Impagliazzo, Ramamohan Paturi and Ryan Williams of MIT lead the independent review; all three wrote an open letter stating that their role should not be interpreted as validating results because important outcomes need to be carefully reviewed, separated from each other, and have others reconstruct or question them.

Effect on the problem P versus NP and actual work
OpenAI states that this result raises the question of how multitasking can be speeded up and may lead to better algorithm search, but warns that practical benefits are still far off. Finding algorithms and turning theoretical advances into real improvements requires much more research. The paper makes it clear that these results do not show that all problems in class NP can be solved in non-exponential time.

Anthropic and Claude into the field of mathematics.
After OpenAI released Anthropic , which did not want to lose an advantage in a mathematical war, the paper was published on 26 October under the name of Claude and titled as Algorithm Time 2^{n}) for 3-SAT. The same paper also discusses the problem.ETH Noting that the model Claude , within the research team found algorithms and this result is all asymptotic, does not say what the actual solution would be in practice. Previously, Claude had formalized Fermat's last theorem in Lean by September.

Sponsorship and kickbacks.
OpenAI states that a grant worth US$5 million to the Simons Foundation will be used to organize workshops, conferences and special programs to help researchers review and evaluate the resultsAI produced. For general readers, this issue is therefore more about computational theory dynamics1999 than price signals72,000 in crypto markets.72,000

The information is sealed from the beginning.
The original content also notifies interested subscribers of the Daily Debrief Newsletter, which it states has more readers.72,000