The Contraction Lemma Beyond ETH: Algorithms and Lower BoundsResearch Paper
The Exponential Time Hypothesis of Impagliazzo and Paturi says that 3-SAT on variables needs time . Hundreds of conditional lower bounds in fine-grained complexity rest on it. In October 2026 two manuscripts refuted it: OpenAI's The Exponential Time Hypothesis is false and Anthropic's A time algorithm for 3-SAT. Both give…