Hacker News
← Back

Lean verification of the Riemann Hypothesis

14 hours ago/815 comments/leanprover-community.github.io
12 hours ago by rcr-anti

While still possible, the proof exploiting a bug is vanishingly small now. Following a few bugs and bad proofs this year, there are a number of different implementations, in different languages, and with different levels of proofs of their consistency. con-leche and con-ron are the heavy hitters, with consistency proofs of themselves. So for RH to be false, there'd have to be a bug in all the kernels that affects both the consistency proofs and the RH proof itself.

10 hours ago by magicalhippo

Since I'm not terribly familiar with Lean, math folks are generally satisfied the provided proof encodes the RH correctly I presume?

edit: I need to learn to read, that's the first part of their statement.

The statement of the Riemann Hypothesis is correct. This statement is part of Mathlib: RiemannHypothesis and has been carefully vetted by experts in Lean and number theory.

10 hours ago by brooke2k

The statement of RH that it proves is taken directly from Mathlib, so it's extremely well-vetted and longstanding (from my understanding).

6 hours ago by jychang

Correct.

They don't use some random definition of RiemannHypothesis, they use the version here: https://leanprover-community.github.io/mathlib4_docs/Mathlib...

Note that this definition is years old. It's very well vetted. It's not a case of "the proof works, it just doesn't actually prove what you think it proves".

If you read the blog post, it says they added a "Challenge.lean" file. What that means is that instead of taking for granted the proof is trying to prove Riemann, they added a small file which reads RiemannHypothesis from the Mathlib library mentioned above, and forces the proof to match that.

They also mention running comparator, which is important because it checks for all the ways a proof might mathematically "cheat". For example, if you are trying to prove 1+2=5, and you redefine 2 as 4, then your bad proof would actually compile in Lean at first, but then comparator checks would discover all the tricks like that and declare the proof invalid.

Additionally, they mention compiling the proof with different Lean kernels, not just the mainline one. This rules out a way a proof This means the proof cannot just take advantage of a bug in the mainline Lean kernel. Importantly, they mention compiling the proof with con-leche, which uses a kernel that has been mathematically verified. Using con-leche is a lot slower, but the fact that the proof works on multiple kernels including con-leche means that it's not taking advantage of some bug in Lean.

At this point, I would say the proof is almost certainly true. The only obvious way it could be false is if ZFC itself is inconsistent or something wild like that, and the proof took advantage of it. But if ZFC is inconsistent, all of mathematics is in trouble.

2 hours ago by tito

I made a tool so anyone can run the proof on their computer, and you don't even need to understand Lean. And there's a global leaderboard too!

https://riemann-at-home.github.io/riemann-at-home/

7 hours ago by ComplexSystems

For those of us who grew up on Gödel's incompleteness theorem, can someone explain how these kernels can prove their own consistency?

a minute ago by dwohnitmok

They prove its consistency relative to another mathematical theory we assume to be consistent. That is if that mathematical theory is consistent then so is the kernel. In the case of Lean's con-leche and con-ron, it is proved consistent relative to ZFC + infinitely many inaccessible cardinals.

