Struct KateZaveruchaGoldberg 

pub struct KateZaveruchaGoldberg<F: IsPrimeField, P: IsPairing> { /* private fields */ }

Implementations

impl<F: IsPrimeField, P: IsPairing> KateZaveruchaGoldberg<F, P>

pub fn new(srs: StructuredReferenceString<P::G1Point, P::G2Point>) -> Self

Trait Implementations

impl<F: Clone + IsPrimeField, P: Clone + IsPairing> Clone for KateZaveruchaGoldberg<F, P>

where P::G1Point: Clone, P::G2Point: Clone,

fn clone(&self) -> KateZaveruchaGoldberg<F, P>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<const N: usize, F: IsPrimeField<RepresentativeType = UnsignedInteger<N>>, P: IsPairing> IsCommitmentScheme<F> for KateZaveruchaGoldberg<F, P>

fn commit(&self, p: &Polynomial<FieldElement<F>>) -> Self::Commitment

Given a polynomial and an SRS, creates a commitment to p(x), which corresponds to a G1 point The commitment is p(s) g1, evaluated as \sum_i c_i srs.powers_main_group[i], where c_i are the coefficients of the polynomial.

fn open( &self, x: &FieldElement<F>, y: &FieldElement<F>, p: &Polynomial<FieldElement<F>>, ) -> Self::Commitment

Creates an evaluation proof for the polynomial p at x equal to y. This is a commitment to the quotient polynomial q(t) = (p(t) - y)/(t - x) The commitment is simply q(s) g1, corresponding to a G1 point

fn verify( &self, x: &FieldElement<F>, y: &FieldElement<F>, p_commitment: &Self::Commitment, proof: &Self::Commitment, ) -> bool

Verifies the correct evaluation of a polynomial p by providing a commitment to p, the point x, the evaluation y (p(x) = y) and an evaluation proof (commitment to the quotient polynomial) Basically, we want to show that, at secret point s, p(s) - y = (s - x) q(s) It uses pairings to verify the above condition, e(cm(p) - yg1,g2)*(cm(q), sg2 - xg2)^-1 Returns true for valid evaluation

fn open_batch( &self, x: &FieldElement<F>, ys: &[FieldElement<F>], polynomials: &[Polynomial<FieldElement<F>>], upsilon: &FieldElement<F>, ) -> Self::Commitment

Creates an evaluation proof for several polynomials at a single point x. upsilon is used to perform the random linear combination, using Horner’s evaluation form

fn verify_batch( &self, x: &FieldElement<F>, ys: &[FieldElement<F>], p_commitments: &[Self::Commitment], proof: &Self::Commitment, upsilon: &FieldElement<F>, ) -> bool

Verifies an evaluation proof for the evaluation of a batch of polynomials at x, using upsilon to perform the random linear combination Outputs true if the evaluation is correct

type Commitment = <P as IsPairing>::G1Point