| ▲ | Jaxan 3 hours ago |
| There seems to be a completely human proof also: https://math216.wordpress.com/2026/11/20/hurried-announcemen... |
|
| ▲ | hkmaxpro 2 hours ago | parent | next [-] |
| Unfortunately AI has found errors in the human-only proof (not sure if fixable) https://news.ycombinator.com/item?id=50580084 |
| |
| ▲ | gpt5 an hour ago | parent | next [-] | | It’s a 1,000 pages dense document. I’m not even sure the PDF conversions are accurate enough to feed it ti an LLM. Also - if that’s the future of math (larger and larger proofs and algorithms, to the point they are far beyond a human’s capability to comprehend, then I wonder how mathematicians work would look like. | |
| ▲ | traes 40 minutes ago | parent | prev | next [-] | | It was rushed out before being fully checked, not a huge surprise. They even say in their blog post that there are likely gaps but they hope they are fixable. | |
| ▲ | 2 hours ago | parent | prev | next [-] | | [deleted] | | | |
| ▲ | twotwoone an hour ago | parent | prev [-] | | I guess when this evidence was tested, all this evidence was leaked to Anthropics, right? And after that they say that they received this evidence from their super-duper-AI. I reckon Anthropic’s stock would drop by 30% if word of this got out. |
|
|
| ▲ | __MatrixMan__ 3 hours ago | parent | prev | next [-] |
| Wouldn't it be fun if they were both correct, but with wildly different structures? We could maybe use the proof difference to characterize the prover difference (AI-assisted vs not). |
| |
| ▲ | thomquaid 11 minutes ago | parent | next [-] | | That is the current situation. There are big differences at key steps, though most of the plumbing is in common. | |
| ▲ | ignoramous 13 minutes ago | parent | prev | next [-] | | > Wouldn't it be fun if they were both correct, but with wildly different structures? Theories in (Quantum?) Physics (Heisenberg / Feynman / Schrodinger etc) are very much like this, apparently. | |
| ▲ | korbonits 2 hours ago | parent | prev [-] | | this is actually something i'm trying to study | | |
| ▲ | __MatrixMan__ an hour ago | parent [-] | | Structurally, like, treating the proof like a graph or something along those lines? Or socially, like this part of the proof resembles proofs given by this group of mathematicians, so we can say it has a certain heritage? Or some other way? It's easy for me to wish for such a thing, but I have no idea what one would latch onto when granting such a wish. |
|
|
|
| ▲ | zeraye 3 hours ago | parent | prev | next [-] |
| Is there someone with sufficient expertise to compare, at a very general level, whether Levent Alpöge and Alessandro Masullo use similar approaches to solving the GRH? |
| |
| ▲ | m11a 2 hours ago | parent | next [-] | | I doubt these questions are gonna be answered anytime soon. AIUI even Navier-Stokes hasn't been independently verified yet. If the abc-conjecture affair is anything to go by, these things often take a while to digest and only so many people have the appropriate expertise to fully evaluate them. | |
| ▲ | auntienomen 2 hours ago | parent | prev | next [-] | | At first glance, based on Alpoge's description of his odyssey, I'd say no, not the same approach. | |
| ▲ | MiiMe19 2 hours ago | parent | prev [-] | | The Alpoge proof is like 250k pages, I doubt anyone knows what is going on with it, even Alpoge. | | |
| ▲ | CapmCrackaWaka 2 hours ago | parent | next [-] | | If his proof is 250,000 pages, then I am extremely dubious. Just today, I was working with about 1000 lines of code and asked opus 5.4 to make a change. It introduced an obvious bug, that actually ended up doing the exact opposite of what I asked to do( print out less lines of logging, instead of more).. even if he has access to some kind of super LLM, I am extremely skeptical that it can output a 250,000 page document that is coherent and bug free, no matter what this guy says. | | |
| ▲ | chunky1994 2 hours ago | parent | next [-] | | Its a formally verified proof. Its the same thing as saying your code compiled successfully (for a compiled language). If opus made a change and your code still compiled, you would certainly still say, my code compiled. The statement being asserted in lean is analogous to my code compiled. Lean works based on this: https://en.wikipedia.org/wiki/Curry%E2%80%93Howard_correspon... | | | |
| ▲ | ThePhysicist 2 hours ago | parent | prev | next [-] | | I would assume they do not produce the proof at once, and Lean is different from programming language (as far as I understand) in the sense that you can check if a program is correct or not within the Lean model, so it seems ideally suited for AI as they can experiment and extend the proof without ever producing a bug. I assume the real difficulty is checking that what you have proven is actually what you wanted to express but I would assume this is easier. Makes me wonder if general programming languages are too expressive for AI making it too easy to express conflicting or incorrect ideas, we might need something like Lean but for general purpose programming. I'm aware there are some formal systems for that but I think more along the lines of general purpose programming. | | |
| ▲ | lheck 13 minutes ago | parent [-] | | I‘m doing a PhD in software verification right now and I agree. I’m not sure whether it’s about the power of the programming languages but more about their interfaces. Proof checkers like Lean are already what you describe, as Lean is also a programming language, but yes, there will be more general purpose tools for writing code that is correct by construction. The remaining hurdle is that you cannot actually verify correctness of many programs as you don’t know their full spec. But that is a very different problem to what we had before. |
| |
| ▲ | 2 hours ago | parent | prev | next [-] | | [deleted] | |
| ▲ | cakeface 2 hours ago | parent | prev | next [-] | | Did you deliberately pick Opus 5.4 over Opus 5.5? That was the biggest thing that stood out to me in your comment. Opus 5.5 has been an all time banger for me. | | |
| ▲ | plorkyeran 2 hours ago | parent [-] | | Opus 5.4 doesn't exist, so they presumably meant either GPT 5.4 or Opus 5.5. |
| |
| ▲ | redbluered3 2 hours ago | parent | prev [-] | | You don't have access to the secret model the labs keep for themselves. Neither can you spin up thousands of subagents and burn billions of tokens a day. Proof can be total bunk but underestimating the labs is silly. |
| |
| ▲ | lossolo 2 hours ago | parent | prev [-] | | So how do we know if it does what it does? Anyone that is using frontier models for a few years, will tell you that they try to reward hack whenever they can. | | |
| ▲ | Frost1x 2 hours ago | parent | next [-] | | That’s the purpose of Lean. It’s kind of like asking: how do you know your CPython is running all the correct binary? Well, you kind of don’t, as it’s beyond human comprehension (in theory you could trace everything down to a certain level) but there are layers and layers of build abstraction that you assume are correct, compilers, runtime environments, and mature libraries that are checked and validated. Not a perfect analogy but that’s kind of the gist of it. | | |
| ▲ | lossolo 2 hours ago | parent | next [-] | | OK, but if I write code, I can verify it in a few simple steps. What about 250k pages of proof? How can I verify that page 133,432 has the correct assumptions and that it isn't reward hacked just to make lean code pass? How it's done? | | |
| ▲ | utkuumur 2 hours ago | parent | next [-] | | You don't need to! That is the beauty of Lean. You only need to check the problem definition (which is no where near 250k pages) and then Lean checks the proofs it self by checking whether each next line can be derived from previous lines. And for this problem, there are many validated problem definitions in Lean. So it is probably true. | | |
| ▲ | lossolo2 an hour ago | parent [-] | | > and then Lean checks the proofs it self by checking whether each next line can be derived from previous lines Ah, so it's similar to something like Merkle trees, where each leaf must be cryptographically valid up to the root otherwise the whole branch is invalid? So you start with a simple definition that then evolves? |
| |
| ▲ | cman1444 2 hours ago | parent | prev [-] | | You can personally verify every binary digit of your code in a few simple steps? |
| |
| ▲ | prmph 22 minutes ago | parent | prev [-] | | So Lean itself is proved? With what... Lean? A 250k pages proof is massive, even if correct, there is almost certainly something extremely inefficient or weird in there. I cannot imagine that a fundamental proof like this will require hundred of thousand of logic steps. Unless some part of the proof is about brute-force checking that something holds for a huge number of literal cases. |
| |
| ▲ | m11a 2 hours ago | parent | prev [-] | | In theory, if you formulated your proposition correctly, and Lean says it is proved, then the proposition is true. This works because of the Curry-Howard correspondence -- proofs can be represented as computation. | | |
| ▲ | lossolo 2 hours ago | parent [-] | | OK, so if I understand correctly, I formulate a proposition in natural language, then an LLM creates 250k pages of proof based on it, then it takes those 250k pages/lines of proof and creates 15 million lines of code to prove those 250k pages. Is that correct? If so, how can I be sure that my proposition is correctly translated into those 250,000 pages? Isn't it possible that the LLM can reward hack here in the same way I've seen it do in some cases where it struggles to pass the test and get its reward? For example, it tries to change assumptions without telling me because something doesn't work or it removes something or changes the test etc. | | |
| ▲ | YeGoblynQueenne 30 minutes ago | parent | next [-] | | >> If so, how can I be sure that my proposition is correctly translated into those 250,000 pages? It's not the proposition (i.e. the theorem) you need to worry about but the proof. I'm sorry to say but the comments on here (and everywhere on the internets) that assure each other that "if it's veified by Lean, then it's true" misunderstand what they're even trying to claim. Here's a good article on the subject that was recently posted on HN: https://xenaproject.wordpress.com/2026/11/12/and-the-proof-i... And here's the tl;dr: >> This post is an attempt to explain in simple terms how to interpret claims of the form “this theorem is correct because it was checked in Lean”. The summary is: there is an important signal that can be extracted from Lean code, but if this code is AI-generated then you need to do some tests first. We explain the tests, and note that in many cases (such as the OpenAI theorem dump) these tests have not yet been systematically done. | |
| ▲ | rdlw an hour ago | parent | prev | next [-] | | What assumptions could it change? The model should not be able to alter the definition of the RH, and if you want to prove to yourself that that definition is accurate, you just have to read through it and build a mental model of the Lean code: https://github.com/bhgomes/lean-riemann-hypothesis Then if it constructs a valid proof in Lean, how could it be reward hacking? I suppose it could have found a Lean compiler bug, or a mistake in the formalization of the hypothesis. I would expect that those problems would be found and fixed reasonably quickly, and we would need to see if the proof could be fixed. Other than that, I suppose it could find a contradiction in ZFC, but that would be an even more incredible result than proving RH. I don't really see the possibility for reward hacking with the stipulation that the proof is ultimately verified by compiling the Lean program. | |
| ▲ | hazbot 2 hours ago | parent | prev | next [-] | | > For example, it tries to change assumptions without telling me because something doesn't work or it removes something or changes the test etc. You have in Lean a headline statement of "given X, then Y is true". Where X and Y and precise statements in code. So the mathematical assumptions are upfront. If you trust the lean compiler and are very careful to vet that the headline statement is what you expect, then you know the theorem is true. How well the human language mechanics of the proof corresponds to what the actual lean mechanics of the proof is very much up on the air. | |
| ▲ | chunky1994 2 hours ago | parent | prev | next [-] | | The 250k pages is the 15M LOC of lean proof. The code is the proof. | | |
| ▲ | an hour ago | parent | next [-] | | [deleted] | |
| ▲ | lossolo 2 hours ago | parent | prev [-] | | I see, so there is one step less, then how I can know if that 250k pages describe my proposition correctly and not something else? Lean code was written by LLM, correct? | | |
| ▲ | rdlw an hour ago | parent | next [-] | | 250k pages describe the proof, not the proposition. You have to prove to yourself that the proposition is correctly described: https://github.com/bhgomes/lean-riemann-hypothesis | |
| ▲ | chunky1994 an hour ago | parent | prev [-] | | In formal proof verification the only thing you need to verify is the problem statement expressed in lean, you don't need to check the lean code that is the proof. If the lean code that is the proof compiles, its a verification of the proof. |
|
| |
| ▲ | aseipp an hour ago | parent | prev [-] | | In theorem proving environments like Lean, you are equipped with a standard set of axioms and statements (eg set theory). Most people, as far as I am aware, agree with Set Theory. From these basic fundamentals, you can build up all of mathematics, just like a normal mathematician can. The trick is that in systems like Lean, proofs are properly type checked, like a programming language; and just like a programming language, those types help stop bugs in the proofs, but the types here are far richer, able to encode all of mathematics, and far more strict. To prove a mathematical statement, you must write a proof that is accepted by the type checker. Beyond that, the core "language" itself is generally specified to be "sound" -- that is, there is a very small subset of Lean, a tiny "kernel language", that is shown to be incapable of proving False, and thus any proof which is well typed in said language (ie it typechecks) is also sound. In other words the system is designed, by construction, to only rely on a very small "trusted" set of axioms, code, and mathematical ideas. This is a very engineering-oriented design principle! Actually, a pretty significant amount of the theoretical research in theorem proving over the past 2 decades has been in "automating proofs", ie tools and methods of making those proofs as easy as possible to write. Entire book chapters have been written about how to replace a 20 line inductive proof in Rocq with a single line "function call" that can automatically discharge the proof for you, because the idea is that this "trusted kernel", the tiny and sound mathematical language, will reject invalid proofs by design. So "who cares" what the proof is, in a sense? In many ways simply writing the theorems and whatnot down requires you to understand the problem well enough already. So in a way LLMs are just taking this idea to the absolute limit. So all this means is that the difficulty really is in specifying the theorems. Which was kind of the whole problem all along! Except now you have a computer that can check your actual proof. You can write a theorem in Lean that isn't the theorem you want, and then write a type checked proof of it, but you still need the theorem to be accurate. Unless Claude is either 1) finding bugs in the Lean kernel to exploit them, 2) using 'sorry' (a very convenient tool in Lean used as a placeholder for proofs, but it can literally allow you to prove False), then it mostly comes down to: are all the theorems stated correctly? This is trickier than it sounds, of course, so some skepticism is certainly warranted in my opinion! There are also other various engineering principles applied to help try to reduce bugs and ensure correctness like any other engineering project, and there are various other "things" regarding dependently typed programming language design and the impact of those design decisions on proofs (and why they are notoriously hard to read and write), but they aren't germane to my point here. |
|
|
|
|
|
|
| ▲ | amelius 3 hours ago | parent | prev | next [-] |
| What if it was part of anthropic's training set? |
| |
|
| ▲ | lysace 3 hours ago | parent | prev | next [-] |
| "It is all human, with no AI" Also: It's 940 pages. Edit: Math gossip here: https://www.reddit.com/r/math/comments/1y1b6l8/hurried_annou... "Rooting for this, but can’t help but feel it’s just false proof #14,828, but the more promising one that came out recently, and that we’re clinging to it as the last hope before it turns out Anthropic got it." "Who is Alessandro Masullo? Only name that's popped up in a technical field is a data scientist who does not seem to have the background for a non-AI proof of GRH." "And we are supposed to believe that RH, a longstanding problem at the height of mathematics for a century, has just been solved by a 'mathematician' with no publication history or academic presence, without the help of new technologies, at the same time as a new technology credibly becomes capable of doing" "So this is from a guy who has never published anything in a journal before and left academia 8 years ago?" |
| |
| ▲ | robot_jesus 3 hours ago | parent | next [-] | | Whenever I, as someone who stopped at Calc 3 in college, read modern mathematics papers I realize how differently mathematicians brains must function than mine. This is not a value statement and nor am I demeaning either side. It's just... wow. (setting aside any dispute as to the veracity of this particular paper, the point still stands more broadly with tons of human-generated output) | | |
| ▲ | traes 38 minutes ago | parent [-] | | Any technical subject beyond a certain horizon of familiarity is pretty much impossible to understand. You're simply being overwhelmed with definitions. |
| |
| ▲ | auntienomen 2 hours ago | parent | prev | next [-] | | The thing is, Vakil says it was vetted by Brian Conrad, who is basically a human Lean engine. Masullo isn't a data scientist. He got a math PhD at Stanford and has been working there since, supported by soft money. So not a professor, but someone the grant holders thought was worth paying to do research. | |
| ▲ | rocho 3 hours ago | parent | prev | next [-] | | It's perfectly possible to write 940 pages manually over 12 years of work. Almost certainly many more due to drafts and failed attempts. Also, the Alpoge proof is GBs of Lean code which translate to 250k pages in the "human" version. | |
| ▲ | 3 hours ago | parent | prev | next [-] | | [deleted] | |
| ▲ | markasoftware 3 hours ago | parent | prev | next [-] | | I'm highly skeptical also, but OTOH extremely long human proofs have been a thing in the past, especially for important results like this. | | |
| ▲ | lysace 3 hours ago | parent [-] | | Published a number of hours after an AI-assisted proof has been published for a 150+ year old hypothesis? Doubt. | | |
| ▲ | somesortofthing 3 hours ago | parent | next [-] | | It's 940 pages long and presumably the process of producing it created many witnesses willing to vouch for its provenance as well as records of progress. Setting your math career on fire for a lie that obvious would be crazy. | |
| ▲ | zeraye 3 hours ago | parent | prev | next [-] | | > The hope was to bring Alessandro to Stanford for a year to polish the writing and then announce it after running it by enough people. Now it seems best to put out the current draft. We are not sure when this proof was drafted. It might have a few months or even more and it was rushed due to Alpöge announcement. | |
| ▲ | baruz 3 hours ago | parent | prev | next [-] | | They have had another person reviewing it for months and the author has been incorporating his feedback, according to TFL. If anything I believe the AMS would give Masullo priority if both pan out. | |
| ▲ | igregoryca 3 hours ago | parent | prev | next [-] | | It's a working draft, which they published hastily for obvious reasons. | |
| ▲ | adrian_b 3 hours ago | parent | prev | next [-] | | It is said that others have been reviewing that human-written proof for many months. Obviously, it was published immediately, despite the reviews not being finalized, when it became known that an AI-assisted proof was announced (but I understand that the complete AI proof has not been published yet). | |
| ▲ | dogecoinbase 3 hours ago | parent | prev [-] | | The arrow goes the other way, most likely (similarly to what happened with Navier-Stokes). |
|
| |
| ▲ | stronglikedan 3 hours ago | parent | prev | next [-] | | > It's 940 pages. Just ask ChatGPT to summarize it. | | |
| ▲ | jiggawatts 2 hours ago | parent [-] | | I did, and it claims to have found errors, but those errors may be possible to repair. These kinds of small issues are usually found and fixed when papers are reviewed formally prior to publishing. Given the era we live in now, if this version works too, expect a Lean formalization of it within days. |
| |
| ▲ | 6thbit 3 hours ago | parent | prev [-] | | 940 pages vs 15M lines of lean from the AI proof | | |
| ▲ | chorsestudios 2 hours ago | parent [-] | | Wiles' proof of Fermat's Last Theorem was 129 pages and lean proof was 13 million lines Interesting in this context because Alpöge has the lean proof but not the human readable variant while Alessandro Masullo proof has the human readable proof but not lean proof. This might support Alessandro's claim that it is not an AI proof, and it will be particularly exciting if they both solved the Reimann Hypothesis using different routes. |
|
|
|
| ▲ | 3 hours ago | parent | prev | next [-] |
| [deleted] |
|
| ▲ | diedyesterday 2 hours ago | parent | prev | next [-] |
| There are probably no "complete human, "human only" proofs of any hard problems anymore. More or less it's AI (at least assisted) even if unacknowledged. |
| |
|
| ▲ | swingboy 3 hours ago | parent | prev | next [-] |
| A real life Dwight vs. Dunder Mifflin Infinity scenario. |
| |
|
| ▲ | 6thbit 3 hours ago | parent | prev | next [-] |
| So with navier stokes, Apolge&Buckmaster were 'sniped' by openAI, and now Apolge+Claude is sniping Alessandro? How the turn tables |
|
| ▲ | igravious 3 hours ago | parent | prev | next [-] |
| Yup. Just quickly flicked through it. Looks fine to me. It's definitely mathematics. |
|
| ▲ | bananaflag 3 hours ago | parent | prev | next [-] |
| well, now that it is public, people can just put it into AI to check it. |
|
| ▲ | nimchimpsky 2 hours ago | parent | prev | next [-] |
| [dead] |
|
| ▲ | dtrejopizzo 2 hours ago | parent | prev [-] |
| [dead] |