The gist of the article is that it's worse.
That it's the equivalent of saying "It's full moon tonight because I wrote this program".
And he states that you have to check that:
1. The statement the author is making corresponds to the statement in the lean program.
2. The lean program actually compiles.
3. There is no shenanigans hidden in the lean program to disguise a trivial proof as the one stated.
4. The program does not exploit bugs in lean.
> 3. There is no shenanigans hidden in the lean program to disguise a trivial proof as the one stated.
To be clear, this is basically a case of bad defaults in Lean. As Buzzard says, the fix is literally one command.
> The one-line answer: `lake comparator`.
> the program does not exploit bugs in lean
Being fairly naive to Lean in general, this always seemed to me like a clear flaw of using Lean solutions as proof of hypotheses
That’s pretty much the same as compiling a program.
1. Yes.
2. Yes.
3. This is “you took 10 KLOC to do what 1 could have.”
4. Yes.
On the bright side, the article claims Lean has built-in tools to do 2-4 as long as you have enough RAM. In particular, there's a formally verified alternative implementation of Lean's checker that would theoretically rule out 4.
That implementation seems to be vibe-coded/vibe-proven in Lean itself (assuming the "con-leche" that my quick Google search turned up is the one he's talking about), so it's kind of turtles all the way down, but it does decrease the chance that a program could be exploiting both a Lean bug and a con-leche bug.