2026-07-20 / Signal #2

GPT-5.6 Sol (using adapted OpenAI Cycle Double Cover prompt) closes a 30-year open lower-bound problem in convex optimization / zeroth-order optimization in 148 minutes; ties to recent Cycle Double Cover proof and Jacobian Conjecture counterexample buzz.

8.3Weirdness

Why It Matters

Needs editorial pass.

Evidence

Phillip Kerger (UC Berkeley) detailed post/GitHub with Lean-verified proof; OpenAI's exact public CDC prompt PDF; multiple HN threads (including Anthropic/Claude Fable angles); X posts quoting researcher "grief.

Signal Read

Novelty: 8Receipts: 9Story voltage: 8Heat: 8

Source Trail

Daily scan: 2026-07-20