OpenAI recently announced that its AI model had disproved the Exponential Time Hypothesis, or ETH—a conjecture in computer science that has stood for more than two decades. This is unrelated to Ethereum.

The hypothesis concerns how difficult certain especially hard computational problems really are. One example is the Boolean satisfiability problem, or SAT: given a set of logical conditions, is there an assignment that makes them all true at once?

As the problem grows in size, the best known approach is essentially to try possible answers one by one, with the time required growing exponentially with the problem size.

If the Exponential Time Hypothesis were disproved, it would mean that better solutions might theoretically exist for many problems thought to be nearly impossible to solve faster.

If the result ultimately withstands expert scrutiny, it would directly undermine the Exponential Time Hypothesis.

Regarding the disclosure that “OpenAI recently announced,” I’m more interested in whether the conditions set out in the original claim can be verified than in simply accepting a bullish or bearish conclusion. This records one party’s interpretation and judgment; it should not be treated as an actual policy change or a prediction of future outcomes.

I’ll compare the observation conditions in the original claim against the actual data one by one. If the conditions aren’t met, or if events move contrary to the hypothesis, this interpretation will need to be reassessed. Do you agree with the conditions in the original claim, or do you have counterevidence that better explains the trend?
$ETH

#ETH