Struct ark_poly_commit::marlin::marlin_pc::MarlinKZG10

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

Polynomial commitment based on [KZG10], with degree enforcement, batching, and (optional) hiding property taken from [CHMMVW20, “Marlin”].

Degree bound enforcement requires that (at least one of) the points at which a committed polynomial is evaluated are from a distribution that is random conditioned on the polynomial. This is because degree bound enforcement relies on checking a polynomial identity at this point. More formally, the points must be sampled from an admissible query sampler, as detailed in [CHMMVW20].

Trait Implementations

impl<E, P> PolynomialCommitment<<E as PairingEngine>::Fr, P> for MarlinKZG10<E, P> where
    E: PairingEngine,
    P: UVPolynomial<E::Fr, Point = E::Fr>,
    &'a P: Div<&'b P, Output = P>, 

fn setup<R: RngCore>(
    max_degree: usize,
    _num_vars: Option<usize>,
    rng: &mut R
) -> Result<Self::UniversalParams, Self::Error>

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

fn commit<'a>(
    ck: &Self::CommitterKey,
    polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<E::Fr, P>>,
    rng: Option<&mut dyn RngCore>
) -> Result<(Vec<LabeledCommitment<Self::Commitment>>, Vec<Self::Randomness>), Self::Error> where
    P: 'a, 

Outputs a commitment to polynomial.

fn open_individual_opening_challenges<'a>(
    ck: &Self::CommitterKey,
    labeled_polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<E::Fr, P>>,
    _commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
    point: &'a P::Point,
    opening_challenges: &dyn Fn(u64) -> E::Fr,
    rands: impl IntoIterator<Item = &'a Self::Randomness>,
    _rng: Option<&mut dyn RngCore>
) -> Result<Self::Proof, Self::Error> where
    P: 'a,
    Self::Randomness: 'a,
    Self::Commitment: 'a, 

On input a polynomial p and a point point, outputs a proof for the same.

fn check_individual_opening_challenges<'a>(
    vk: &Self::VerifierKey,
    commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
    point: &'a P::Point,
    values: impl IntoIterator<Item = E::Fr>,
    proof: &Self::Proof,
    opening_challenges: &dyn Fn(u64) -> E::Fr,
    _rng: Option<&mut dyn RngCore>
) -> Result<bool, Self::Error> where
    Self::Commitment: 'a, 

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

fn check_combinations_individual_opening_challenges<'a, R: RngCore>(
    vk: &Self::VerifierKey,
    lc_s: impl IntoIterator<Item = &'a LinearCombination<E::Fr>>,
    commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
    query_set: &QuerySet<P::Point>,
    evaluations: &Evaluations<E::Fr, P::Point>,
    proof: &BatchLCProof<E::Fr, P, Self>,
    opening_challenges: &dyn Fn(u64) -> E::Fr,
    rng: &mut R
) -> Result<bool, Self::Error> where
    Self::Commitment: 'a, 

Checks that values are the true evaluations at query_set of the polynomials committed in labeled_commitments.

fn batch_open_individual_opening_challenges<'a>(
    ck: &CommitterKey<E>,
    labeled_polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<E::Fr, P>>,
    commitments: impl IntoIterator<Item = &'a LabeledCommitment<Commitment<E>>>,
    query_set: &QuerySet<P::Point>,
    opening_challenges: &dyn Fn(u64) -> E::Fr,
    rands: impl IntoIterator<Item = &'a Self::Randomness>,
    rng: Option<&mut dyn RngCore>
) -> Result<Vec<Proof<E>>, Error> where
    P: 'a,
    Self::Randomness: 'a,
    Self::Commitment: 'a, 

On input a list of labeled polynomials and a query set, open outputs a proof of evaluation of the polynomials at the points in the query set.

type UniversalParams = UniversalParams<E>

The universal parameters for the commitment scheme. These are “trimmed” down to Self::CommitterKey and Self::VerifierKey by Self::trim.

type CommitterKey = CommitterKey<E>

The committer key for the scheme; used to commit to a polynomial and then open the commitment to produce an evaluation proof.

type VerifierKey = VerifierKey<E>

The verifier key for the scheme; used to check an evaluation proof.

type PreparedVerifierKey = PreparedVerifierKey<E>

The prepared verifier key for the scheme; used to check an evaluation proof.

type Commitment = Commitment<E>

The commitment to a polynomial.

type PreparedCommitment = PreparedCommitment<E>

The prepared commitment to a polynomial.

type Randomness = Randomness<E::Fr, P>

The commitment randomness.

type Proof = Proof<E>

The evaluation proof for a single point.

type BatchProof = Vec<Self::Proof>

The evaluation proof for a query set.

type Error = Error

The error type for the scheme.

