☰
✕
UA RU EN

OpenAI and Anthropic Challenge Exponential Time Hypothesis as Experts Prepare for Debate

Експерти готуються до дискусії щодо революційних ідей OpenAI та Anthropic про гіпотезу експоненційного часу. Photo: НВ — Техно

Breakthrough Findings from OpenAI and Anthropic

On October 28, OpenAI and Anthropic unveiled new findings that question the validity of the Exponential Time Hypothesis (ETH), a cornerstone concept in theoretical computer science. The algorithms developed by both organizations reportedly solve complex problems in subexponential time, sparking intense discussions within the research community. Ryan Williams, a professor at MIT specializing in computational complexity, has called for collaborative scrutiny and dialogue to fully understand the implications. If these algorithms are proven to outperform the limits set by ETH, it could revolutionize our understanding of computational difficulty and have far-reaching consequences for cryptographic security.

Understanding the Exponential Time Hypothesis

The Exponential Time Hypothesis was introduced in 1999 by researchers Russell Impagliazzo and Ramamohan Paturi. It posits that solving certain difficult logical problems requires time that grows exponentially with the number of variables involved. ETH has served as a foundational assumption behind numerous scientific studies over the past decades, and the question of whether P equals NP remains one of the biggest open problems in computer science.

OpenAI has already examined the potential impact of these new algorithms on cryptographic systems and preliminarily concluded that they do not currently threaten cryptographic security.

“The company has investigated the vulnerability of cryptographic systems and preliminarily determined that these algorithms do not indicate a breach of such systems,” stated Ryan Williams.

Russell Impagliazzo and Ramamohan Paturi of the University of California, San Diego, were the pioneers who formulated ETH. Williams highlighted that

“there are several unconventional aspects in OpenAI’s proof that warrant joint expert evaluation.”
He also noted that “this new hypothesis may encourage the scientific community to more seriously consider the possibility that P equals NP, although it does not provide a definitive answer yet.” According to Williams, advances in artificial intelligence are motivating researchers to tackle more challenging questions and explore new research avenues.

The scientific community is gearing up for an in-depth discussion regarding the evidence, algorithms, and broader implications of these findings, which open new pathways for research in theoretical computer science and cryptography.

These developments could profoundly influence the field of theoretical computer science, as confirming or refuting ETH would reshape approaches to solving complex problems. In particular, cryptographic techniques that rely on assumptions about computational hardness might need to be reevaluated. The importance of continued research in this area cannot be overstated, as breakthroughs here have the potential to unlock novel applications of artificial intelligence across diverse domains.

As the implications of OpenAI and Anthropic's findings continue to unfold, understanding the potential risks associated with AI technologies becomes increasingly important. Recent research by US physicists highlights the need for caution, as they have developed a new mathematical model to predict potential AI failures and harmful guidance. This model emphasizes the importance of addressing the complexities and challenges posed by advanced computational systems.