Module ark_poly_commit::ipa_pc

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
  Commitment to a polynomial that optionally enforces a degree bound.
• CommitterKey
  CommitterKey is used to commit to, and create evaluation proofs for, a given polynomial.
• InnerProductArgPC
  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
  Proof is an evaluation proof that is output by InnerProductArg::open.
• Randomness
  Randomness hides the polynomial inside a commitment and is outputted by InnerProductArg::commit.
• SuccinctCheckPolynomial
  SuccinctCheckPolynomial is a succinctly-representated polynomial generated from the log_d random oracle challenges generated in open. It has the special property that can be evaluated in O(log_d) time.
• UniversalParams
  UniversalParams are the universal parameters for the inner product arg scheme.

Type Definitions

• PreparedCommitment
  Nothing to do to prepare this commitment (for now).
• PreparedVerifierKey
  Nothing to do to prepare this verifier key (for now).
• VerifierKey
  VerifierKey is used to check evaluation proofs for a given commitment.