upvote
This article is saying the same thing I said with more words. To someone who does not understand what formal verification is, this detail is unnecessary.

Lean certificates of this magnitude come with comparator. They are checked independently on different kernels to avoid kernel bugs.

See the zulip thread: https://leanprover.zulipchat.com/#narrow/channel/113488-gene...

This is exactly analogous to my code compiles (albeit with some extra flags on the compiler).

reply
I want to write a sorting predicate in Prolog (sorry, that's what I'm using now). I write it like this:

  sort(Xs, Ys) :-
      sort(Xs, Ys, [], Ys).
  
  sort([], [], Ys, Ys).
  sort([X|Xs], [_|Bound], Rs, Ys) :-
      sort(Xs, Bound, [X|Rs], Ys).
My code compiles. I try my predicate at the repl:

  110 ?- sort([2,3,1,5,6], Sorted).
  Sorted = [6, 5, 1, 3, 2].
What went wrong?
reply
This is a false equivalence, you seem to be missing the analogy.

There is no specification in your prolog example, in lean we explicitly check that the expression in lean is GRH (and this is about half a page of lean and has been checked by many many mathematicians), and then can arrive at a formal proof for that specification.

You are confusing the issue for people who don't understand what a formal proof means with this non-sequitur.

reply
in lean proof checking and type checking are exactly one and the same.
reply
In Lean, as in anything else, the program you write can do something else than what you think it does. "Your program" in Lean is a proof.
reply
That is incorrect.
reply