Struct ark_poly_commit::kzg10::KZG10

pub struct KZG10<E: PairingEngine, P: UVPolynomial<E::Fr>> { /* fields omitted */ }

KZG10 is an implementation of the polynomial commitment scheme of Kate, Zaverucha and Goldbgerg

Implementations

impl<E, P> KZG10<E, P> where
    E: PairingEngine,
    P: UVPolynomial<E::Fr, Point = E::Fr>,
    &'a P: Div<&'b P, Output = P>, 

pub fn setup<R: RngCore>(
    max_degree: usize,
    produce_g2_powers: bool,
    rng: &mut R
) -> Result<UniversalParams<E>, Error>

Constructs public parameters when given as input the maximum degree degree for the polynomial commitment scheme.

pub fn commit(
    powers: &Powers<'_, E>,
    polynomial: &P,
    hiding_bound: Option<usize>,
    rng: Option<&mut dyn RngCore>
) -> Result<(Commitment<E>, Randomness<E::Fr, P>), Error>

Outputs a commitment to polynomial.

pub fn compute_witness_polynomial(
    p: &P,
    point: P::Point,
    randomness: &Randomness<E::Fr, P>
) -> Result<(P, Option<P>), Error>

Compute witness polynomial.

The witness polynomial w(x) the quotient of the division (p(x) - p(z)) / (x - z) Observe that this quotient does not change with z because p(z) is the remainder term. We can therefore omit p(z) when computing the quotient.

pub fn check(
    vk: &VerifierKey<E>,
    comm: &Commitment<E>,
    point: E::Fr,
    value: E::Fr,
    proof: &Proof<E>
) -> Result<bool, Error>

Verifies that value is the evaluation at point of the polynomial committed inside comm.

pub fn batch_check<R: RngCore>(
    vk: &VerifierKey<E>,
    commitments: &[Commitment<E>],
    points: &[E::Fr],
    values: &[E::Fr],
    proofs: &[Proof<E>],
    rng: &mut R
) -> Result<bool, Error>

Check that each proof_i in proofs is a valid proof of evaluation for commitment_i at point_i.