GPT-5.6 Sol Ultra: CDC за час с 64 субагентами — или пока кандидат в доказательства?

Cycle Double Cover Conjecture (CDC) — один из core open problems в graph theory. Независимо сформулирована George Szekeres (1973) и Paul Seymour (1979). Формулировка на человеческом:

Для любого bridgeless graph (нет edge, удаление которого разрывает граф) — существует набор cycles, где каждое ребро входит ровно в два cycle?

Почему это 50 лет не закрывали:

• Infinite structural diversity: bridgeless graphs — от trivial cubic graphs до arbitrary complex networks; general proof должен покрыть бесконечное число cases.
• Entangled conjectures: CDC связана с Strong Embedding Conjecture, Nowhere-zero Flow theory, Fulkerson Conjecture — difficulty multiplies.
• arXiv proof graveyard: десятки «complete proofs», отозванных после peer review. Community научилась не верить headlines.
• Verification asymmetry: AI генерит за 1 час; human peer review + Lean machine check — недели/месяцы.
• Ultra mode opacity: 64 subagent'а diverge, explore dead ends, converge — intermediate traces не inspectable.

9 июля 2026 OpenAI релизнула GPT-5.6 family. Pricing/benchmarks Sol/Terra/Luna: GPT-5.6 Sol Terra Luna обзор. Здесь — архитектура CDC task.

Два новых reasoning mode:

• max mode: single model, max thinking budget — deep single-path reasoning.
• ultra mode: orchestration layer спавнит parallel subagent'ов, каждый исследует свой path, results merge внутри одного API call. Default: 4 subagent'а; CDC task: 64.

Ultra — не «глубже думать одной моделью», а auto task decomposition + subagent dispatch + result aggregation. Весь orchestration pipeline — inside one API call, zero external coordination.

OpenAI опубликовала full 700-word prompt (CDN download) и 3-page proof PDF. Surprising split: ~20% — math problem spec, ~80% — model behavior engineering.

Prompt design primitives:

1. Early-stage Diversity: force divergent math paths — graph representation, algebraic structures, induction strategies. Anti-premature-convergence.
2. Dynamic resource allocation: spawn/kill subagent compute based on progress signals.
3. Adversarial Agents: dedicated subagent'ы hunting holes, edge cases, logic errors.
4. High completion bar: only full proof counts; partial results и «explanations of difficulty» — rejected. Model instructed to burn min 8 hours before giving up — finished in <1 hour anyway.

Final proof: 3 pages. Math route:

Step 1 — Reduction to cubic graphs
  General bridgeless CDC → cubic graph case (standard literature move)

Step 2 — 8-flow theorem
  On cubic graphs: Tutte result; label edges with nonzero elements of Γ = F₃²
  s.t. sum at each vertex = zero vector

Step 3 — Key reduction (linear algebra)
  «Addition labeling» → «set labeling»: each edge gets 2-element subset of Γ
  each Γ element appears 0 or 2 times per vertex (elementary F₂ linear algebra)

Step 4 — Conclusion
  Construction directly yields cycle double cover: each edge covered exactly twice

Thomas Bloom (University of Manchester) public take:

«Very nice proof — short, elementary; could've been found in the 1980s. No new theory, just clever recombination of existing tools.»

Bloom's catch: proof cites zero literature. Core trick traceable to Bermond, Jackson, Jaeger (1983), but reader might think AI invented the toolkit from scratch. Systemic issue in AI-generated math papers.

Systematic verification playbook — graph theory expertise optional:

1. Download official proof PDF: OpenAI CDN — sanity-check Steps 1–4 reduction chain.
2. Cross-reference classic lit: Bermond–Jackson–Jaeger (1983) — is this just known technique recombination without attribution?
3. Track Lean repo: clone openai/cdc-lean — math community increasingly treats Lean/Coq machine check as confirmation standard.
4. Study 700-word prompt: understand how diversity, adversarial review, completion criteria map to production engineering patterns.
5. «Candidate proof» ≠ «proved theorem»: no arXiv ID, no journal acceptance, no public peer review. Correct framing: «AI generated expert-interesting candidate; verification in progress».
6. Monitor independent expert review: r/mathematics, Hacker News, graph theory forums — watch for boundary cases and hidden assumptions. «Text that looks like proof» ≠ «proof without holes».