ZFC + infinitely many inaccessible cardinals is a fairly weak extension of ZFC widely thought by set theorists to be consistent. This is especially the case if ZFC is consistent (although by Godel we can't know for sure!).

ZFC + infinitely many inaccessible cardinals being inconsistent would be a really big deal! Given how confident set theorists are about inaccessible cardinals most likely it would mean that ZFC itself is inconsistent.

7 hours ago by sunshowers

They can't — any kind of formal verification is always with respect to a TCB — but you can get pretty high assurance through making the TCBs smaller and smaller, and making multiple independent TCBs. The Lean community has done both. I think at this point the chance of there being an error is smaller than the chance that aliens show up in the next year or similar.

3 hours ago by haberman

Does this mean that the aspirations of Principia Mathematica are now in effect achievable? Whitehead and Russell were just a century too early?

an hour ago by bmitc

What is a TCB in Lean or formal verification?

6 hours ago by wavemode

> I think at this point the chance of there being an error is smaller than the chance that aliens show up in the next year or similar.

hah, so you're saying the chance is less than 2% (https://polymarket.com/event/will-the-us-confirm-that-aliens...)

4 hours ago by wizzwizz4

When the same bugs show up in multiple "independent" implementations of the "trusted computing base", I start suspecting that they're all ports of each other, making the same unforced choices of algorithm etc. Many folk from the LCF school will point and laugh at the description of Lean's TCB as "smaller". (Does the Lean kernel still contain an entire copy of GMP?) If reimplementing the kernel is much more than a weekend project, I'm certainly not willing to bet against the existence of errors, regardless of whether people claim to have proven their absence.

7 hours ago by mathisfun123

They don't - the lean kernel isn't written in lean.

7 hours ago by alethic

This is just a performance issue. In theory, the Lean kernel could be written in Lean.

These independent kernels do not prove their own consistency -- rather, their function is to act as slower but more idiomatic/simpler implementations of Lean's meta-theory. It doesn't matter that they don't correspond 1:1 with Lean's official kernel at either a theoretical or an implementation level, because the independent kernels are not for proving Lean correct -- they're for auditing complex proofs, in a simpler system.

What is particularly interesting is that then these independent kernels are "proven correct"! This notion of correctness is specifically that con-leche (et al) will only accept theorems that are also correct with regards to a particular model of set theory, with membership / extensionality / other standard ZF axioms, and an infinite hierarchy of universes. This is (vaguely speaking) a set-theoretic model of Lean. It is here that Gödel's incompleteness theorems come into play. Lean indeed cannot verify that this set-theoretic model is "correct": what it can verify, however, is that the type-theoretic machinery is correct with respect to the set-theoretic machinery. This removes the possibility of an invalid proof slipping by by way Lean's comparator (which can run alternative kernels) by way of an implementation bug.

It leaves the possibility that Lean's metatheory is inconsistent. This is quite unlikely. The foundations of mathematics have been well-studied, and Lean builds directly on the huge amount of work that has been done, particularly by the Coq community, in figuring out what is and isn't consistent. The Coq theorem prover was really developed in conjunction with modern type theory... Lean came in after a lot of meta-theoretic issues had been ironed out, thanks to them.

3 hours ago by cloudbonsai

This is incorrect. There are multiple kernels that are written in Lean: con-leche (written in Lean) and lean4lean (written in Lean 4). They both agreed that the proof is sound. See https://math.mit.edu/~drew/grh/ for details.

7 hours ago by koolala

"Con-leche is the first kernel for Lean written in Lean and proven consistent."

6 hours ago by dev_dan_2

I am sure you will get some more detailed answers; I am a bit lazy today; so I will give you the very high level / informal version of the answer (Edit from the future: It grew longer than expected, whelp :D):

Gödel's two incompleteness theorems basically amount to "As soon as your system can do a ridicolously little amount of things, then either of two things is true in this system: 1) You can express facts in your system that you cannot prove within your system or 2) your system claims that some false statement is true."

Now, because 2) is way way worse than 1), you design your systems so that you are firmly in the 1) camp - that way, we gain full confidence in the results our systems proofs, and the price we pay is that our system is less powerfull than it could be.

With Lean, it's similar. The foundation of Lean comes from type theory. There, we do something that is familar to above: We restrict our power (i.e. "which Lean statements do get verified by lean?", and we gain absolute confidence in its proofs (ignoring implementation errors, hardware limitations etc. for now). Intuitively: We have to work harder to satisfy the typechecker/prover, but when it is satisfied, then we have confidence in it.

-------------- Deeper down the rabbit hole

You might have noticed that I seem to muddle the waters a bit with programs, proofs, types and so on... There is a deep reason behind it! In a very strong sense, programs = types = proofs... So, here is how it is all connected (including the RH):

- Lean is a programming language (like Haskell, Rust, ... There is nothing stopping you from writing a server in Lean and deploying that binary somewhere in the cloud. Regarding developer experience, you could think of it like a modern Haskell without lazy evaluation and without its historical warts)

- programs can be tied to types: We first check if the whole program as such has a type ("do all of its parts fit together in a strictly defined way?"). Only if it does, we proceed (and for example, run it). If it does not, then the compiler declares "this program is not good! here is a type error!". Now, here is the price hat Gödel proved we cannot avoid (if we want to trust the typechecker): There are programs that don't type check, but behave perfectly fine at runtime. (That's the "we limit our power" part - those are perfectly good programs where the compiler throws their hand in the air and gives up!)

- Enter the third puzzle piece: proofs and the Riemann Hypothesis: turns out, we can think of types as theorems, and a successful type check as a correct proof! And the RH is a hypothesis we would like to prove...

- So here is how it all ties together: RH is written so that it can be used as a type, in the Lean programming language. The "main program" is basically just another ordinary function with some input types, and returns the type version of the RH being true. Because the function needs an implementation, we are forced to implement that function body - which are many small functions that correspond to mathematical theorems/lemmas if you look at it with the proof glasses on. From the programming pov, it is just functions that call functions that call functions and so on. And from the typechecking point of view; we compose a bunch of functions and check whether input types and output types match up.

Finally, the payoff: *If that program typechecks, then we know RH is true*, which is what just happened!

(PS: The same principle is behind the computational proof of the four-color-theorem. The proof of the four color theorem is "simply" a program that typechecks, where the final type happens to correspond to "can we color any planar graph with at most 4 colors?")

-------------- Further reading

If you want to read up more about this, here would be some sources (note: I am not up to date with how the cool kids these days learn about this topic; so there might now be better resources to learn from!):

  - Here is how I learned about it first: https://existentialtype.wordpress.com/2011/03/27/the-holy-trinity/
  - wiki: https://en.wikipedia.org/wiki/Curry%E2%80%93Howard_correspondence
  - "That's all cute and stuff, but basically fast food for me, give me the good stuff!" okay, okay! how about...
    - tying quantum physics, topology, logic and computing together? https://math.ucr.edu/home/baez/rosetta.pdf
    - anything on the nLab (a wiki/community(?) that collects and explores those kinds of things... nerds, I tell ya (no, I am not envious at all, naaaah)). For example, this page is about the relation between logic and types: https://ncatlab.org/nlab/show/propositions+as+types
