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
[–] Eq0@literature.cafe 59 points 23 hours ago (3 children)

I am mad at this proof. Someone that did not understand what was going on (by his own public admission in his post) got a swarm of mechanical monkeys to try random things until they worked, and now we have an unreadable proof that the community needs to work to understand while getting no credit for doing the dirty and boring work

[–] snooggums@piefed.world 20 points 19 hours ago (1 children)

How do we know the proof is correct if nobody understands it?

Why should anyone spend the time verifying unreliable machine vomit?

[–] Eq0@literature.cafe 24 points 18 hours ago (1 children)

Because the proof as presented is a Lean program. Lean is a proof checking program, that means that this type of code runs only if the logic used is correct.

For example, you can write a proof of pythagora’s theorem and the code would run. But if you write a faulty proof (even if the final theorem is correct), the code doesn’t run.

About your second question, I agree with the sentiment, I will still answer the question unironically. Because if it’s in Lean it’s supposed to be reliable, and because we mathematicians are suckers for proofs, even obscure, poorly written stuff. We assume that a cool proof open the gate to new understanding of math.

[–] 14th_cylon@lemmy.zip 5 points 6 hours ago* (last edited 4 hours ago) (3 children)

Because the proof as presented is a Lean program. Lean is a proof checking program, that means that this type of code runs only if the logic used is correct.

and how do we know that the lean (i am hearing the word for the first time - this is not a sarcasm, but genuine question) is correct, in its design, lack of logical flaws and the implementation?

lot of the software where the exploit was found was considered reliable, because it worked on known and proven mathematical principle, until the exploit was found.

[–] jj4211@lemmy.world 5 points 5 hours ago

I'll just whip up a proof in lean to prove lean is correct

(I'm absolutely unqualified to have any opinion on any of this)

[–] napkin2020@sh.itjust.works 2 points 4 hours ago

The exported raw proof has been checked by several proof checkers, including Lean’s official kernel, the con-leche and con-ron checkers, and several independent checkers contributed by third parties and implemented in different programming languages. The checkers con-leche and con-ron come with a formal proof, relative to set theory, that they cannot accept a false proof, thus addressing concerns that Lean’s logic itself might have flaws that the proof could exploit. An extensive overview is available at https://math.mit.edu/~drew/grh/. These checks ran on an inert export of the proof, out of reach of hypothetical malicious code in the Lean proof sources.

Valid point, but we should be able to trust something at some point I guess.

disclaimer; I have no acting knowledge of anything here.

[–] solrize@lemmy.ml 7 points 20 hours ago

People are managing to make sense of the ideas in the proof. Example. Of course I don't understand that comment and I don't understand Wiles' proof of FLT. But, there are some theorems that I do understand, that are proved conditional on RH. So now I can say those theorems are proved unconditionally, and in principle could come up with such theorems of my own.

[–] finallymadeanaccount@lemmy.world 1 points 22 hours ago

Look, if I know anything about math, it's that you can take that proof and divide it by, uh ... something ... and, uh, you can work your way back to what the working out stuff was!