Anthropic mathematician claims to prove Riemann hypothesis, most famous problem in all of math
(www.scientificamerican.com)
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.