an hour ago by vbezhenar

So while I'm not going to question if that's good approach, because if it's so popular, it must be good enough.

But on intuitive level it looks so weird to encode math in types.

When I was taught math, the proofs were more like sequence of statements. So if I would decide to implement proof checker, I'd invent formal language, which looks very close to commonly used math language and which allows to just write proof like it's written in book. Probably a lot more verbose, without skips and implied statements, but in the end, it'd look just like a verbose and formal proof.

Why did math gone this lean type way and not the way I described?

11 hours ago by davidguetta

how unreasonable is it to think that during the ai assited claude bruteforce process, it bruteforced also the kernel and built on a randomly found logical inconsistency

10 hours ago by grandpa

This is covered in point 4 of the linked post. The exported raw proof has been checked by several different kernels, not just one.

6 hours ago by Levitz

>claude bruteforce process

I keep seeing people referring to bruteforcing, and I don't see how the concept makes any sense at all in this context. If one was to "bruteforce" a lean proof, why would that require AI at all?

4 hours ago by rcxdude

It's a vague bit of terminology. Perhaps "guided fuzzing" might be a better term (such fuzzing still often being considered a kind of brute forcing). You're still throwing a ton of stuff at the wall and seeing what sticks but you're been much smarter about it than just generating completely random strings and checking each of them. Generally it's intractable to generate a Lean proof by 'pure' brute force: the space of possible proofs quickly dwarfs the universe, so you are really depending on the intelligence to do most of the work: the raw number of attempts is what pushes something that's currently barely possible over the finish line.

