Cryptographers who develop encryption technologies may not be sleeping very well these days.OpenAI and Anthropic both said Monday that their internal AI models had disproven the Exponential Time Hypothesis, a longstanding computer science theorem that predicts the minimum difficulty…
Estefano Gomez is an editor at Crypto Briefing specializing in blockchain analysis, DeFi, and the intersection of crypto and digital art. He previously served as Editor in Chief at Interesante for over three years, where he covered blockchain technology, NFTs,…
Originally published on The Daily Flare. OpenAI says its AI models have produced three new results in mathematics, computer science and physics, including a claimed refutation of a long-standing assumption about computational complexity. The company announced the findings on Monday,…
A decades-old assumption about the limits of computing may have met an unexpected challenger: artificial intelligence. On Oct. 26, the company announced that its models had produced a proof disputing the Exponential Time Hypothesis (ETH), a longstanding assumption about how difficult…
There is no practical speed up yet. It just shows that the assumption and claim that some really hard problems only have exponential solutions is false. This could be like proving that there are superconductors beyond 6 degrees of absolute zero…
The claim concerns the Exponential Time Hypothesis. Independent scrutiny is open, and a practical Bitcoin attack would require several further steps. OpenAI says its AI system has refuted the Exponential Time Hypothesis, a longstanding assumption about how difficult certain logic…
Turns out, OpenAI might be really good at computers. On Monday, the company said it punctured the Exponential Time Hypothesis, or ETH, the nearly 30-year-old belief in the computer science community that some logic problems get overwhelmingly time-consuming as they…
On October 26, 2026 (local time), OpenAI announced that it had obtained "major" discoveries in three fields: mathematics, computer science, and physics. The subject areas are harmonic analysis, computational complexity theory, and quantum field theory. Of particular note is the achievement in…
The results resolve major problems in math, physics and computer science. But like other recent AI-generated “slop drops,” the release is already controversial By Joseph Howlett & Peter Hall edited by Lee Billings Just a few weeks after dropping hundreds of…
Ivy Delaney has been working with neural networks and machine learning since the mid-nineties, back when a couple of hidden layers and a long afternoon of training counted as ambitious. She has watched the field go from academic curiosity to…
Computational complexity: P vs NP, hardness results, the exponential time hypothesis and lower bounds on classical and quantum computation.
An article joins this feed when it matches these terms. Each one is also a search of its own.