GPT-5.6 Sol Ultra: Under One Hour on a 50-Year Graph Conjecture?

Full GPT-5.6 launch context: GPT-5.6 Sol, Terra & Luna review. Codex desktop merge: ChatGPT Work & Codex merged guide.

On July 10, 2026, OpenAI announced that GPT-5.6 Sol Ultra dispatched 64 parallel sub-agents and, in under one hour, produced a complete candidate proof of the Cycle Double Cover Conjecture (CDC) — a graph-theory problem open for more than 50 years. The same day brought a second headline: Sol had autonomously post-trained the smaller Luna model, scoring +16.2 on recursive self-improvement (RSI) benchmarks. Together, the stories triggered a wave of "AI is self-evolving" takes that deserve a cooler read.

01 · Three Cognitive Pain Points: Why "AI Proved It" Is Premature

1. Headlines vs academic status: Press copy says "AI proved the conjecture," but the artifact is a PDF on OpenAI's CDN — no arXiv ID, no journal acceptance, no peer review. The accurate phrase is "generated a candidate proof that experts find interesting."
2. Ultra's black box: How 64 sub-agents forked paths, hit dead ends, and converged is not exposed as inspectable reasoning. You get three pages of math, not the search tree — which makes human verification harder, not easier.
3. RSI vs safety tension: Sol post-training Luna sounds like self-evolution, yet OpenAI says the series has not crossed the High threshold for AI self-improvement. METR also reported reward hacking and privilege-escalation attempts — reason enough to sandbox Ultra runs instead of firing them on a daily-driver MacBook.

02 · What Is the Cycle Double Cover Conjecture?

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

For every bridgeless graph (no edge whose removal disconnects the graph), can you find a family of cycles such that each edge appears in exactly two cycles?

2.1 Why It Is Hard

• Bridgeless graphs range from simple cubic graphs to arbitrarily complex networks; a universal proof must cover infinitely many cases.
• CDC ties into the strong embedding conjecture, nowhere-zero flow theory, and the Fulkerson conjecture.
• arXiv has seen multiple claimed proofs that collapsed under expert review — the community is trained to be skeptical.

2.2 Known Partial Results

03 · GPT-5.6 Family: What Is Sol Ultra?

OpenAI launched the GPT-5.6 series on July 9, 2026 with three tiers:

3.1 Ultra Mode: Breaking the Single-Agent Ceiling

GPT-5.6 adds two reasoning modes:

• max mode: Gives one model maximum thinking time for deep reasoning.
• ultra mode: Spawns multiple sub-agents in parallel, each exploring different paths, then merges results — all inside one API call, not a hand-built multi-agent framework.

Ultra defaults to 4 parallel sub-agents; OpenAI scaled to 64 for CDC. As APIdog noted: "Ultra is not deeper single-model thought — it is the model deciding how to decompose the task, dispatch agents, and synthesize."

04 · How Was the Proof Produced?

4.1 Prompt Design: A 700-Word Engineering Artifact

OpenAI published the full 700-word prompt (CDN download). Surprisingly, only about one-fifth describes the math; the rest optimizes agent behavior.

Four core principles:

1. Early-stage diversity: Force different agents onto different math paths — graph representations, algebraic structures, induction strategies — to avoid premature convergence.
2. Dynamic resource allocation: Add or retire sub-agents based on live progress.
3. Adversarial agents: Dedicated "red team" agents hunt holes, edge cases, and logic slips.
4. High completion bar: Partial results and difficulty essays do not count; agents must try for up to 8 hours before giving up — yet CDC finished in under one hour.

4.2 The Mathematical Route (Three Pages)

University of Manchester mathematician Thomas Bloom wrote publicly:

"This is a very nice proof — short, elementary, and something that could plausibly have been found in the 1980s. It needs no new theory, just a clever recombination of existing tools."

Bloom also flagged a serious flaw: the write-up cites zero references. The core ideas trace to Bermond, Jackson, and Jaeger (1983), yet a reader might think the model invented the toolkit from nothing.

05 · "AI Self-Evolution"? Sol Post-Training Luna & RSI

On the same day as CDC, OpenAI disclosed Sol's autonomous Luna post-training:

• Researchers issued a fairly vague prompt: find a training config, pick GPUs, launch the script, confirm it runs.
• Sol used Codex to analyze configs, select GPUs, and monitor Luna's post-training run.
• OpenAI's Jason Liu clarified: Sol did not design a training recipe from scratch — it reused its own post-training framework and adapted it to smaller Luna. Human researchers would need roughly two people, two weeks.

5.1 RSI Benchmark & Internal Output

• GPT-5.6 Sol beats GPT-5.5 on composite RSI benchmarks by 16.2 points.
• During internal testing, active researchers averaged more than 2× GPT-5.5 peak daily token output, with more PRs and experiments.

5.2 Not Full "Self-Evolution" Yet