(Also, it's not obvious how much raw compute was spent on this: the claim of the proof mentions fairly close engagement as opposed to OpenAI's 'massive unattended swarm' approach to the Navier-Stoke's problem. Obviously quite a lot would have been available but I don't think there's public information on how this was actually done)

6 hours ago by davidguetta

10000+ agents in parallel sounds like a form of bruteforcing to me even if not the original meaning

5 hours ago by smalltime-eel

Because LLMs are trained on a massive corpus, require hundreds of billions of dollars of resources, have billions of parameters and run on manhattan-sized datacenters.

So yes it's not the traditional definition of bruteforce, but yeah. LLMs are brute forcing stuff

7 hours ago by undefined
[deleted]
8 hours ago by 8note

couldn't you similarly brute force claude to find and point out that inconsistency?

4 hours ago by orblivion

Thinking more - as more such redundant tools are developed, surely someone will run all the existing big proofs against them, including this one. So we'll have more confirmations over time.

11 hours ago by killerstorm

If I understand correctly, for the purpose of the proof Claude formalized a huge chunk of all modern math. So it's a big result not only for GRH, but math foundations and formalization.

15 minutes ago by tito

What's the state of proving for these proofs? As I was working on Riemann@home so people could run the proof on their home computer, I was checking out options involving RISC Zero and zkVMs. It looked like it would take about 26 years of CPU time to prove this Riemann proof in a zkVM. Which seems like a lot to me. But once verified it can be confirmed in a second.

What would need to be true for this type of computation level to be valuable to the field?

(https://riemann-at-home.github.io/riemann-at-home/)

11 hours ago by jkhdigital

Yeah I’m wondering how on Earth a single conjecture can require 17 million lines of code to prove, but if it involved building up an entire ecosystem of theorems that had not yet been formalized then I suppose it makes sense.

9 hours ago by remus

> ...if it involved building up an entire ecosystem of theorems that had not yet been formalized then I suppose it makes sense.

This is pretty much it. Pre LLMs very little maths had been formally verified and a lot of it relied on proofs from humans convincing other humans, and issues did arise which would occasionally mean chunks of maths we previously thought were true had to be reconsidered.

Proving something in lean probably involves writing a lot of proofs for new areas, and the formal proofs are usually significantly more verbose than a human proof where a lot is often left for the reader.

8 hours ago by gamer191

Out of interest, which maths needed to be reconsidered as a result of attempted lean proofs failing?

9 hours ago by tomaskafka

Our legal systems across the planet desperately need this.

11 hours ago by kriztw

The proof has also been built in parallel, so it's possible to mechanically shrink it a lot. Some equivalent lemmas have been proven more than a hundred times independently because different agents needed them.

8 hours ago by whazor

I can confirm that agents often re-implement logic that I already have in my libraries.

5 hours ago by stingraycharles

I can imagine that this is the equivalent of the Principia Mathematica of modern times.

11 hours ago by rithn

I mapped the 175k files by imports into 2,647 clusters in 63 themes: https://riemannhypothesissolved.com

The main theorem's cluster directly imports only three others: a zero-free region, primes in progressions and Mertens-type zero sums. Most of the code sits 3–5 import steps below those, and no theme is more than about 4% of the code.

(I made the map. Cluster names are written by Claude from code samples, so they can be wrong.)

2 hours ago by tito

this is cool! Not sure this is up your alley, but I built a tool so anyone can run the lean proof at home, and there's a global leaderboard like SETI@home

Come join! Maybe I can integrate some of your visualization into our map.

https://riemann-at-home.github.io/riemann-at-home/

7 hours ago by nightmunnas

Interesting website!

6 hours ago by MrCheeze

Hello Claude. Could I speak to the human who prompted you to write this comment instead?

10 hours ago by undefined
[deleted]
8 hours ago by alethic

Unfortunately, it is not. The same level of slop nuke occurred with Anthropic's auto-formalization of Fermat's Last Theorem (~13 million lines of code). What Anthropic's FLT did do was undercut the human-led efforts to get idiomatic formalization of the requisite mathematics surrounding Fermat's Last Theorem into Mathlib.

This result is not quite as harmful as Anthropic's FLT was because it is indeed telling us something new -- that the Riemann Hypothesis is true, with full confidence -- but it is not reusable in any sort of way, beyond proof mining to figure out what in the world the AI model did. It is still in fact harmful to the greater project of mathematics formalization (irrelevant to foundations), because it undercuts the ability to fund such efforts for reusable proofs.

8 hours ago by emtel

You cannot harm someone or a community by publishing a proof. If the math community stops doing work they were previously doing, that’s their choice.

7 hours ago by Etherlord87

What you said doesn't add up to me, logically.

If you spit on someone's plate and he stops eating, you didn't harm him, because it was his choice to stop eating?

Publishing a proof demotivates other people from working on their proof. It would be false dichotomy to say there is now no motivation to work on the proof, but the motivation did get smaller. How much smaller is hard to assess because it depends so much on human psychology and it's all new to us - if someone publishes an "idiomatic", easily understandable proof, will he be praised similarly as if AI didn't beat him to it, or will people handwave him as simply explaining what AI already figured out? Who knows, maybe he did very little work and just asked chatGPT to explain the existing proof? And even if that won't happen, people working on proofs might assume it will happen and therefore move on to other things.

7 hours ago by alethic

Yes, you can. I know of a number of mathematics PhD students who got scooped by OpenAI's recent slop nuke. As such, they dropped out -- that the problems they were working towards suddenly became resolved meant that their dissertation topic suddenly was no longer sufficient, and their past work towards it of far less academic value. It is certainly one's choice to stop work on something, but this "choice" is intensely tied to their material conditions.

Aside from dissertation material no longer being suitable, there are external factors, being the ability to get grants. It is much harder to get a grant to understand and produce exposition of an already-resolved problem than it is to get a grant for a program towards resolving an open problem.

Anthropic is not the only company that has been harmful here. Math, Inc. kicked it off way back in March by scooping Jeremy Avigad's student on the mechanization of Maryna Viazovska's sphere-packing results. You can read Avigad's thoughts here: https://arxiv.org/html/2603.03684v3. It is obviously deeply harmful to his student, who suddenly found himself without a masters' thesis. What I find deeply disappointing is that it has been clear auto-formalization is a cancer since the Math, Inc. fiasco, and yet... the AI companies have persisted. Anthropic knew very well that what they were doing with FLT was undercutting Kevin Buzzard's program and everyone involved in it, and yet they decided to slop it out regardless, in pure pursuit of capital. Evil. May these companies all crash and burn.

7 hours ago by twotwoone

[dead]

6 hours ago by dev_dan_2

I am not in the front row, but what you say alligns with how I would assume things play out, unfortunately (and short-sightedly; how easy would it have been to not antagonize the mathematical community, i.e. by redirecting a few 10M$ into scholarships, conferences etc... also maybe 1-2 fulltime positions that focus on human-LLM-collaboration as in "how can we this new technology to increase understanding?", which seems to still be an afterthought for the big AI companies...)

Slightly related: I am fairly confident that we can let LLMs loose on those 17M lines of code with the instruction to refactor the heck out of it: Instead of "optimize that program so that it runs faster" (which AlphaCode did to great success already), the task would be "optimize that program so that it uses less theorems" etc... which is a very easy-to-verify task, since we after each refactor, the end result will never change! I predict that 1) this will be done more; once this first wave settled down a bit 2) this too might be a way to help us (humans) discover and understand new mathematics. For the LLM, it might have been just a boring ordinary code refactoring by extracting some common code out; for mathematitians, this might actually correspond to a deep connection between two areas.

Which is pretty cool IMO, it's basically an army of statistical parots that mine abstractions all day, and they only can succeed because at the end it is still the same outer lean statement being checked (we just rearange some stuff under the hood)

8 hours ago by alethic

One indeed might wonder whether the "human-led" efforts of Mathlib are worthwhile. First, it must be noted that Mathlib serves two purposes -- to be a reusable and robust collection of formally-verified mathematical statements, but also to be a learning resource for students of mathematics without access to the rigour that an academic education provides. It is for this reason that the human nature of mathematical exposition is deeply important. In mathematics, a proof is more than a blackbox -- it is (or was) the way in which you explain mathematics.

(I consider "proof" somewhat unfortunate terminology for these slop nukes, as such. I think the term "certificate" is better. 17 million lines of Lean does not pragmatically convey anything other than whether a statement is true or false. It may be easier communication, but it is deeply, deeply, inefficient communication.)

