
Now that I’m retired early, I have a lot of free time on my hands.
And one of the things I enjoy doing with that time is keeping up with major breakthroughs in computer science, mathematics, and artificial intelligence.
Every once in a while, something comes along that makes me stop and think.
Something that might actually change how we understand the world.
And just recently, we may have witnessed one of those moments.
I’m talking about the reported AI disproof of the Exponential Time Hypothesis, one of the fundamental assumptions underlying modern computer science.
And here’s what makes this particularly interesting.
Both OpenAI and Anthropic reportedly achieved breakthroughs on the same day, just hours apart, using two apparently independent approaches.
If their results hold up under scrutiny, this could be an extraordinarily important development.
Potentially, we’re talking about something with implications far beyond computer science.
We’re talking about the possibility of breaking through one of the most fundamental computational barriers that humanity has struggled with for generations.
And yes, that’s a pretty big deal.
Let me explain why.
1. The Mathematical Wall That Humanity Thought We Couldn’t Break
To understand what’s happening, we first need to talk about something called the Exponential Time Hypothesis, or ETH.
Interestingly enough, the origins of this idea go all the way back to the 1950s, to a mathematician named John Nash.
If that name sounds familiar, he’s the mathematical genius who developed some of the foundational ideas behind game theory.
He also struggled with schizophrenia, and his life was eventually portrayed in the movie A Beautiful Mind.
But there’s another lesser-known part of his story.
Back in the 1950s, Nash wrote a letter to the American National Security Agency about the difficulty of breaking encrypted messages intercepted from the Soviet Union.
His basic observation was pretty straightforward.
If you have the decryption key, checking an encrypted message is relatively easy.
But if you don’t have the key, figuring out what that key is can be an entirely different story.
Nash suspected that cracking sufficiently complex encryption systems would require computational effort that increased exponentially with the length of the encryption key.
Think about it this way.
Imagine you’re trying to solve a puzzle.
Every time you add another piece, the number of possible combinations doubles.
So you end up with something like this:
* 1 piece: 2 possible combinations.
* 2 pieces: 4 possible combinations.
* 10 pieces: 1,024 possible combinations.
* 40 pieces: Over a trillion possible combinations.
* 256 pieces: An astronomically large number of combinations.
That’s the problem with exponential growth.
It starts off looking manageable, but very quickly becomes completely ridiculous.
Even if you have the world’s most powerful supercomputer, there are certain problems where checking every possible combination would take longer than the age of the universe.
And this isn’t just some theoretical curiosity.
It’s part of the reason modern cryptography works.
The idea that certain computational problems become prohibitively expensive as their complexity increases eventually became formalized into what computer scientists call the Exponential Time Hypothesis.
At its heart is a mathematical problem called 3-SAT.
Don’t worry, I’m not going to torture you with a college mathematics lecture.
The basic idea is that you have a collection of logical variables and constraints, and you’re trying to determine whether there’s an assignment of values that satisfies all those constraints.
As the number of variables increases, the number of possible combinations grows exponentially.
ETH essentially assumes that there is no algorithm capable of solving every possible 3-SAT problem faster than exponential time.
In other words, no matter how clever you are, there are certain problems where the computational complexity grows so quickly that you eventually hit a wall.
And this is closely connected to one of the biggest unsolved questions in computer science: P versus NP.
The basic question is whether problems whose solutions can be verified efficiently can also be solved efficiently.
Most computer scientists believe that P does not equal NP.
In plain English, they believe that there are problems for which finding a solution is fundamentally much harder than checking whether a proposed solution is correct.
That’s the assumption I learned about back in college.
And here’s the important part.
This isn’t just some obscure mathematical problem that exists to keep university professors employed.
The underlying computational difficulty shows up in an enormous range of real-world applications.
2. Why Breaking ETH Could Change Everything
Imagine what humanity could accomplish if we suddenly discovered an efficient way to solve problems that currently require unobtainable amounts of computational effort.
For starters, think about cryptography.
We could potentially discover entirely new ways to break encryption systems that we currently consider secure.
Of course, that would also create some rather unpleasant consequences for internet security and financial systems.
But let’s put that aside for a moment.
What about medicine?
Imagine being able to efficiently search through enormous numbers of possible molecular configurations to design proteins that specifically target and treat certain types of cancer.
What about logistics?
Imagine optimizing global supply chains, airline schedules, and public transportation networks to operate at levels of efficiency that are simply impossible today.
What about materials science?
Imagine discovering entirely new materials that are lighter than air, more flexible than rubber, and stronger than steel.
Materials that could potentially enable structures and technologies that sound like science fiction today.
And then there’s artificial intelligence itself.
Imagine building an AI system that can efficiently solve problems that currently require enormous amounts of computational resources.
An AI that can generate genuinely original, civilization-changing ideas on demand.
We’re talking about the possibility of accelerating scientific discovery, engineering, medicine, and technological innovation by orders of magnitude.
Perhaps even achieving true artificial superintelligence.
Now, obviously, these are not guaranteed consequences of disproving ETH.
But they illustrate why the underlying mathematical question matters so much.
For generations, researchers have been trying to find better algorithms to solve these problems.
We’ve explored everything from clever mathematical techniques to alternative computing architectures, including quantum computers.
But even quantum computing comes with substantial limitations, and it isn’t some magical solution to every computational problem.
The uncomfortable reality is that we’ve spent decades trying to find ways around this exponential computational barrier.
And most researchers believed that, at least in the general case, it was fundamentally unavoidable.
Which brings us to the really interesting part.
3. OpenAI and Anthropic May Have Just Found a Way Around the Wall
According to their reported research, both OpenAI and Anthropic have independently produced mathematical arguments that challenge the Exponential Time Hypothesis.
I took a look at both of their GitHub repositories.
And at first glance, they appear to be two genuinely independent approaches.
What’s particularly interesting is how both teams seem to have approached the problem.
They’re essentially following what I would call the derivative innovation playbook.
Rather than inventing an entirely new mathematical framework from scratch, AI agents can leverage existing mathematical knowledge, explore enormous numbers of possibilities, and use computational resources to search for solutions that human researchers might never have discovered on their own.
In other words, take decades of accumulated mathematical knowledge, throw an army o…
Get full access to AsianDadEnergy's Newsletter at asiandadenergy.substack.com/subscribe
Więcej odcinków z kanału "AsianDadEnergy's Podcast"



Nie przegap odcinka z kanału “AsianDadEnergy's Podcast”! Subskrybuj bezpłatnie w aplikacji GetPodcast.








