Prover using storage

Can go up to large values of n without running out of memory. Using an optimal binary file for dag storage.
Still lots of room for optimization of i/o