█

AI/TLDR

Fireship · 2026-11-06 · notable

Fireship — 'OpenAI's nameless model just changed the odds of P = NP...'

In short

Fireship explains OpenAI's claim that an unnamed model wrote an algorithm that solves 3-SAT faster than exponential time, which would break the Exponential Time Hypothesis.

Fireship · 2026-11-06 · 2 sources checked

Fireship video thumbnail about OpenAI's model and the odds of P = NP

A six-minute Fireship breakdown of OpenAI's Exponential Time Hypothesis result and what it means for P versus NP.

What is it?

'OpenAI's nameless model just changed the odds of P = NP...' went up on Fireship on 6 November 2026. The video covers OpenAI's claim that an unnamed model wrote a 3-SAT algorithm that runs faster than exponential time.

How does it work?

The description says the result breaks a 27-year-old hypothesis that more than 800 published papers depend on. The underlying manuscript, 'The Exponential Time Hypothesis is False', is published in OpenAI's openai/math repository.

Why does it matter?

Many hardness results in computer science assume the Exponential Time Hypothesis is true, so a confirmed refutation would force those results to be revisited. Fireship's six-minute format is a quick way in for developers who skipped the paper.

Who is it for?

developers following AI in mathematics

Sources · 2 outlets

Tags

  • video
  • fireship
  • openai
  • mathematics
  • complexity-theory
  • exponential-time-hypothesis
  • p-vs-np
  • sat

← All releases · Learn AI