OpenAI’s September 8, 2026 announcement that an unreleased internal model orchestrated roughly 10,000 autonomous agents to produce a Lean-verified proof of finite-time singularity formation in the Navier-Stokes equations has reset expectations for AI-driven solutions to the remaining Millennium Prize Problems. The effort, completed in about 88 hours at an estimated $15 million compute cost, built on prior human-AI collaboration involving Anthropic researcher Levent Alpöge and NYU mathematician Tristan Buckmaster on related Euler and Boussinesq cases, sparking priority disputes. Traders now weigh rapid scaling of multi-agent reasoning and formal verification against the two-year community scrutiny period required by the Clay Mathematics Institute, with the Hodge Conjecture viewed as the next plausible target amid ongoing model advances.
Экспериментальная сводка, созданная ИИ на основе данных Polymarket. Это не является торговой рекомендацией и не влияет на то, как разрешается этот рынок. · ОбновленоЛаборатория ИИ анонсирует еще одно решение Millennium Prize от...?
$189,746 Объем
30 сентября 2026 года
28%
31 декабря 2026 года
60%
31 декабря 2027 года
82%
$189,746 Объем
30 сентября 2026 года
28%
31 декабря 2026 года
60%
31 декабря 2027 года
82%
The qualifying problems are the Riemann Hypothesis, P versus NP, the Yang-Mills existence and mass gap problem, the Hodge Conjecture, and the Birch and Swinnerton-Dyer Conjecture (https://www.claymath.org/millennium-problems/). Announcements concerning the Navier-Stokes existence and smoothness problem will not qualify.
A qualifying announcement must express that the problem has been solved; announcements of partial results or progress toward a solution will not qualify. The announcement must present the solution as the work of the lab, its researchers, or its models, alone or jointly with outside researchers. An announcement that only credits or congratulates outside researchers, including researchers who used the lab's models, compute, or research credits, will not qualify. No further confirmation from Clay Math Institute or any other organization is required.
The eligible AI labs are Anthropic, Google, SpaceXAI, Alibaba, OpenAI, Baidu, Z.ai, Xiaomi, Moonshot, Meta, Nvidia, DeepSeek, MiniMax, Meituan, Amazon, ByteDance, Mistral, Tencent, StepFun, Microsoft, Harmonic, Axiom Math, Math Inc, Safe Superintelligence, Thinking Machines Lab, Reflection AI, Periodic Labs, Apple, IBM, Huawei, Samsung, Oracle, Salesforce, Cohere, AI21 Labs, Reka, Sakana AI, Poolside, Magic, Perplexity, Anysphere, Kuaishou, SenseTime, iFlytek, Baichuan, and 01.AI, together with their subsidiaries and research divisions, and any other company with a model listed on the MMLU-pro leaderboard (https://huggingface.co/spaces/TIGER-Lab/MMLU-Pro) at the time of the announcement. Announcements by any other company, organization, or individual will not qualify.
The primary resolution source for this market will be official information from the eligible AI labs and/or their official representatives; however, a consensus of credible reporting may also be used.
Открытие рынка: Sep 8, 2026, 3:28 PM ET
Кто определяет исход
0x65070BE91...The qualifying problems are the Riemann Hypothesis, P versus NP, the Yang-Mills existence and mass gap problem, the Hodge Conjecture, and the Birch and Swinnerton-Dyer Conjecture (https://www.claymath.org/millennium-problems/). Announcements concerning the Navier-Stokes existence and smoothness problem will not qualify.
A qualifying announcement must express that the problem has been solved; announcements of partial results or progress toward a solution will not qualify. The announcement must present the solution as the work of the lab, its researchers, or its models, alone or jointly with outside researchers. An announcement that only credits or congratulates outside researchers, including researchers who used the lab's models, compute, or research credits, will not qualify. No further confirmation from Clay Math Institute or any other organization is required.
The eligible AI labs are Anthropic, Google, SpaceXAI, Alibaba, OpenAI, Baidu, Z.ai, Xiaomi, Moonshot, Meta, Nvidia, DeepSeek, MiniMax, Meituan, Amazon, ByteDance, Mistral, Tencent, StepFun, Microsoft, Harmonic, Axiom Math, Math Inc, Safe Superintelligence, Thinking Machines Lab, Reflection AI, Periodic Labs, Apple, IBM, Huawei, Samsung, Oracle, Salesforce, Cohere, AI21 Labs, Reka, Sakana AI, Poolside, Magic, Perplexity, Anysphere, Kuaishou, SenseTime, iFlytek, Baichuan, and 01.AI, together with their subsidiaries and research divisions, and any other company with a model listed on the MMLU-pro leaderboard (https://huggingface.co/spaces/TIGER-Lab/MMLU-Pro) at the time of the announcement. Announcements by any other company, organization, or individual will not qualify.
The primary resolution source for this market will be official information from the eligible AI labs and/or their official representatives; however, a consensus of credible reporting may also be used.
Кто определяет исход
0x65070BE91...OpenAI’s September 8, 2026 announcement that an unreleased internal model orchestrated roughly 10,000 autonomous agents to produce a Lean-verified proof of finite-time singularity formation in the Navier-Stokes equations has reset expectations for AI-driven solutions to the remaining Millennium Prize Problems. The effort, completed in about 88 hours at an estimated $15 million compute cost, built on prior human-AI collaboration involving Anthropic researcher Levent Alpöge and NYU mathematician Tristan Buckmaster on related Euler and Boussinesq cases, sparking priority disputes. Traders now weigh rapid scaling of multi-agent reasoning and formal verification against the two-year community scrutiny period required by the Clay Mathematics Institute, with the Hodge Conjecture viewed as the next plausible target amid ongoing model advances.
Экспериментальная сводка, созданная ИИ на основе данных Polymarket. Это не является торговой рекомендацией и не влияет на то, как разрешается этот рынок. · Обновлено
Не доверяй внешним ссылкам.
Не доверяй внешним ссылкам.
Часто задаваемые вопросы