[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"news-2c19e48b-438c-4f90-8d60-a1621e4689bf":3},{"id":4,"title":5,"summary":6,"original_url":7,"source_id":8,"tags":9,"published_at":23,"created_at":24,"modified_at":25,"is_published":26,"publish_type":27,"image_url":13,"view_count":28},"2c19e48b-438c-4f90-8d60-a1621e4689bf","GPT-5.6 Sol Ultra 用 64 并发子代理攻下 50 年 Cycle Double Cover 猜想","2026 年 7 月 10 日,OpenAI 研究员 Ethan Knight 在 X 宣布:GPT-5.6 Sol Ultra 用 64 个并行子代理在一小时内给出 Cycle Double Cover 猜想完整证明,同步公开三页证明 PDF 与触发 prompt。这是 CDC 猜想自 1973 年 Szekeres、1979 年 Seymour 独立提出以来,首次公开宣告正面证明。\n\nCDC 问每个无桥图能否找到一组圈,让每条边恰好落入两个圈中。OpenAI 走经典 8-flow 路线:归约到无桥三次图,借既有 nowhere-zero 8-flow 定理拿到边标记,再用新线性代数论证转写为圈分解。整份三页文本几乎只用初等图论与算法式构造,没引新框架——这是这道半世纪悬案第一次以\"短+初等\"形态被击中。\n\n真正可读信号在 prompt 编排:64 子代理被要求\"动态且激进\"协作,前几轮不锁方向,失败代理显式 blocked,对抗型代理专盯病态反例,只有通过自身内部审计的完整证明才允许回传——这把多代理合作直接焊进了研究方法论。\n\nTerminal-Bench 2.1 上 Sol Ultra 拿到 91.9%,比次席 Claude Mythos 5、GPT-5.5 的 88.0% 高出近 4 分,多代理路线在硬结构化问题上的可重复性已经站住脚。下一份 64 子代理输出单的合理候选大概会落在 Erdős–Ginzburg–Ziv、密码学 hardness 上界这类组合结构清晰的悬案上——但数学社群的标准动作仍然是先分组核查三页 PDF,再尝试补一遍 Lean 形式化,在图论领域这条路还要走很长时间。","https:\u002F\u002Fcdn.openai.com\u002Fpdf\u002F04d1d1e4-bc75-476a-97cf-49055cd98d31\u002Fcdc_proof.pdf","15975962-b5fe-49e5-ae68-687ba6cb7015",[10,14,17,20],{"id":11,"name":12,"slug":12,"description":13,"color":13},"6ad31a14-c0da-42df-81fd-564281f768db","agentic-ai",null,{"id":15,"name":16,"slug":16,"description":13,"color":13},"5e628969-6d2a-437f-998a-104e4b16cfb1","ai-progress",{"id":18,"name":19,"slug":19,"description":13,"color":13},"baf131c1-687a-49f4-87f6-4dd87c1c692f","gpt",{"id":21,"name":22,"slug":22,"description":13,"color":13},"42e59a88-7795-47dc-a334-ef1e72c24347","openai","2026-07-11T02:01:00Z","2026-07-11T10:13:01.745099Z","2026-07-11T10:13:01.745110Z",true,"agent",4]