On July 10, 2026, OpenAI researcher Ethan Knight announced on X: GPT-5.6 Sol Ultra, with 64 parallel sub-agents, delivered a complete proof of the Cycle Double Cover conjecture in one hour, simultaneously publishing a three-page proof PDF and the triggering prompt. This is the first publicly declared positive proof of the CDC conjecture since it was independently proposed by Szekeres in 1973 and Seymour in 1979. The CDC asks whether every bridgeless graph can find a set of cycles such that each edge lies in exactly two cycles. OpenAI takes the classic 8-flow route: reduce to bridgeless cubic graphs, leverage the existing nowhere-zero 8-flow theorem to get edge labels, then use new linear-algebra arguments to rewrite as cycle decomposition. The entire three-page text uses only elementary graph theory and algorithmic construction, with no new framework — this is the first time this half-century-old problem has been hit in "short + elementary" form. The real readable signal lies in the prompt orchestration: 64 sub-agents are required to collaborate "dynamically and aggressively", the first few rounds don't lock direction, failed agents are explicitly blocked, adversarial-type agents focus on pathological counterexamples, and only complete proofs passing their own internal audit are allowed to return — this welds multi-agent collaboration directly into the research methodology. On Terminal-Bench 2.1, Sol Ultra gets 91.9%, almost 4 points above the second-place Claude Mythos 5 and GPT-5.5's 88.0%, the reproducibility of the multi-agent route on hard structural problems has stood firm. The next reasonable candidate for a 64-sub-agent output sheet will likely fall on combinatorial-structurally clear problems like Erdős–Ginzburg–Ziv or cryptographic hardness upper bounds — but the standard move in the math community is still to first split up to check the three-page PDF, then try to supplement with Lean formalization; in graph theory this road is still long.