This module defines the read proof prover and verifier. Given a
query vector q, a vector of data d, and a commitment to this data
C, the prover will return an answer a and a proof that the answers
correspond to the data committed in C at the specified indexes in
the query.
This module defines the storage proof prover and verifier. Given a
set of commitments C_i and a challenge α the storage proof is just
an opening to the combined commitment ∑α^i C_i. Given that α is
computed by hashing some external challenge secret (e.g. derived
from a hash of a block), and from a hash of the commitments
itself, this in essense proves knowledge of the opening to all the
commitments C_i simultaneously. Given that α is computed by
hashing some external challenge secret (e.g. derived from a hash
of a block), and from a hash of the commitments itself, this in
essense proves knowledge of the opening to all the commitments C_i
simultaneously.