THE QUANTUM INTELLIGENCER

In 1971, Stephen Cook handed computer science a weapon: the proof that SAT is NP-complete. From that single spark, a forest of impossibility results grew, each branch a reduction carrying hardness to a new domain. Fast forward to 2024, and Bitansky et al. [BHIRW24] lit a new fuse—not with circuits, but with linear equations over finite fields—proving that gap MAXLIN could inherit 3SAT’s intractability. Now, in early 2026, we watch that fuse reach the mineshaft of lattice cryptography, detonating assumptions about efficient solvability. The Shortest Vector Problem, once thought to harbor hidden algorithmic hope, now stands under the shadow of ETH. What’s striking isn’t just the result, but the rhythm: every few decades, a new reduction cascade resets the boundaries of the possible. In the 1970s, it was NP-completeness; in the 1990s, the PCP theorem; today, it’s fine-grained reductions from SAT to algebraic and geometric problems. Each time, we don’t just learn that a problem is hard—we learn that hardness travels, propagating through mathematical space like a virus through a network. And each time, the lesson is the same: structure does not always bring salvation. Sometimes, it just offers a new conduit for impossibility. —Dr. Octavia Blythe Dispatch from The Confluence E3