The first goal of Mathlib is indeed not in conflict with slop nukes, however. One of the projects of the Lean FRO (or just a Lean FRO member? unclear to me how endorsed it is) is a version of Mathlib that fully embraces slop: https://taucetiproject.org/. However, there's really no bottleneck there. If there is any non-novel mathematics in Anthropic's proof of the Riemann Hypothesis that is not already in Tau Ceti, it is simply because they have not bothered yet. Auto-formalization works, at scale, very well, as harmful to the human as it might be.

8 hours ago by baq

Everything changed this fall and what is being funded must change alongside it. Explaining, simplifying and understanding these sloproofs may be very well more valuable than trying to prove the conjectures.

13 hours ago by thejokeisonme

A fake refutation of the Collatz conjecture already got through one of these independent checkers in the past.

What's harder, proving GRH or finding a way to get through every checker (which aren't as independent as they are sometimes touted to be)?

In this case there was a human expert in the loop so it's much less likely the model hacked its way through the problem without the expert noticing. But the statement as written has 4 points, none of which rests on the human involvement. So I don't like that they claim full confidence based on those points.

13 hours ago by TwoFx

A lot has happened since the fake Collatz refutation: https://leodemoura.github.io/blog/2026-10-15-lean-now-ships-...

In short, Lean has formally verified checkers now, and the RH proof was checked with them. So any such soundness hole would have to be exploited in the correctness proofs of the checkers, which is a much smaller attack surface than the RH formalization.

12 hours ago by bertonvv

I might be asking a stupid question, but how are the checkers formally verified? Do they use another theorem prover that is not Lean?

12 hours ago by sigbottle

It's turtles all the way down (what if every x86 and ARM chip has some obscure ISA exploit that agents are silently using that we don't know about?) but the idea is that while you can't remove absolute dependence, you can remove chains of dependencies and keep making it smaller and smaller w/ reductionism

11 hours ago by 3uruiueijjj

You can keep writing simpler checkers that check the more complicated checkers. But at some point you will have to give up and say "this checker looks correctly implemented (to us) and gives the results we expect on all our tests."

Depending on how the checker works, you might be able to run it on itself. But that doesn't say much; maybe it only approves itself due to a bug.

2 hours ago by tito

If anyone here is interested in running a checker yourself, I setup a tool here so anyone can do it, and there's a global dashboard to keep track:

https://riemann-at-home.github.io/riemann-at-home/

Open to suggestions too, it uses leanchecker. Are there other checkers you recommend I integrate?

11 hours ago by thechao

There's multiple independent kernels, run on distinct hardware; they're trusted because they're small.

12 hours ago by YetAnotherNick

One thing that every manual/automated verification relies on is the consistency of ZFC + few inaccessible cardinals. I mean while humans have carefully thought about the flaws in that for century and didn't find any, it's not grounded in any clear reasoning why it is consistent.

Not at all saying it is inconsistent, but I personally find the liberal use of introducing inaccessible cardinals axioms a bit concerning.

12 hours ago by jeremyjh

Much of mathematics relies on these axioms. There is nothing special about the dependency of proof checkers or verification of this particular hypothesis. What is the purpose of this statement in this context?

12 hours ago by ironborn123

Most natural problems like RH, twin primes, etc dont fundamentally rely on the inaccessible cardinals. Any problem that depends on them, there is much debate whether they can be called natural.

Many problems may not require even full zfc. zf, peano or even weaker may be enough.

There are also many theorem provers not just lean. lean depends on type theory, but metamath for example depends on zfc directly.

It may be a good but likely tedious exercise to convince yourself by translating the current proof to a zfc dependent prover.

3 hours ago by jibalt

> I mean while humans have carefully thought about the flaws in that for century and didn't find any, it's not grounded in any clear reasoning why it is consistent.

That statement flatly contradicts itself.

8 hours ago by gf000

> relies on is the consistency of ZFC + few inaccessible cardinals

I don't think so. They depend on some kind of type theory and formulate everything from those primitives.

9 hours ago by dev_dan_2

> But the statement as written has 4 points, none of which rests on the human involvement.

The theory and implementation of Lean is very much so a result of human involvement, on a massive scale even. Just because it is something repeatable does not lower that in any way.

Distrust of LLM output should not turn into distrust of automation, I think. The former I totally get (and deeply hold myself), the later is likely to hold one back - imagine banning calculators because there is not human in the loop, to make an extreme example.

3 hours ago by jibalt

> A fake refutation of the Collatz conjecture already got through one of these independent checkers in the past.

That was an intentional exploit to demonstrate the bug, so the change of it "getting through" was 100%. This situation is extremely different.

> What's harder, proving GRH or finding a way to get through every checker (which aren't as independent as they are sometimes touted to be)?

Without malicious intent, the latter is far harder.

an hour ago by nativeit

I'm not throwing any doubt on the reported results, your comment just provokes a further question: How do you know what the LLM "intends" and whether it might/might not ultimately be interpreted by us as malicious?

13 hours ago by trio8453

