Module ark_poly_commit::ipa_pc
source · Expand description
A polynomial commitment scheme based on the hardness of the discrete logarithm problem in prime-order groups. The construction is detailed in [BCMS20].
Structs
- Commitment to a polynomial that optionally enforces a degree bound.
CommitterKey
is used to commit to, and create evaluation proofs for, a given polynomial.- A polynomial commitment scheme based on the hardness of the discrete logarithm problem in prime-order groups. The construction is described in detail in [BCMS20].
Proof
is an evaluation proof that is output byInnerProductArg::open
.Randomness
hides the polynomial inside a commitment and is outputted byInnerProductArg::commit
.SuccinctCheckPolynomial
is a succinctly-representated polynomial generated from thelog_d
random oracle challenges generated inopen
. It has the special property that can be evaluated inO(log_d)
time.UniversalParams
are the universal parameters for the inner product arg scheme.
Type Definitions
- Nothing to do to prepare this commitment (for now).
- Nothing to do to prepare this verifier key (for now).
VerifierKey
is used to check evaluation proofs for a given commitment.