A main reason for which the SNARK circuits for PoSt are large (as previously discussed during the audit), is that we are not optimizing for reducing public inputs.
There are two optimizations:
- Better bit-packing for the challenges
- Build a merkle tree for the sectors in a partition (this will increase the number of constraints)
This change drastically reduce the number of inputs and it would make VerifyPoSt much faster