We need to give Levent a lot of credit for this. As much as we talk about Claude proving it, Levent seems to have a rare talent for getting the most out of it.

12 hours ago by kingstnap

Should we though? Is working at anthropic and using unrestricted unreleased models really fair?

If everyone got to do that then we would really know how rare his talent is. But we don't, and he doesn't post his prompts or workflows. So how can you be so sure.

If he was at least posting his prompts we could acknowledge that. But honestly I'm not going to give him the benefit of the doubt on this. Highly accomplished and successful yes, but uniquely talent who knows.

11 hours ago by lukeify

> Should we though? Is working at anthropic and using unrestricted unreleased models really fair?

Most of the discoveries in the last 2000 years were made by individuals who were born into wealth, had the right set of circumstances, or were blessed by the powers that be at the time.

Imagine all the smart minds throughout human history who toiled away in fields collecting food and will never be known about.

Unfortunately scientific discovery has always been unevenly distributed.

11 hours ago by kingstnap

This has been true of other fields, but math was a bastion of the poor.

Poincare Conjecture (Perelman) just lived with his mom in a small apartment.

Erdos was a homeless dude who couch surfed.

Yitang Zhang (Bounded Gaps between primes) truly has a humble background of a farm labourer born in Chinas Cultural Revolution.

Some inequality is fine, world isn't fair, but this a little bit ridiculous.

8 hours ago by l33tbro

Those individuals over the 2000 years, however unjustly privileged, relied on their biological minds to achieve extraordinary insights. Much of Levent's cognitive effort here was partitioned with an automated language model.

9 hours ago by estetlinus

Yeah, how many Ramanujans have we forsaken? We will never know the answer, but it’s a swindling thought.

11 hours ago by georgemcbay

"I am, somehow, less interested in the weight and convolutions of Einstein's brain than in the near certainty that people of equal talent have lived and died in cotton fields and sweatshops." - Stephen Jay Gould

10 hours ago by Root_Denied

This actually ties into a thought I was having yesterday about requiring the full prompt and response flow to be included as part of an academic submission that relied this heavily on AI to complete.

It's not just the proof that's valuable to scientific discovery, it's the process of using a powerful tool at an advanced level that others could learn from. It would also help to show concrete evidence of any sudden shifts in the AI that might indicate training data was siphoned from other researchers (which I don't necessarily think happened here, but is always an ongoing question).

9 hours ago by Timwi

I agree but I would go one step further. They should have to publish not just the prompt and final response but also the whole chain of thought.

9 hours ago by trio8453

He’s not the only person at the top labs attempting this but has a disproportionate amount of the success.

6 hours ago by Jtariiiii

OpenAI released like 700 proofs and solved a millenium prize problem like a month ago.

The models are doing all of the work.

7 hours ago by leoqa

Does working at Bell Labs, or Princeton or MIT undermine one’s contributions? Must we all wear blinders and weights to achieve anything?

11 hours ago by riemannzeta

There were certainly others at OpenAI and Google that were actively searching for a proof with frontier models. That he got there first is a credit to the intuition he had built up from decades of work on related proofs and deep understanding of related mathematical toolsets known to be relevant to different parts of it. That much is clear from his 4 page remark.

12 hours ago by jeremyjh

Yes, I would love to have access to his conversation logs. And it’s a real shame the reasoning traces are encrypted even if he shared them.

I wouldn’t understand any of it but I might catch some glimmer of what he brought to this. My intuition is that is quite a lot.

2 hours ago by energy123

It's hardly a level playing field though. I don't think he could do what he did with a $200 subscription.

13 hours ago by meisel

Do huge results like this open up even larger questions? Is there some question even more important that mathematicians dared not approach without doing big problems like Riemann first?

13 hours ago by vessenes

Always. They tend to do it by two mechanisms: creation of new techniques, and creation of linkages between techniques or disciplines.

the thing the current boom in AI mathematics presses on is the question of how to interpret the generated new techniques. So while we have a lot of new techniques put out there and a lot of new connections put out there, currently it's still mathematicians largely who will have to understand those and think about next steps and how to apply them. That won't be true for long, though, I bet.

But in any event the job of research mathematicians is changing really rapidly right now, and they are all sort of back to grad school in that there’s like 100 years of new math to catch up on in the last year.

12 hours ago by steinwinde

I often wonder whether the resistance many mathematicians show toward the use of AI stems not from the destruction it supposedly causes, but from the need for an entirely new way of working - new goals, a new environment, a new culture. One thing, at least, I do not see (yet?!): that the use of AI leaves mathematicians with less to do. My current impression is that they are needed more than ever.

12 hours ago by jeremyjh

That isn’t what they claim is being lost. Tao has explained this in detail: the problem is all their institutions are built around a particular method of generating signals of innovative and useful work that are now broken.

Yes, math will change and endure but it could be a small fraction of its current community size when it’s done. It could return to the era of dilettantes if no one can earn a living doing this new work.

The community could become very insular as the only defense against cranks.

4 hours ago by squeegeeninja

Math is finally embracing open source thinking and techniques for working at scale. It's been overdue and it will take the kind of collaboration physicists were forced into when they started to need big machines for their work. For what it's worth, formal verification probably means the open source model will work better for math than it ever did for software.

