New Math from OpenAI
https://thezvi.wordpress.com/2026/10/09/new-math-from-openai/📌 【OpenAI】單一模型一天解開90道世界頂級數學難題
TL;DR:OpenAI內部前沿模型解出90個頂級開放數學問題,並把Lean證明全部公開在GitHub上。
2026年10月6日,一個原本應該佔據全球新聞頭條的消息,卻幾乎沒人注意到:OpenAI把一個內部模型解出的數百篇數學手稿直接丟上GitHub,其中包含全世界最難的500個開放數學問題裡的90個。有人說這是數學史上最重要的一天,也有人說,這恐怕只是指數曲線上又一個不起眼的局部極大值。
🤔 一個模型、一個提示,攻克4000題中的722篇
OpenAI這次公開的722份手稿(撤回3篇沒有Lean證明的之後剩719篇),被整理成372個問題家族。據描述,這些成果出自單一模型,很可能就是先前發布Navier-Stokes證明的那個模型,而且絕大多數問題只用了同一個提示(quasi-Riemann Hypothesis是少數例外)。模型被要求嘗試大約4000個問題,平均每個解答花費約3小時運算時間。提示內容直白到近乎挑戰:「即使問題是『開放』的,你的任務也是把它解決,並給出完整解答。」換句話說,OpenAI這次測試遠談不上全力以赴。
📊 從Riemann到圖論,幾個最受矚目的結果
- quasi-Riemann Hypothesis:證明了zeta函數的「zero-free strip」(無零點窄帶),且不存在Siegel zeros。數學家Alex Kontorovich形容,若這是人類做出的成果,「絕對是Fields Medal等級,甚至是兩個」。
- 矩陣乘法指數上界壓到2.25:此前的世界紀錄約為2.37。Steven Strogatz將這次進展比作Bob Beamon當年那驚人的跳遠世界紀錄。
- 整數乘法的漸進式簡化:與矩陣乘法類似,屬於asymptotic reduction,目前都還不是能直接在實務中變快的解法,但打破了極少人認為能被突破的舊有界線。
- Unique Games Conjecture:雖然不是直接處理P vs NP,但揭露了NP-hard問題在根本限制上的新結果,與Riemann一樣被視為最具份量的突破之一。
- Hodge猜想與Birch猜想:兩個對代數幾何極為關鍵的抽象問題,重要性僅次於Riemann相關結果。
- Hilbert第十問題的延伸:不是在問「這類問題算起來困不困難」,而是在問這類問題是否存在可計算的解。
- Hadwiger猜想(圖論著色):被形容為整批結果中最令人意外的一項,推翻了長期以來被視為圖論基本關係之一的假設。
- 量子資訊領域:物理學家Isaac Kim特別列出2D area law證明、spin-one Haldane gap、「parity不在QAC^0」、常數誤差的Aaronson-Kuperberg猜想,以及unitary VOA生成conformal net等成果。
💡 奇怪的是,這則新聞幾乎沒上新聞
will depue用GPT-6 Pro與Fable 5.1,把過去三年所有數學發現按「人類發現」與「AI發現」分類比對,結果10月6日公開的這批成果就佔了AI發現總數的81%;Fable 5.1自己排的前100大發現裡,今天公開的清單佔了59%,AI發現整體佔87%。經濟學者Kevin A. Bryan直言,若真的理解這代表什麼,這應該是全球頭版新聞。但多數媒體隻字未提,連AI相關的評論文章裡也看不到這條新聞的蹤影。有評論者拿1957年史普尼克號(Sputnik)發射後蘇聯媒體一開始也沒當回事來類比,認為頭條新聞有時就是會慢半拍才被意識到重要性。OpenAI研究員roon則提出另一種解讀:「在一條分段式指數曲線上,每一個局部極大值,從稍遠處看都顯得微不足道。」
⚠️ 還沒蓋章的部分:驗證與是否真的「會出題」
這批結果都附上了Lean形式化證明,這也是外界還沒能大量挑出錯誤的原因之一,想找漏洞的數學家並不會少。但目前仍無法判斷,這個模型是否真的更擅長「提出猜想」,還是只是在既有猜想上更擅長「完成驗證」,這部分還需要時間讓數學社群逐篇檢視。矩陣乘法與整數乘法的突破目前也都只是漸進式結果,尚未找到能在實務中真正變快的應用場景。
🎯 對工程師與研究者的意義
如果這個規模的結果驗證屬實,代表「同一個前沿模型,換一批提示,就能批量產出研究級數學成果」已經不是假設。對做AI4Science或基礎研究工具的團隊來說,下一步的優先順序很直白:把同樣的方法套到醫學、腫瘤學、電池材料等有明確現實回報的領域,可能比繼續攻克下一個數學猜想更有價值。
🔗 來源
- 標題:New Math from OpenAI
- 作者/機構:TheZvi,Don’t Worry About the Vase
- 連結:https://thezvi.wordpress.com/2026/10/09/new-math-from-openai/
#OpenAI #Mathematics #RiemannHypothesis #AIResearch #LeanProver #MatrixMultiplication #AI4Science #FrontierModels #ComputationalMath #MachineLearning
原始資料 Don't Worry About the Vase · 收集於 2026-10-09
摘要原文
It is kind of a huge deal. OpenAI dumped a broad range of huge new mathematical results produced by an internal frontier model. They just put it all on GitHub. This included 90 of the top 500 open problems in all of math , as per Proof of Atlas . In total there were 722 manuscripts (now 719 after three withdraws from the cluster that did not have Lean proofs) organized into 372 families. This was the result of a single model, presumably the same one that produced the Navier-Stokes proof (as per their link back to that post), mostly on a single prompt (quasi-RH was one of the few exceptions), working an average of three hours’ worth of compute per solution found, after being asked to try its luck at about 4,000 problems. The prompt included lines like ‘Even if the problem is “open,” the intention is that you should resolve it and present a full solution.’ OpenAI was trying a lot less than maximally hard. Levant and others called October 6, 2026, ‘obviously the most significant moment in mathematical history .’ Here is a thread of common sense graphical explanations (made by AI of course) of top problems. They look like this: First, the headline is the major breakthrough on Riemann. It’s not a solution to the hypothesis, but it’s a huge tightening on the bounds. Matrix multiplication efficiency at 2.25 may end up having the most real world impact. Maybe, but we haven’t yet found a scenario where this is faster in practice. It’s not quite a practically usable result yet, but matrix multiplication is the majority of the worlds compute. This could open a whole new approach. Integer multiplication is probably the most shocking result. Similar to matrix multiplication it’s a “asymptotic reduction”. Also like the matrix result, it’s not practical. But very few people would have predicted the previous barrier could be broken. Even slightly The Pi result isn’t necessarily the most important result here, but it may be the most fun. And probably accessible enough that even your kids can get it. Basically just how irrational is Pi. Unique games is also a pretty huge results, because like Riemann it’s adjacent to one of the most important problems in math: P vs NP. To be clear it’s not about P = NP itself. But does reveal new things about the fundamental limits to NP hard problems. Technically two problems, but I put them together because of similarities, in proof and implications. Hodge and Birch are both pretty abstract. But they’re both so important to algebraic geometry that after Riemann they may he the most significant results in the set. Hilberts 10th is another computer science problem. But unlike P vs NP it isn’t even about problems that are computationally hard to solve, it’s about whether a type of problem even has a computable solution. Last but not least is Hadwiger on graph coloring. It also ranks there for most shocking result of the full set. It basically overturns something that we thought was one of the most fundamental relationships in graphs Here are some analyses of the results in algebraic number theory . What is all of that good for? Ole Lehmann’s AI mentions applications for fusion research, portable body scanners, matching systems, tissue scans, quantum sensors and safety checks on self-driving cars and robots, among other things. Alex Kontorovich : Quasi-RH?!?!???! Are you kidding me? If a human did this, it would be an instant Fields Medal, no questions asked. RH says zeta has no zeros in Re(s)>1/2. The best we had until a second ago was a region that got thinner and thinner the higher up the imaginary axis you go. I thought maybe they’d fatten that up a bit, that’d be a massive breakthrough. But no. They got a zero free strip!!!! Insane Yeah, no Siegel zeros either. So I guess two Fields medals… Quasi-RH is not the full Riemann hypothesis, but it is sufficient for many purposes, such as computing square roots modulo a prime quickly without coin flipping, or getting a much better estimate of the number of primes below a given number, and a sibling paper gets to the core of Artin’s 1927 primitive root conjecture. Steven Strogatz : Many staggering results here. But this is a particularly amazing one: the exponent for matrix multiplication is no more than 2.25 . The previous world record had been something like 2.37. This leap in progress is like Bob Beamon’s long jump. Isaac Kim : This contains a shocking list of problems in quantum information, many-body physics and quantum computing, the field that are dear to my heart. There are too many, but let me pick the following. 1. Proof of area law in 2D. 2. Spin-one Haldane gap 3. Parity is not in QAC^0 4. Constant-error Aaronson-Kuperberg conjecture 5. Unitary VOAs generating conformal nets. Things are changing fast. I cannot even imagine what will happen over the next few months, let alone a year. will depue : i asked GPT 6 Pro and Fable 5.1 to rank all discoveries in the last three years for Human discovered for AI discovered (before October 6th) for AI discovered from OpenAI/math repo 81% of them have been released today. wtf Fable 5.1’s top 100 were 59% today’s list, 87% AI , full list at the link. Sauers : My agents (Opus 5.5, Astra, and 5.6 Sol) already solved some of these beforehand (on GitHub). I wonder what % of these actually require their internal model? The AIs all say when asked about all these math proofs as a hypothetical that this would be a huge deal, and should be front page new s, historic beyond any reasonable comparison, the biggest day in mathematics. Some think it is impossible. It turns out this was not front page news. Most people did not hear about it. It should have been, but no one in the news business knows what it means, or thinks people would care. Kevin A. Bryan : Ok, finished going through the OAI math list. It is bonkers and should be front page news around the world if folks understood what this meant. But if I am running strategy at a lab, #1 priority is “do this for medicine, oncology, battery efficiency, etc as fast as possible”. Joshua Gans starts off his coverage with the actual front page , in order to show us what things The New York Times thought were more important than solving 90 of the top 500 open math problems at once. Seth Burn : Sometimes front page news doesn’t initially reach the front page. The best example is Sputnik. It launched 10/4/57, but the Soviets didn’t think it was a huge deal [and it got a few paragraphs of a right-side column]. It was only after America freaked out that it [became a banner headline] in Russia on 10/6/57 . It was a remarkably slow news day otherwise. Much of this is not exactly breaking. Yet no math is to be seen, even in the summaries at the bottom, which even include a generic AI thinkpiece. Joshua Gans : What’s missing is this: 722 mathematics papers written by OpenAI . It isn’t an overstatement to say that this is probably the biggest day of scientific advancement in history. It is hard to evaluate, but the discussion that I have been seeing is that many of these are among the hardest and most significant results in mathematics. I suspect October 6th, 2026, will go down as some form of Judgment Day for AI in mathematics, but it portends so much more. The counterargument is that there might be a lot of days like this: roon (OpenAI): will yesterday be remembered as an important day? hard to say. in a punctuated exponential every local maximum looks invisible from a bit further out I like this model of why mathematics is not done quite yet: Joshua Gans : The mathematicians are now going through this. To which I offer again the above Bookend slide to help: We cannot yet show that the AI is better at conjectures or final verification. That will take some additional time, although probably not all that much time. Verification has to be pretty good or we would have found a lot more errors by now. There are a lot of mathematicians who would love to find a mistake.
由 claude-code/sonnet 自動生成