logoalt Hacker News

rcr-anti • today at 4:40 PM • 5 replies • view on HN

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.


Replies

magicalhippo • today at 6:36 PM

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.

➕ show 1 reply
davidguetta • today at 5:54 PM

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

➕ show 1 reply
luke5441 • today at 5:43 PM

"This year" hints at them all being created this year. Does that mean they have all been created via LLM from the same corpus?

psychoslave • today at 5:59 PM

Even exploiting bugs would be interesting and constructive, as it would reveal some things to fix.

➕ show 1 reply
whimsicalism • today at 5:31 PM

is it still possible absent a flaw in the hardware model for con-leche?

➕ show 1 reply