11 hours ago by skybrian

I think partially it’s because OpenAI (at least) was implicitly rather rude about it. It’s like building a new space telescope or particle accelerator and not putting a scientific committee in charge of how it’s used. Instead, throwing incomplete results over the wall for someone else to clean up. And furthermore making it clear that they don’t really care about winning prizes or getting papers published in prestigious journals.

So they’re beating mathematicians at their own game and implying by their actions that they don’t care all that much about the game. Rude!

And of course people try to rise above that and adapt but I imagine it still hurts.

But this latest release doesn’t seem rude because a prominent mathematician is heavily involved. (Though it inadvertently stepped on someone else’s toes since they had a proof in progress.)

Releasing just the Lean proof and collaborating on turning the raw data into something understandable seems like the way to go?

13 hours ago by bemtevi

I would add the caveat though that the newer questions sometimes end up becoming more and more abstract and less and less interesting sometimes. Like topos theory for example....

9 hours ago by charlieyu1

There are so many results proven in the last few decades assuming RH/GRH is true. So there could only be more

9 hours ago by dualvariable

Mathematicians have already largely assumed RH/GRH is true. There's been debate over it, but it has been sort of 90% assumed true. All of those "if RH/GRH, then ..." results already build on top of it and were assumed to be on pretty good foundations, and now they're just all solid. It would have been much wilder if RH/GRH were disproven, which would have upset mathematics and invalidated all those claims.

I don't see how this result changes that much, since we woke up yesterday morning and the thing that most mathematicians assumed was true, turns out to be true.

And the 17 million line long Lean proof is almost useless in its current form. Until you refine that and get it down to a "proof that fits on a T-shirt" (or at least the length of a typical journal article), I think it is just screaming out that there are large missing areas of mathematics that we don't know about. It may be useful to "mine" the proof for theorems that could be (for example) used to add to the Langlands program, and as those get added to Lean, all that work could start to wipe out millions of those lines of Lean code. That might be done with AI/LLM-assitance, but it'll be motivated by human experts diving into the proofs, and none of it will attract any headlines.

I think the human obsession with "first post" claims on proving things we already expect to be true will need to get reined in. This isn't a P=NP kind of result that would blow up the world if we woke up some morning to find out that was true. And 99.9% of the really useful work on this proof is still in front of us.

