logoalt Hacker News

bertonvv • today at 4:56 PM • 4 replies • view on HN

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


Replies

sigbottle • today at 5:02 PM

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

3uruiueijjj • today at 5:52 PM

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.

thechao • today at 6:09 PM

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

Betelbuddy • today at 4:59 PM

Checkers all the way down?

➕ show 1 reply