Struct snarkvm_wasm::marlin_pc::MarlinKZG10

pub struct MarlinKZG10<E> where
    E: PairingEngine,  { /* 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> Clone for MarlinKZG10<E> where
    E: Clone + PairingEngine, 

pub fn clone(&self) -> MarlinKZG10<E>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<E> Debug for MarlinKZG10<E> where
    E: Debug + PairingEngine, 

pub fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<E> PolynomialCommitment<<E as PairingEngine>::Fr> for MarlinKZG10<E> where
    E: PairingEngine, 

type BatchProof = Vec<<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Proof, Global>

The evaluation proof for a query set.

type Commitment = Commitment<E>

The commitment to a polynomial.

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 Error = Error

The error type for the scheme.

type Proof = Proof<E>

The evaluation proof for a single point.

type Randomness = Randomness<E>

The commitment randomness.

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 VerifierKey = VerifierKey<E>

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

pub fn setup<R>(
    max_degree: usize,
    rng: &mut R
) -> Result<<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::UniversalParams, <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
    R: RngCore, 

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

pub fn trim(
    pp: &<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::UniversalParams,
    supported_degree: usize,
    supported_hiding_bound: usize,
    enforced_degree_bounds: Option<&[usize]>
) -> Result<(<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::CommitterKey, <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::VerifierKey), <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error>

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

pub fn commit<'a>(
    ck: &<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::CommitterKey,
    polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<<E as PairingEngine>::Fr>>,
    rng: Option<&mut dyn RngCore>
) -> Result<(Vec<LabeledCommitment<<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment>, Global>, Vec<<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness, Global>), <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error>

Outputs a commitment to polynomial.

pub fn open<'a>(
    ck: &<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::CommitterKey,
    labeled_polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<<E as PairingEngine>::Fr>>,
    _commitments: impl IntoIterator<Item = &'a LabeledCommitment<<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment>>,
    point: <E as PairingEngine>::Fr,
    opening_challenge: <E as PairingEngine>::Fr,
    rands: impl IntoIterator<Item = &'a <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness>,
    _rng: Option<&mut dyn RngCore>
) -> Result<<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Proof, <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
    <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness: 'a,
    <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment: 'a, 

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

pub fn check<'a, R>(
    vk: &<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::VerifierKey,
    commitments: impl IntoIterator<Item = &'a LabeledCommitment<<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment>>,
    point: <E as PairingEngine>::Fr,
    values: impl IntoIterator<Item = <E as PairingEngine>::Fr>,
    proof: &<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Proof,
    opening_challenge: <E as PairingEngine>::Fr,
    _rng: &mut R
) -> Result<bool, <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
    R: RngCore,
    <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment: 'a, 

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

pub fn batch_check<'a, R>(
    vk: &<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::VerifierKey,
    commitments: impl Iterator<Item = LabeledCommitment<<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment>>,
    query_set: &BTreeSet<(String, <E as PairingEngine>::Fr)>,
    values: &BTreeMap<(String, <E as PairingEngine>::Fr), <E as PairingEngine>::Fr>,
    proof: &<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::BatchProof,
    opening_challenge: <E as PairingEngine>::Fr,
    rng: &mut R
) -> Result<bool, <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
    R: RngCore,
    <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment: 'a, 

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

pub fn open_combinations<'a>(
    ck: &<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::CommitterKey,
    lc_s: impl IntoIterator<Item = &'a LinearCombination<<E as PairingEngine>::Fr>>,
    polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<<E as PairingEngine>::Fr>>,
    commitments: impl IntoIterator<Item = &'a LabeledCommitment<<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment>>,
    query_set: &BTreeSet<(String, <E as PairingEngine>::Fr)>,
    opening_challenge: <E as PairingEngine>::Fr,
    rands: impl IntoIterator<Item = &'a <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness>,
    rng: Option<&mut dyn RngCore>
) -> Result<BatchLCProof<<E as PairingEngine>::Fr, MarlinKZG10<E>>, <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
    <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness: 'a,
    <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::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.

pub fn check_combinations<'a, R>(
    vk: &<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::VerifierKey,
    lc_s: impl IntoIterator<Item = &'a LinearCombination<<E as PairingEngine>::Fr>>,
    commitments: impl Iterator<Item = LabeledCommitment<<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment>>,
    query_set: &BTreeSet<(String, <E as PairingEngine>::Fr)>,
    evaluations: &BTreeMap<(String, <E as PairingEngine>::Fr), <E as PairingEngine>::Fr>,
    proof: &BatchLCProof<<E as PairingEngine>::Fr, MarlinKZG10<E>>,
    opening_challenge: <E as PairingEngine>::Fr,
    rng: &mut R
) -> Result<bool, <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
    R: RngCore,
    <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment: 'a, 

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

pub fn batch_open<'a>(
    ck: &Self::CommitterKey,
    labeled_polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<F>>,
    commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
    query_set: &BTreeSet<(String, F)>,
    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, 

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.