this post was submitted on 20 Nov 2026
68 points (80.4% liked)

science

30028 readers
602 users here now

A community to post scientific articles, news, and civil discussion.

dart board;; science bs

rule #1: be kind

lemmy.world rules

founded 3 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
[–] QuantumEraser@fedia.io 16 points 1 day ago (4 children)

What's more likely, that the Riemann hypothesis was proven, or that there's some bug in the Lean prover they used that this 1.3GB of code manages to run into? I'm placing my bets on the latter...

[–] pageflight@piefed.social 17 points 23 hours ago (1 children)

If a coding agent produced 1.3GB of code and claimed it solved my problem, it would sure have bugs.

[–] someacnt_@lemmy.world 0 points 17 hours ago

More so as Lean itself has logical issue, as many formal logic people say.

[–] solrize@lemmy.ml 6 points 20 hours ago (1 children)

The proof is probably valid but as other people have mentioned, it's being run through a bunch of different Lean implementations to make sure.

Lean is more of a proof checker than a proof finder. Checking proofs is much easier than finding them, so people generally aren't too worried about Lean. An Anthropic AI model found this RH proof and it's checked out according to at least one Lean installation so far, but they're repeating the checks as extra precaution.

The details of the proof aren't very comprehensible to humans right now, but the overall strategy apparently has been examined and makes sense.

[–] HubertManne@piefed.social 2 points 19 hours ago (1 children)

I just assumed it was using proofs already 90% there honestly. These things have been worked on and written about for awhile.

[–] solrize@lemmy.ml 2 points 13 hours ago (1 children)

I don't think so, unless you mean the "quasi-RH" proved by OpenAI a few weeks ago. Other than that, RH hasn't seen serious progress anytime recently. Just some small increments here and there.

[–] HubertManne@piefed.social 1 points 8 hours ago

Nah I mean that thousands of papers have been done over the years. I mean finding these conjectures are the initial big thing and then work is done on solving it. One thing computers are good at is going through a lot of material. A PhD math student maybe reads over 100 papers as they work on their own solution.

[–] red_tomato@lemmy.world 5 points 1 day ago (1 children)

There are multiple kernel implementations of Lean. The proof will likely be checked against every kernel implementation available. It’s unlikely that it’s exploiting soundness bugs in all kernels at the same time.

[–] solrize@lemmy.ml 0 points 20 hours ago* (last edited 20 hours ago)

I wonder if the Lean proof could somehow be automatically morphed into a Rocq or HOL proof and checked by those. (Rocq and HOL are proof checking systems unrelated to Lean, but with the same general idea).

Interestingly, one of HOL's software self-tests involves a large cardinal hypothesis. Explaining what that means would be a bit messy, but if you already understand it, it's sort of a lolwut moment.

[–] Eq0@literature.cafe 5 points 1 day ago* (last edited 1 day ago)

The Lean experts are running the Lean code in different Lean kernel versions to avoid this problem. Some of the kernel versions are verified themselves - if I remember correctly by earlier proof checkers.

If they succeed in running it, it’s as trustworthy as humanly checkeable