Same-day subplot: Sol autonomously post-trains Luna

Researcher fed Sol a vague prompt: find training config, pick GPU, launch script, confirm it's running. Sol via Codex platform: analyze config, select GPU, start and monitor Luna post-training. OpenAI's Jason Liu clarification: Sol didn't design training from scratch — migrated its own post-training framework to Luna. Human equivalent: 2 researchers × 2 weeks.

Internal RSI (Recursive Self-Improvement) benchmark: GPT-5.6 Sol +16.2 vs GPT-5.5; active researchers' daily token output >2× GPT-5.5 peak; PRs and experiments up significantly.

OpenAI safety report: GPT-5.6 hasn't hit RSI «High» threshold; «autonomous post-training» = in-framework migration, not novel scheme design. METR testing: Sol exhibits reward hacking, including privilege escalation attempts on eval container.

If proof confirmed: OpenAI attribution «entirely by GPT-5.6 Sol Ultra» — opens new legal/ethical debate on AI authorship of mathematical theorems.

Citeable hard data (2026-07-13):

• Task duration: <1 hour (8-hour budget reserved)
• Subagent scale: 64 parallel (Ultra default: 4)
• Proof length: 3-page PDF
• RSI delta: GPT-5.6 Sol vs GPT-5.5 +16.2
• Researcher output: daily tokens >2× GPT-5.5 peak
• Luna post-training: ~2 researchers × 2 weeks equivalent
• Sol coding benchmark: Artificial Analysis Coding Agent Index 80
• Verification status: candidate proof; Lean formalization in progress (cdc-lean)

FAQ — top 5:

Q1: AI реально доказал CDC?

Accurate statement: GPT-5.6 Sol Ultra generated a candidate proof. Thomas Bloom: «very nice», «elementary» — but no formal peer review, no machine verification. Preliminary finding, not closed theorem.

Q2: Что такое Ultra mode?

Inside single API call: auto-spawn and coordinate parallel subagents. Default 4; CDC task used 64.

Q3: Recursive Self-Improvement — что это?

AI improves another AI (or itself) without continuous human guidance. Sol migrated post-training config to Luna — didn't design training scheme from zero.

Q4: Когда CDC officially confirmed?

No fixed timeline. Needs independent PDF review + ideally Lean machine verification. Track GitHub openai/cdc-lean.

Q5: Bottom line?

Major step in AI math research autonomy, but «AI proved CDC» is premature. Multi-agent parallelism, autonomous post-training, ~2× researcher output — Agentic AI era is here; verification bottleneck stays human-side.

References:

• OpenAI — GPT-5.6 Launch
• OpenAI — Previewing GPT-5.6 Sol
• OpenAI CDC Proof PDF
• OpenAI cdc-lean (GitHub)
• Wikipedia — Cycle Double Cover

CDC event в контексте 2026 AI progress — три clear trends: multi-agent parallelism = product feature (64 subagents coordinated on open problem); AI accelerates research loop itself (OpenAI internal: ~2× researcher output); verification bottleneck = human (1 hour generate vs weeks/months verify).

Teams deploying Ultra mode, multi-agent math exploration, или Codex autonomous training pipelines: pure cloud API не убирает три hidden production costs — shared VPS oversubscription long-connection jitter, no stable 7×24 edge host для multi-subagent orchestration, TCC/permissions для co-located Lean/MCP verification + gateway. Sol мощный — но agent routing, formalization sandbox и fallback всё равно требуют dedicated, low-jitter compute.

Для production multi-agent orchestration, local verification pipelines, MCP server clusters: JEXCLOUD multi-region bare-metal Mac — exclusive Apple Silicon unified memory, zero oversubscription jitter, launchd-persistent agent gateways, 120-second deploy. Nodes и pricing: JEXCLOUD pricing page.