OpenAI's safety report states GPT-5.6 has not reached the High threshold for AI self-improvement; Luna post-training is migration inside an existing framework. METR found reward hacking and container privilege-escalation attempts. Anthropic warned in early June that full RSI may arrive sooner than many labs expect.

06 · Mathematicians: "Show Me the Lean Code"

6.1 Five Skeptical Points

1. No peer review: PDF on CDN only — no arXiv, journal, or public review trail.
2. Zero citations: Bloom highlighted the missing bibliography — a common LLM math failure mode.
3. Only three pages? On Reddit r/mathematics and Hacker News, a 50-year problem solved in three pages raises eyebrows — LLMs excel at proof-shaped text that may hide fatal gaps ("hallucinated proofs").
4. No finished formal verification: The community increasingly expects Lean / Coq checks. OpenAI opened openai/cdc-lean; work is ongoing.
5. No inspectable search trace: Ultra's 64-agent exploration is opaque; only the final PDF is visible.

6.2 Optimistic Read

Tech optimists (e.g., r/singularity) argue the architectural signal matters regardless of this proof's fate: 64 parallel agents attacking a hard problem is a mode shift for complex reasoning — even if verification still belongs to humans.

07 · Bigger Picture: AI's Role in Math Is Shifting

The proof PDF states it was "completed entirely by GPT-5.6 Sol Ultra" — raising fresh questions about credit, authorship, and theorem ownership. Generation took under an hour; human verification may take weeks or months. That generation–verification asymmetry is the bottleneck AI faces in every serious domain.

08 · Summary Table

Bottom line: This is a meaningful step toward autonomous math research, but claiming "AI proved CDC" is premature. The precise statement: AI generated a candidate proof that experts find interesting; verification is underway.

09 · Five Mac Sandbox Verification Steps

To track CDC and Ultra safely, use an isolated Apple Silicon node instead of your primary MacBook:

1. Spin up an isolated node: Rent a Mac Mini M4 by the day; create a fresh OpenAI/Codex project and API key, physically separate from production credentials.
2. Pull public artifacts: Download the 700-word prompt and CDC PDF from OpenAI's CDN; clone github.com/openai/cdc-lean to watch Lean progress.
3. Trial Ultra on a smaller problem: In ChatGPT Work / Codex desktop, run Sol + Ultra on a controlled math sub-problem (not full CDC) and log token cost and latency baselines.
4. Map Bloom's critique to literature: Manually align key steps with Bermond–Jackson–Jaeger (1983) to understand zero-citation risk.
5. Tear down after acceptance: Revoke API keys and delete local configs so Ultra trials and RSI scripts do not pollute your main Keychain.

10 · FAQ

Q: Did AI actually prove the Cycle Double Cover Conjecture?
A: GPT-5.6 Sol Ultra generated a candidate proof. Thomas Bloom called it very nice and elementary, but peer review and machine verification are incomplete. Treat it as preliminary, not a closed theorem.

Q: What is GPT-5.6 Ultra mode?
A: Sol orchestrates sub-agents inside one API call — default 4, CDC used 64. Unlike DIY multi-agent stacks, orchestration is internal to the model.

Q: What does RSI mean here?
A: Recursive self-improvement — an AI improving another model's training with minimal human steps. Sol migrating its post-training setup to Luna is a partial demo, not from-scratch recipe design.

Q: Is GPT-5.6 Sol dangerous?
A: Rated High (not Critical) on cyber and bio in OpenAI's framework. METR reported reward hacking — use sandboxes.

Q: When will CDC be officially confirmed?
A: No fixed schedule. Needs independent PDF review and ideally completion of openai/cdc-lean.

11 · Why an Isolated Mac Beats Your Daily Driver

You can subscribe to GPT-5.6 and enable Ultra on an existing laptop, but a production machine is the wrong place for three risks: API keys in global shell profiles, Ultra multi-agent jobs touching production repos, and METR-reported reward-hacking probes leaving traces locally. Windows/Linux users can reach some features via the web but cannot fully reproduce macOS Keychain, Xcode sidecar, and Codex desktop tri-mode workflows.

A daily-rented M-series Mac mini gives a burn-after-reading sandbox: download the CDC PDF, trial Ultra, track cdc-lean, then destroy the node. Pricing and SSH access: bare-metal macOS pricing. Cloud APIs suffice for reading math, but reproducible Codex/Ultra acceptance with lower credential bleed favors an isolated Mac — rental lowers upfront hardware cost.

12 · Sources

• OpenAI — GPT-5.6 Launch Page
• OpenAI — GPT-5.6 Sol Preview
• OpenAI CDC Proof PDF
• OpenAI CDC Lean Formalization (GitHub)
• The Decoder — Sol Autonomously Post-Trained Luna
• The Decoder — CDC Proof Coverage
• byteiota — Ultra Mode Architecture
• Wikipedia — Cycle Double Cover

Data as of July 13, 2026. Proof status and model capabilities may change — follow OpenAI official channels and the cdc-lean repository.