News for hackers. Stuff that matters.
Re:Number theorist fears many proofs widely considered to be... by lidHanteyk on Sunday September 29, 2019 @12:50PM (#21108100)
Disregard cranks, acquire Metamath: http://us.metamath.org/downloads/metamath.pdf
Re:Number theorist fears many proofs widely considered to be... by drchewbacca on Sunday September 29, 2019 @01:35PM (#21108372)
Metamath is awesome if you're willing to slum it :)

https://jiggerwit.wordpress.com/2018/04/14/the-architecture-...

Re:Number theorist fears many proofs widely considered to be... by lidHanteyk on Sunday September 29, 2019 @01:42PM (#21108426)
How long does it take your preferred proof assistant to prove things? Metamath's standard set.mm takes only about 10s to prove everything.
Re:Number theorist fears many proofs widely considered to be... by digama0 on Sunday September 29, 2019 @08:24PM (#21110641)
Actually if you use the smm verifier that's been cut down to about 800ms. :) However, most of the theorem provers of today have been built on the philosophy that performance doesn't matter, or at least is secondary to ease of use, mathematical cleanliness etc, from the functional programming community. It turns out that once you make this decision it's difficult to get that raw speed back, even if you start worrying about performance later, and the HOL family provers make it worse by defining correctness in terms of the running of an ML program, which bakes the runtime of the ML system into the proof checking time.

When you combine this with the fact that these ML programs are not proofs but proof scripts, that perform a lot of "unnecessary" work like searching for a proof rather than just going straight for the answer, it suddenly begins to make sense why these systems take on the order of hours to days to check their whole libraries.

Coq and Lean are somewhere in the middle, because they have proof terms, but the logic itself still requires some unbounded computations. Checking a proof here is often fast, unless you make too much use of computation in the logic. But people often don't care about proof terms, and still store the proof scripts, which are as slow as ever.

Metamath is in this setting somewhat unique in eschewing proof scripts altogether, or more accurately, inlining proof scripts immediately on the author's machine. The resulting proofs are often comparatively long and verbose, but I would argue this is only a display matter, since all the other provers are doing the same thing, they just aren't showing it.

Re:Number theorist fears many proofs widely considered to be... by drchewbacca on Sunday September 29, 2019 @02:42PM (#21108824)
My preferred proof assistant is definitely Metamath, I think it just needs a big company to come along and build an awesome front end for it and it will become the standard.
Re:Number theorist fears many proofs widely considered to be... by breck on Sunday September 29, 2019 @01:33PM (#21108358)
Very interesting, thanks! This is definitely along the lines of what I’m thinking. It uses EBNF, i think if we switched it to tree notation it would be much, simpler, tighter, and more self contained.