The Cycle Double Cover Conjecture (CDC) is a central open problem in graph theory, independently proposed by George Szekeres (1973) and Paul Seymour (1979). In plain language:

Why is this hard? Five points capture the weight of the claimed breakthrough:

On July 9, 2026, OpenAI released the GPT-5.6 family in three tiers. Sol scored 80 on the Artificial Analysis Coding Agent Index — a new record, ahead of Anthropic Fable 5 at 77.2 — while using roughly half the tokens, half the latency, and about one-third the cost.

GPT-5.6 adds two reasoning modes: max gives a single model the longest thinking budget; ultra automatically orchestrates multiple sub-agents in parallel, each exploring a different path before results are merged — all inside one API call, not an external multi-agent framework.

OpenAI published the full 700-word prompt (downloadable from its CDN). The surprise: only about one-fifth describes the math problem; the remaining four-fifths optimize model behavior.

The system reserved an 8-hour compute budget. The proof landed in under one hour. The final write-up spans just three pages:

1. Reduction: Reduce the general bridgeless-graph CDC case to cubic graphs (standard literature approach)

2. Apply the 8-flow theorem:
   For cubic graphs, use Tutte's result to label edges with nonzero elements of Γ = F₃²
   so that the three edge labels at each vertex sum to the zero vector

3. Key reduction (linear algebra):
   Convert additive labels to set labels — each edge gets a two-element subset of Γ
   so that at each vertex every element of Γ appears zero or exactly two times (elementary linear algebra)

4. Conclusion: The construction yields a cycle double cover (each edge covered exactly twice)

Bloom also flagged a recurring AI-math issue: the proof cites no literature. The core ideas trace to the 1983 classic paper by Bermond, Jackson, and Jaeger — a gap common in model-generated mathematics papers.

Released the same day as the CDC result, OpenAI disclosed that Sol autonomously completed Luna post-training. Researchers issued a fairly vague prompt — find training configs, pick GPUs, launch scripts, confirm runs — and Sol executed the full pipeline via Codex. Jason Liu added context: Sol reused its own post-training configuration framework; the novelty was adapting and migrating it to the smaller Luna model — work that would take about two researchers two weeks by hand.

Six follow-up steps for the CDC proof and related resources:

Five skeptic checkpoints (the “show me the Lean code first” crowd):

Optimists on r/singularity argue the 64-sub-agent parallel attack architecture is the real signal — whether or not this specific proof holds, the playbook generalizes to other open problems.

OpenAI appended an explicit attribution line to the proof: “This proof was completed entirely by GPT-5.6 Sol Ultra” — opening legal and ethical questions about whether AI can hold copyright over mathematical theorems.

Three citeable data points:

Sources:

Lay out the alternatives: running Ultra-mode sessions and Lean builds on a personal Mac risks sleep interrupts and memory spikes that kill multi-agent API calls; API-only with no local verification makes it hard to run cdc-lean alongside agent orchestration scripts; macOS VMs violate EULA and restrict Xcode tooling. For teams needing iOS CI/CD, 24/7 AI agent automation, and stable compute, KVMNODE dedicated Mac Mini M4 cloud rental is usually the better host: Apple Silicon unified memory, open sudo, flexible daily/weekly/monthly terms. See the pricing page, help center, or order directly.

Last updated: 2026-07-13 · Proof verification status and model capabilities may change at any time