正在读取
正在准备公开内容。
这是读取过程,不代表当前没有内容。页面准备完成后会自动显示。
正在连接内容来源
正在读取
这是读取过程,不代表当前没有内容。页面准备完成后会自动显示。
正在连接内容来源
每日公开源信号
公开页不会暴露原始候选池。新闻必须经过 AI 自动审核或人工复核并确认纳入趋势报告,才会在这里出现。
2026-09-05
日期、来源、摘要、可信度和合规说明均来自通过完整审核门禁与哈希校验的每日公开快照;周报发布后由同期完整发布包接管。
Exa MCP search metadata: Fermat's Last Theorem Machine-Checked: Claude Completes in 11 Days What Took Years to Plan. # Fermat's Theorem Machine-Checked: Claude Completes in 11 Days What Took Years to Plan Author: Devin Culbertson Published: Sep 05 2026, 9:39 AM EDT Published: 2026-09-05T09:39:45-04:00 Source: techtimes.com (techtimes.com) Language: en Anthropic published the first complete computer-checked formalization of Fermat's Last Theorem on September 4, 2026 — a task the mathematical community had expected to take years of coordinated human effort — after Claude wrote 13 million lines of Lean proof-assistant code in 11 days using a multi-agent platform that solved the fundamental pro... 来源:Exa MCP。Exa MCP public search metadata via the Agent Reach documented route; no cookies, login state, or full article body stored. Trafilatura public URL extraction; stored short extract only, no full article body, cookies, or headers.
打开公开来源日期归档
只列出至少包含一条已复核公开信号的日期。