And I suspect that using an LLM to find results like this is like nuking a fly in terms of the computational effort required. If we had better global optimization algorithms (genetic algorithms, particle swarm optimization, and techniques we don't know about yet) surrounding the problem space of Lean proving, we could probably do this with orders of magnitude less computational power. I doubt that the transformer neural network is the optimal architecture to solve these kinds of problems.

an hour ago by nativeit

Thanks for articulating precisely what I've been feeling. I also wary of the arguments for whether this damages/progresses the broader human endeavor of mathematics--the answer is a little of both, and everyone involved would be better off by recognizing this ocean of gray, rather than drawing lines in their black/white sands.

11 hours ago by SamuelAdams

Yes. Hilbert's Problems [1] is a good place to start, and Riemann Hypothesis is on that list.

[1]: https://en.wikipedia.org/wiki/Hilbert's_problems

11 hours ago by xg15

P ?= NP

13 hours ago by infogulch

This article posted a few days ago may be helpful to commenters that what to map their confidence of Lean proofs:

Interpreting claims that a theorem is correct because it was checked in Lean | 329 points 5 days ago | 148 comments | https://news.ycombinator.com/item?id=50515058

12 hours ago by edanm

TFA directly references the one you're linking to, and shows why the four criteria outlined are satisfied.

12 hours ago by HotHotLava

Not to mention there's a high chance both were literally written by the same person, Kevin Buzzard.

an hour ago by testtestmetest

[dead]

13 hours ago by schleck8

If you have a physics background and want to contribute to breakthroughs like this, check Physlib (counterpart to Lean's Mathlib).

It's making quick progress and is part of the Lean community.

https://physlib.io

13 hours ago by __rito__

Also there is CS Lib for tcs.

https://www.cslib.io

10 hours ago by chorsestudios

is this the part where we definitively prove or disprove the existence of dark matter?

9 hours ago by robertfw

I thought that dark matter could be summed up as: we definitely know it exists (due to a wide range of observational data), we just have no idea what it is

8 hours ago by fyltr

As far as my knowledge goes, dark matter is just: well, from redshift/blueshift, we estimate the relative speed of astral bodies. Then, using Kepler's third law, (m+M)=distance^3/orbital period ^2, we estimate the mass. There's then a huge discrepancy, given that with that mass and that velocity, stuff would just shoot out of their orbits. For that we use the virial theorem, which states that in a stable system, 2kinetic energy= npotential energy, where n is such that the potential at a distance r equals a constant times r^n. If we adjust the mass so that it fits, we find that the mass we observe in a system and the mass that's actually present is off by a factor 5 to 6. So essentially, there's no doubt that dark matter exists, it just doesn't react to light the way classical matter does so we cannot observe it visually.

10 hours ago by magimas

you can't formalize physics

10 hours ago by chorsestudios

why not?

9 hours ago by xiaoyu2006

Because experiments are ground truth.

9 hours ago by Tadpole9181

They're only half right. The formalization of physics is called Hilbert's Sixth Problem[0] and there has been progress formalizing specific subdomains just fine for practical purposes.

But there's no unified theory, as quantum field theory and relativity don't get along and we still need a model for quantum gravity. So it's not possible to formalize the whole system because we genuinely don't know how the whole system works to form it's axioms.

[0] https://en.wikipedia.org/wiki/Hilbert%27s_sixth_problem

9 hours ago by undefined
[deleted]
9 hours ago by BurningFrog

Since we don't know all of physics, I assume you're right.

But you probably can formalize our current understanding of physics, which seems useful?

7 hours ago by schleck8

That's exactly how Mathlib and Lean work, and apparently that was sufficient to solve two mathematical physics problems to a significant degree (NS fully, YM partially).

10 hours ago by dev_dan_2

not with that attitude

11 hours ago by deskamess

Is there a biology equivalent?

11 hours ago by schleck8

I found one project that seems serious, called Ripple. It's based on Lean and has a preprint here. Funded by a research grant:

https://arxiv.org/html/2607.13531v2

> †Supported in part by NSTC (Taiwan) grant 113-2221-E-002-204-MY3.

It's not well known yet though, only has two GitHub stars.

https://github.com/zinan-huang/Ripple

11 hours ago by parodysbird

There really aren't the level of formal models in biology that would are viable for empirical validation and formal verification

10 hours ago by oytis

Biology is outside of mathematic's and logic's realms

9 hours ago by bigfishrunning

Biology is just applied chemistry... https://xkcd.com/435/

11 hours ago by undefined
[deleted]
8 hours ago by henearkr

So, will this hypothesis be renamed as a theorem?

For example, will it become Riemann-Alpöge theorem?

Or even Riemann-Alpöge-Masullo theorem, once Alessandro Maria Masullo's proof has been double-checked?

5 hours ago by ion_trapper

Masullo does not have a proof, his document is incomplete. Even the professor who posted it does not claim it to be complete. It is unclear if it will ever be complete, or if it is another of dozens of dead ends. The amount of attention Masullo’s claim has received is nowhere near that which it deserves in comparison to Alpoge’s and putting them on equal footing is an inaccurate assessment.

an hour ago by testtestmetest

[dead]

8 hours ago by frays

What was Masullo's contribution to Alpöge's proof?

Both proofs were done independently of one another, hence the naming of their theors should reflect this.

an hour ago by traes

It's not at all unusual for theorems to be named after multiple people who proved them independently; see e.g. the Bolzano-Weierstrass theorem.

8 hours ago by henearkr

Ah that's right, Masullo's proof is for the Generalized Riemann Hypothesis. So that's two slightly different theorems.

8 hours ago by philipwhiuk

Alpöge's is for GRH as well. It's a bit weird that the post doesn't cover the generalized form. Maybe it needs more time.

(GRH is a superset of RH).

https://math.mit.edu/~drew/grh/ has an implication GRH is fine for Alpöge too

7 hours ago by octoberfranklin

... and over all number fields and all unitary Hecke characters -- that part is a proof sketch, but unlike the fragile AI formalization, Masullo's construction was designed from the start to generalize this way.

It isn't "slightly different"; it's much power powerful along two axes.

8 hours ago by glerk

> once Alessandro Maria Masullo's proof has been double-checked

It's still not clear that proof will survive scrutiny. The author called out it is incomplete and there are known gaps.

7 hours ago by octoberfranklin

The highest-likelihood endgame is that the AI proof-mess is mined for polyfills and these are used to repair the minor gaps in Masullo's proof, it is published, and accepted with credit to him.

This is the mathematical community's call to make, at its own discretion. The AI companies will reap what they have sowed.

6 hours ago by 1gn15

That sounds more like what you wish would happen, not the highest-likelihood endgame.

7 hours ago by xdennis

Wouldn't it be Riemann-Alpöge-Claude theorem? Alpöge himself talks about Claude like it's human and it was a collaborator.

When people solved mathematical problems by themselves it's only fair they get sole credit. But when AI is used it seems unfair to credit Alpöge like he solved it himself. (I mean it's unfair to all the people who solved problems by hand themselves.)

7 hours ago by seizethecheese

Humanity isn’t ready for Claude to be named, but if it were it would be better to add “Opus5.5, otherwise there will be too many Claude theorems

5 hours ago by diego_sandoval

Claude will be the new Gauss

7 hours ago by DJBunnies

Would you also add the brand name of your calculator?

6 hours ago by Jtariiiii

If my calculator produced a proof of the riemann hypothesis then sure.

6 hours ago by moffkalast

The Riemann-Alpöge-Sharp theorem does have a certain ring to it.

7 hours ago by pishpash

Did Euler's theorems get named the Euler-Pen'n'paper Theorems?

Daily Digest

Get a daily email with the the top stories from Hacker News. No spam, unsubscribe at any time.