Exponential Time Hypothesis (ETH), a 27-year-old conjecture in complexity theory, just fell. On Oct 16, OpenAI and Anthropic models independently solved 3-SAT with the same 2^(n/√log n) bound. Not P = NP, but faster than anyone thought possible. We live in extraordinary times.