Struct ark_poly_commit::streaming_kzg::CommitterKey

pub struct CommitterKey<E: Pairing> { /* private fields */ }

The SRS for the polynomial commitment scheme for a max

The SRS consists of the max_degree powers of \(\tau\) in \(\GG_1\) plus the max_eval_degree powers over \(\GG_2\), where max_degree is the max polynomial degree to commit to, and max_eval_degree is the max number of different points to open simultaneously.

Implementations

impl<E: Pairing> CommitterKey<E>

pub fn new( max_degree: usize, max_eval_points: usize, rng: &mut impl RngCore ) -> Self

The setup algorithm for the commitment scheme.

Given a degree bound max_degree, an evaluation point bound max_eval_points, and a cryptographically-secure random number generator rng, construct the committer key.

pub fn max_eval_points(&self) -> usize

Return the bound on evaluation points.

pub fn commit(&self, polynomial: &[E::ScalarField]) -> Commitment<E>

Given a polynomial polynomial of degree less than max_degree, return a commitment to polynomial.

pub fn index_by(&self, indices: &[usize]) -> Self

Obtain a new preprocessed committer key defined by the indices indices.

pub fn batch_commit<J>(&self, polynomials: J) -> Vec<Commitment<E>>where J: IntoIterator, J::Item: Borrow<Vec<E::ScalarField>>,

Given an iterator over polynomials, expressed as vectors of coefficients, return a vector of commitmetns to all of them.

pub fn open( &self, polynomial: &[E::ScalarField], evalualtion_point: &E::ScalarField ) -> (E::ScalarField, EvaluationProof<E>)

Given a polynomial polynomial and an evaluation point evaluation_point, return the evaluation of polynomial in evaluation_point`, together with an evaluation proof.

pub fn open_multi_points( &self, polynomial: &[E::ScalarField], eval_points: &[E::ScalarField] ) -> EvaluationProof<E>

Evaluate a single polynomial at a set of points eval_points, and provide a single evaluation proof.

pub fn batch_open_multi_points( &self, polynomials: &[&Vec<E::ScalarField>], eval_points: &[E::ScalarField], eval_chal: &E::ScalarField ) -> EvaluationProof<E>

Evaluate a set of polynomials at a set of points eval_points, and provide a single batched evaluation proof. eval_chal is the random challenge for batching evaluation proofs across different polynomials.

Trait Implementations

impl<'a, E: Pairing> From<&'a CommitterKey<E>> for CommitterKeyStream<E, Reverse<&'a [E::G1Affine]>>

fn from(ck: &'a CommitterKey<E>) -> Self

Converts to this type from the input type.

impl<E: Pairing> From<&CommitterKey<E>> for VerifierKey<E>

fn from(ck: &CommitterKey<E>) -> VerifierKey<E>

Converts to this type from the input type.