fn trim(
    pp: &Self::UniversalParams,
    supported_degree: usize,
    supported_hiding_bound: usize,
    enforced_degree_bounds: Option<&[usize]>
) -> Result<(Self::CommitterKey, Self::VerifierKey), Self::Error>

Specializes the public parameters for polynomials up to the given supported_degree and for enforcing degree bounds in the range 1..=supported_degree.

fn batch_check_individual_opening_challenges<'a, R: RngCore>(
    vk: &Self::VerifierKey,
    commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
    query_set: &QuerySet<P::Point>,
    values: &Evaluations<E::Fr, P::Point>,
    proof: &Self::BatchProof,
    opening_challenges: &dyn Fn(u64) -> E::Fr,
    rng: &mut R
) -> Result<bool, Self::Error> where
    Self::Commitment: 'a, 

batch_check but with individual challenges

fn open_combinations_individual_opening_challenges<'a>(
    ck: &Self::CommitterKey,
    lc_s: impl IntoIterator<Item = &'a LinearCombination<E::Fr>>,
    polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<E::Fr, P>>,
    commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
    query_set: &QuerySet<P::Point>,
    opening_challenges: &dyn Fn(u64) -> E::Fr,
    rands: impl IntoIterator<Item = &'a Self::Randomness>,
    rng: Option<&mut dyn RngCore>
) -> Result<BatchLCProof<E::Fr, P, Self>, Self::Error> where
    P: 'a,
    Self::Randomness: 'a,
    Self::Commitment: 'a, 

open_combinations but with individual challenges

fn open<'a>(
    ck: &Self::CommitterKey,
    labeled_polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<F, P>>,
    commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
    point: &'a P::Point,
    opening_challenge: F,
    rands: impl IntoIterator<Item = &'a Self::Randomness>,
    rng: Option<&mut dyn RngCore>
) -> Result<Self::Proof, Self::Error> where
    P: 'a,
    Self::Randomness: 'a,
    Self::Commitment: 'a, 

On input a list of labeled polynomials and a query point, open outputs a proof of evaluation of the polynomials at the query point.

fn batch_open<'a>(
    ck: &Self::CommitterKey,
    labeled_polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<F, P>>,
    commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
    query_set: &QuerySet<P::Point>,
    opening_challenge: F,
    rands: impl IntoIterator<Item = &'a Self::Randomness>,
    rng: Option<&mut dyn RngCore>
) -> Result<Self::BatchProof, Self::Error> where
    Self::Randomness: 'a,
    Self::Commitment: 'a,
    P: 'a, 

On input a list of labeled polynomials and a query set, open outputs a proof of evaluation of the polynomials at the points in the query set.

fn check<'a>(
    vk: &Self::VerifierKey,
    commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
    point: &'a P::Point,
    values: impl IntoIterator<Item = F>,
    proof: &Self::Proof,
    opening_challenge: F,
    rng: Option<&mut dyn RngCore>
) -> Result<bool, Self::Error> where
    Self::Commitment: 'a, 

Verifies that values are the evaluations at point of the polynomials committed inside commitments.

fn batch_check<'a, R: RngCore>(
    vk: &Self::VerifierKey,
    commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
    query_set: &QuerySet<P::Point>,
    evaluations: &Evaluations<P::Point, F>,
    proof: &Self::BatchProof,
    opening_challenge: F,
    rng: &mut R
) -> Result<bool, Self::Error> where
    Self::Commitment: 'a, 

Checks that values are the true evaluations at query_set of the polynomials committed in labeled_commitments.

fn open_combinations<'a>(
    ck: &Self::CommitterKey,
    linear_combinations: impl IntoIterator<Item = &'a LinearCombination<F>>,
    polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<F, P>>,
    commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
    query_set: &QuerySet<P::Point>,
    opening_challenge: F,
    rands: impl IntoIterator<Item = &'a Self::Randomness>,
    rng: Option<&mut dyn RngCore>
) -> Result<BatchLCProof<F, P, Self>, Self::Error> where
    P: 'a,
    Self::Randomness: 'a,
    Self::Commitment: 'a, 

On input a list of polynomials, linear combinations of those polynomials, and a query set, open_combination outputs a proof of evaluation of the combinations at the points in the query set.

fn check_combinations<'a, R: RngCore>(
    vk: &Self::VerifierKey,
    linear_combinations: impl IntoIterator<Item = &'a LinearCombination<F>>,
    commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
    eqn_query_set: &QuerySet<P::Point>,
    eqn_evaluations: &Evaluations<P::Point, F>,
    proof: &BatchLCProof<F, P, Self>,
    opening_challenge: F,
    rng: &mut R
) -> Result<bool, Self::Error> where
    Self::Commitment: 'a, 

Checks that evaluations are the true evaluations at query_set of the linear combinations of polynomials committed in commitments.