Quote:
Originally Posted by SethTro
TODO is
1. Rename proof_k to proof_test or proof (it's not easy to manipulate large ints in mkfact)
2. Change output format from "X bits" to "X difficulty"
3. Run over large range of inputs and verify proof
4. Update verify script one more time.

These are all done now.
I ran ~50 exponents (5M to 250M) over several bitranges (5860, 6062, 6567, 7071) and verified ~458 proof statements (currently more than one can be generated per workitem).
Newest verification script is at
https://gist.github.com/sethtroisi/4...7007d55cdca7e5