Trait snarkvm_marlin::snark::PolynomialCommitment [−][src]
pub trait PolynomialCommitment<F>: Clone + Debug where
F: Field, { type UniversalParams: PCUniversalParams + Clone; type CommitterKey: PCCommitterKey + Clone; type VerifierKey: PCVerifierKey + Clone; type PreparedVerifierKey: PCPreparedVerifierKey<Self::VerifierKey> + Clone; type Commitment: PCCommitment + Clone; type PreparedCommitment: PCPreparedCommitment<Self::Commitment>; type Randomness: PCRandomness + Clone; type Proof: PCProof + Clone; type BatchProof: CanonicalSerialize + CanonicalDeserialize + Clone + From<Vec<Self::Proof, Global>> + Into<Vec<Self::Proof, Global>> + Debug; type Error: Error + From<Error>; fn setup<R>(
max_degree: usize,
rng: &mut R
) -> Result<Self::UniversalParams, Self::Error>
where
R: RngCore; fn trim(
parameters: &Self::UniversalParams,
supported_degree: usize,
supported_hiding_bound: usize,
enforced_degree_bounds: Option<&[usize]>
) -> Result<(Self::CommitterKey, Self::VerifierKey), Self::Error>; fn commit<'a>(
ck: &Self::CommitterKey,
polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<F>>,
rng: Option<&mut dyn RngCore>
) -> Result<(Vec<LabeledCommitment<Self::Commitment>, Global>, Vec<Self::Randomness, Global>), Self::Error>; fn open<'a>(
ck: &Self::CommitterKey,
labeled_polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<F>>,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
point: F,
opening_challenge: F,
rands: impl IntoIterator<Item = &'a Self::Randomness>,
rng: Option<&mut dyn RngCore>
) -> Result<Self::Proof, Self::Error>
where
Self::Randomness: 'a,
Self::Commitment: 'a; fn check<'a, R>(
vk: &Self::VerifierKey,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
point: F,
values: impl IntoIterator<Item = F>,
proof: &Self::Proof,
opening_challenge: F,
rng: &mut R
) -> Result<bool, Self::Error>
where
R: RngCore,
Self::Commitment: 'a; fn open_combinations_individual_opening_challenges<'a>(
ck: &Self::CommitterKey,
linear_combinations: impl IntoIterator<Item = &'a LinearCombination<F>>,
polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<F>>,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
query_set: &BTreeSet<(String, F)>,
opening_challenges: &dyn Fn(u64),
rands: impl IntoIterator<Item = &'a Self::Randomness>
) -> Result<BatchLCProof<F, Self>, Self::Error>
where
Self::Randomness: 'a,
Self::Commitment: 'a; fn check_combinations_individual_opening_challenges<'a, R>(
vk: &Self::VerifierKey,
linear_combinations: impl IntoIterator<Item = &'a LinearCombination<F>>,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
eqn_query_set: &BTreeSet<(String, F)>,
eqn_evaluations: &BTreeMap<(String, F), F>,
proof: &BatchLCProof<F, Self>,
opening_challenges: &dyn Fn(u64),
rng: &mut R
) -> Result<bool, Self::Error>
where
R: RngCore,
Self::Commitment: 'a; 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, { ... } fn batch_check<'a, R>(
vk: &Self::VerifierKey,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
query_set: &BTreeSet<(String, F)>,
evaluations: &BTreeMap<(String, F), F>,
proof: &Self::BatchProof,
opening_challenge: F,
rng: &mut R
) -> Result<bool, Self::Error>
where
R: RngCore,
Self::Commitment: 'a, { ... } fn open_combinations<'a>(
ck: &Self::CommitterKey,
linear_combinations: impl IntoIterator<Item = &'a LinearCombination<F>>,
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<BatchLCProof<F, Self>, Self::Error>
where
Self::Randomness: 'a,
Self::Commitment: 'a, { ... } fn check_combinations<'a, R>(
vk: &Self::VerifierKey,
linear_combinations: impl IntoIterator<Item = &'a LinearCombination<F>>,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
eqn_query_set: &BTreeSet<(String, F)>,
eqn_evaluations: &BTreeMap<(String, F), F>,
proof: &BatchLCProof<F, Self>,
opening_challenge: F,
rng: &mut R
) -> Result<bool, Self::Error>
where
R: RngCore,
Self::Commitment: 'a, { ... } }
Expand description
Describes the interface for a polynomial commitment scheme that allows
a sender to commit to multiple polynomials and later provide a succinct proof
of evaluation for the corresponding commitments at a query set Q
, while
enforcing per-polynomial degree bounds.
Associated Types
The universal parameters for the commitment scheme. These are “trimmed”
down to Self::CommitterKey
and Self::VerifierKey
by Self::trim
.
type CommitterKey: PCCommitterKey + Clone
[src]
type CommitterKey: PCCommitterKey + Clone
[src]The committer key for the scheme; used to commit to a polynomial and then open the commitment to produce an evaluation proof.
type VerifierKey: PCVerifierKey + Clone
[src]
type VerifierKey: PCVerifierKey + Clone
[src]The verifier key for the scheme; used to check an evaluation proof.
type PreparedVerifierKey: PCPreparedVerifierKey<Self::VerifierKey> + Clone
[src]
type PreparedVerifierKey: PCPreparedVerifierKey<Self::VerifierKey> + Clone
[src]The prepared verifier key for the scheme; used to check an evaluation proof.
type Commitment: PCCommitment + Clone
[src]
type Commitment: PCCommitment + Clone
[src]The commitment to a polynomial.
type PreparedCommitment: PCPreparedCommitment<Self::Commitment>
[src]
type PreparedCommitment: PCPreparedCommitment<Self::Commitment>
[src]The prepared commitment to a polynomial.
type Randomness: PCRandomness + Clone
[src]
type Randomness: PCRandomness + Clone
[src]The commitment randomness.
type BatchProof: CanonicalSerialize + CanonicalDeserialize + Clone + From<Vec<Self::Proof, Global>> + Into<Vec<Self::Proof, Global>> + Debug
[src]
type BatchProof: CanonicalSerialize + CanonicalDeserialize + Clone + From<Vec<Self::Proof, Global>> + Into<Vec<Self::Proof, Global>> + Debug
[src]The evaluation proof for a query set.
Required methods
Constructs public parameters when given as input the maximum degree degree
for the polynomial commitment scheme.
fn trim(
parameters: &Self::UniversalParams,
supported_degree: usize,
supported_hiding_bound: usize,
enforced_degree_bounds: Option<&[usize]>
) -> Result<(Self::CommitterKey, Self::VerifierKey), Self::Error>
[src]
fn trim(
parameters: &Self::UniversalParams,
supported_degree: usize,
supported_hiding_bound: usize,
enforced_degree_bounds: Option<&[usize]>
) -> Result<(Self::CommitterKey, Self::VerifierKey), Self::Error>
[src]Specializes the public parameters for polynomials up to the given supported_degree
and for enforcing degree bounds in the range 1..=supported_degree
.
fn commit<'a>(
ck: &Self::CommitterKey,
polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<F>>,
rng: Option<&mut dyn RngCore>
) -> Result<(Vec<LabeledCommitment<Self::Commitment>, Global>, Vec<Self::Randomness, Global>), Self::Error>
[src]
fn commit<'a>(
ck: &Self::CommitterKey,
polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<F>>,
rng: Option<&mut dyn RngCore>
) -> Result<(Vec<LabeledCommitment<Self::Commitment>, Global>, Vec<Self::Randomness, Global>), Self::Error>
[src]Outputs a commitments to polynomials
. If polynomials[i].is_hiding()
,
then the i
-th commitment is hiding up to polynomials.hiding_bound()
queries.
rng
should not be None
if polynomials[i].is_hiding() == true
for any i
.
If for some i
, polynomials[i].is_hiding() == false
, then the
corresponding randomness is Self::Randomness::empty()
.
If for some i
, polynomials[i].degree_bound().is_some()
, then that
polynomial will have the corresponding degree bound enforced.
fn open<'a>(
ck: &Self::CommitterKey,
labeled_polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<F>>,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
point: F,
opening_challenge: F,
rands: impl IntoIterator<Item = &'a Self::Randomness>,
rng: Option<&mut dyn RngCore>
) -> Result<Self::Proof, Self::Error> where
Self::Randomness: 'a,
Self::Commitment: 'a,
[src]
fn open<'a>(
ck: &Self::CommitterKey,
labeled_polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<F>>,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
point: F,
opening_challenge: F,
rands: impl IntoIterator<Item = &'a Self::Randomness>,
rng: Option<&mut dyn RngCore>
) -> Result<Self::Proof, Self::Error> where
Self::Randomness: 'a,
Self::Commitment: 'a,
[src]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 check<'a, R>(
vk: &Self::VerifierKey,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
point: F,
values: impl IntoIterator<Item = F>,
proof: &Self::Proof,
opening_challenge: F,
rng: &mut R
) -> Result<bool, Self::Error> where
R: RngCore,
Self::Commitment: 'a,
[src]
fn check<'a, R>(
vk: &Self::VerifierKey,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
point: F,
values: impl IntoIterator<Item = F>,
proof: &Self::Proof,
opening_challenge: F,
rng: &mut R
) -> Result<bool, Self::Error> where
R: RngCore,
Self::Commitment: 'a,
[src]Verifies that values
are the evaluations at point
of the polynomials
committed inside commitments
.
fn open_combinations_individual_opening_challenges<'a>(
ck: &Self::CommitterKey,
linear_combinations: impl IntoIterator<Item = &'a LinearCombination<F>>,
polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<F>>,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
query_set: &BTreeSet<(String, F)>,
opening_challenges: &dyn Fn(u64),
rands: impl IntoIterator<Item = &'a Self::Randomness>
) -> Result<BatchLCProof<F, Self>, Self::Error> where
Self::Randomness: 'a,
Self::Commitment: 'a,
[src]
fn open_combinations_individual_opening_challenges<'a>(
ck: &Self::CommitterKey,
linear_combinations: impl IntoIterator<Item = &'a LinearCombination<F>>,
polynomials: impl IntoIterator<Item = &'a LabeledPolynomial<F>>,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
query_set: &BTreeSet<(String, F)>,
opening_challenges: &dyn Fn(u64),
rands: impl IntoIterator<Item = &'a Self::Randomness>
) -> Result<BatchLCProof<F, Self>, Self::Error> where
Self::Randomness: 'a,
Self::Commitment: 'a,
[src]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_individual_opening_challenges<'a, R>(
vk: &Self::VerifierKey,
linear_combinations: impl IntoIterator<Item = &'a LinearCombination<F>>,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
eqn_query_set: &BTreeSet<(String, F)>,
eqn_evaluations: &BTreeMap<(String, F), F>,
proof: &BatchLCProof<F, Self>,
opening_challenges: &dyn Fn(u64),
rng: &mut R
) -> Result<bool, Self::Error> where
R: RngCore,
Self::Commitment: 'a,
[src]
fn check_combinations_individual_opening_challenges<'a, R>(
vk: &Self::VerifierKey,
linear_combinations: impl IntoIterator<Item = &'a LinearCombination<F>>,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
eqn_query_set: &BTreeSet<(String, F)>,
eqn_evaluations: &BTreeMap<(String, F), F>,
proof: &BatchLCProof<F, Self>,
opening_challenges: &dyn Fn(u64),
rng: &mut R
) -> Result<bool, Self::Error> where
R: RngCore,
Self::Commitment: 'a,
[src]Check combinations with individual challenges.
Provided methods
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,
[src]
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,
[src]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 batch_check<'a, R>(
vk: &Self::VerifierKey,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
query_set: &BTreeSet<(String, F)>,
evaluations: &BTreeMap<(String, F), F>,
proof: &Self::BatchProof,
opening_challenge: F,
rng: &mut R
) -> Result<bool, Self::Error> where
R: RngCore,
Self::Commitment: 'a,
[src]
fn batch_check<'a, R>(
vk: &Self::VerifierKey,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
query_set: &BTreeSet<(String, F)>,
evaluations: &BTreeMap<(String, F), F>,
proof: &Self::BatchProof,
opening_challenge: F,
rng: &mut R
) -> Result<bool, Self::Error> where
R: RngCore,
Self::Commitment: 'a,
[src]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>>,
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<BatchLCProof<F, Self>, Self::Error> where
Self::Randomness: 'a,
Self::Commitment: 'a,
[src]
fn open_combinations<'a>(
ck: &Self::CommitterKey,
linear_combinations: impl IntoIterator<Item = &'a LinearCombination<F>>,
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<BatchLCProof<F, Self>, Self::Error> where
Self::Randomness: 'a,
Self::Commitment: 'a,
[src]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>(
vk: &Self::VerifierKey,
linear_combinations: impl IntoIterator<Item = &'a LinearCombination<F>>,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
eqn_query_set: &BTreeSet<(String, F)>,
eqn_evaluations: &BTreeMap<(String, F), F>,
proof: &BatchLCProof<F, Self>,
opening_challenge: F,
rng: &mut R
) -> Result<bool, Self::Error> where
R: RngCore,
Self::Commitment: 'a,
[src]
fn check_combinations<'a, R>(
vk: &Self::VerifierKey,
linear_combinations: impl IntoIterator<Item = &'a LinearCombination<F>>,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<Self::Commitment>>,
eqn_query_set: &BTreeSet<(String, F)>,
eqn_evaluations: &BTreeMap<(String, F), F>,
proof: &BatchLCProof<F, Self>,
opening_challenge: F,
rng: &mut R
) -> Result<bool, Self::Error> where
R: RngCore,
Self::Commitment: 'a,
[src]Checks that evaluations
are the true evaluations at query_set
of the
linear combinations of polynomials committed in commitments
.
Implementations on Foreign Types
impl<E> PolynomialCommitment<<E as PairingEngine>::Fr> for SonicKZG10<E> where
E: PairingEngine,
[src]
impl<E> PolynomialCommitment<<E as PairingEngine>::Fr> for SonicKZG10<E> where
E: PairingEngine,
[src]pub fn commit<'a>(
ck: &<SonicKZG10<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<<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment>, Global>, Vec<<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness, Global>), <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error>
[src]
pub fn commit<'a>(
ck: &<SonicKZG10<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<<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment>, Global>, Vec<<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness, Global>), <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error>
[src]Outputs a commitment to polynomial
.
pub fn check_combinations<'a, R>(
vk: &<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::VerifierKey,
lc_s: impl IntoIterator<Item = &'a LinearCombination<<E as PairingEngine>::Fr>>,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<<SonicKZG10<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, SonicKZG10<E>>,
opening_challenge: <E as PairingEngine>::Fr,
rng: &mut R
) -> Result<bool, <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
R: RngCore,
<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment: 'a,
[src]
pub fn check_combinations<'a, R>(
vk: &<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::VerifierKey,
lc_s: impl IntoIterator<Item = &'a LinearCombination<<E as PairingEngine>::Fr>>,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<<SonicKZG10<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, SonicKZG10<E>>,
opening_challenge: <E as PairingEngine>::Fr,
rng: &mut R
) -> Result<bool, <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
R: RngCore,
<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment: 'a,
[src]Checks that values
are the true evaluations at query_set
of the polynomials
committed in labeled_commitments
.
pub fn open_combinations_individual_opening_challenges<'a>(
ck: &<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::CommitterKey,
linear_combinations: 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<<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment>>,
query_set: &BTreeSet<(String, <E as PairingEngine>::Fr)>,
opening_challenges: &dyn Fn(u64),
rands: impl IntoIterator<Item = &'a <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness>
) -> Result<BatchLCProof<<E as PairingEngine>::Fr, SonicKZG10<E>>, <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness: 'a,
<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment: 'a,
[src]
pub fn open_combinations_individual_opening_challenges<'a>(
ck: &<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::CommitterKey,
linear_combinations: 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<<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment>>,
query_set: &BTreeSet<(String, <E as PairingEngine>::Fr)>,
opening_challenges: &dyn Fn(u64),
rands: impl IntoIterator<Item = &'a <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness>
) -> Result<BatchLCProof<<E as PairingEngine>::Fr, SonicKZG10<E>>, <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness: 'a,
<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment: 'a,
[src]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_individual_opening_challenges<'a, R>(
vk: &<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::VerifierKey,
linear_combinations: impl IntoIterator<Item = &'a LinearCombination<<E as PairingEngine>::Fr>>,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment>>,
eqn_query_set: &BTreeSet<(String, <E as PairingEngine>::Fr)>,
eqn_evaluations: &BTreeMap<(String, <E as PairingEngine>::Fr), <E as PairingEngine>::Fr>,
proof: &BatchLCProof<<E as PairingEngine>::Fr, SonicKZG10<E>>,
opening_challenges: &dyn Fn(u64),
_rng: &mut R
) -> Result<bool, <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
R: RngCore,
<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment: 'a,
[src]
pub fn check_combinations_individual_opening_challenges<'a, R>(
vk: &<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::VerifierKey,
linear_combinations: impl IntoIterator<Item = &'a LinearCombination<<E as PairingEngine>::Fr>>,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment>>,
eqn_query_set: &BTreeSet<(String, <E as PairingEngine>::Fr)>,
eqn_evaluations: &BTreeMap<(String, <E as PairingEngine>::Fr), <E as PairingEngine>::Fr>,
proof: &BatchLCProof<<E as PairingEngine>::Fr, SonicKZG10<E>>,
opening_challenges: &dyn Fn(u64),
_rng: &mut R
) -> Result<bool, <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
R: RngCore,
<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment: 'a,
[src]Check combinations with individual challenges.
type BatchProof = Vec<<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Proof, Global>
type Commitment = Commitment<E>
type CommitterKey = CommitterKey<E>
type PreparedCommitment = PreparedCommitment<E>
type PreparedVerifierKey = VerifierKey<E>
type Randomness = Randomness<E>
type UniversalParams = UniversalParams<E>
type VerifierKey = VerifierKey<E>
pub fn setup<R>(
max_degree: usize,
rng: &mut R
) -> Result<<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::UniversalParams, <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
R: RngCore,
[src]pub fn trim(
pp: &<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::UniversalParams,
supported_degree: usize,
supported_hiding_bound: usize,
enforced_degree_bounds: Option<&[usize]>
) -> Result<(<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::CommitterKey, <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::VerifierKey), <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error>
[src]pub fn open<'a>(
ck: &<SonicKZG10<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<<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment>>,
point: <E as PairingEngine>::Fr,
opening_challenge: <E as PairingEngine>::Fr,
rands: impl IntoIterator<Item = &'a <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness>,
_rng: Option<&mut dyn RngCore>
) -> Result<<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Proof, <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness: 'a,
<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment: 'a,
[src]pub fn check<'a, R>(
vk: &<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::VerifierKey,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment>>,
point: <E as PairingEngine>::Fr,
values: impl IntoIterator<Item = <E as PairingEngine>::Fr>,
proof: &<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Proof,
opening_challenge: <E as PairingEngine>::Fr,
_rng: &mut R
) -> Result<bool, <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
R: RngCore,
<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment: 'a,
[src]pub fn batch_check<'a, R>(
vk: &<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::VerifierKey,
commitments: impl IntoIterator<Item = &'a LabeledCommitment<<SonicKZG10<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: &<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::BatchProof,
opening_challenge: <E as PairingEngine>::Fr,
rng: &mut R
) -> Result<bool, <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
R: RngCore,
<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment: 'a,
[src]pub fn open_combinations<'a>(
ck: &<SonicKZG10<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<<SonicKZG10<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 <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness>,
rng: Option<&mut dyn RngCore>
) -> Result<BatchLCProof<<E as PairingEngine>::Fr, SonicKZG10<E>>, <SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Error> where
<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness: 'a,
<SonicKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Commitment: 'a,
[src]Implementors
impl<E> PolynomialCommitment<<E as PairingEngine>::Fr> for MarlinKZG10<E> where
E: PairingEngine,
[src]
impl<E> PolynomialCommitment<<E as PairingEngine>::Fr> for MarlinKZG10<E> where
E: PairingEngine,
[src]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,
[src]
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,
[src]Constructs public parameters when given as input the maximum degree max_degree
for the polynomial commitment scheme.
pub fn trim(
parameters: &<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>
[src]
pub fn trim(
parameters: &<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>
[src]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>
[src]
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>
[src]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,
[src]
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,
[src]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,
[src]
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,
[src]Verifies that value
is the evaluation at x
of the polynomial
committed inside comm
.
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 IntoIterator<Item = &'a 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,
[src]
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 IntoIterator<Item = &'a 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,
[src]Checks that values
are the true evaluations at query_set
of the polynomials
committed in labeled_commitments
.
pub fn open_combinations_individual_opening_challenges<'a>(
ck: &<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::CommitterKey,
linear_combinations: 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_challenges: &dyn Fn(u64),
rands: impl IntoIterator<Item = &'a <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness>
) -> 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,
[src]
pub fn open_combinations_individual_opening_challenges<'a>(
ck: &<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::CommitterKey,
linear_combinations: 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_challenges: &dyn Fn(u64),
rands: impl IntoIterator<Item = &'a <MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Randomness>
) -> 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,
[src]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_individual_opening_challenges<'a, R>(
vk: &<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::VerifierKey,
linear_combinations: impl IntoIterator<Item = &'a LinearCombination<<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)>,
evaluations: &BTreeMap<(String, <E as PairingEngine>::Fr), <E as PairingEngine>::Fr>,
proof: &BatchLCProof<<E as PairingEngine>::Fr, MarlinKZG10<E>>,
opening_challenges: &dyn Fn(u64),
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,
[src]
pub fn check_combinations_individual_opening_challenges<'a, R>(
vk: &<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::VerifierKey,
linear_combinations: impl IntoIterator<Item = &'a LinearCombination<<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)>,
evaluations: &BTreeMap<(String, <E as PairingEngine>::Fr), <E as PairingEngine>::Fr>,
proof: &BatchLCProof<<E as PairingEngine>::Fr, MarlinKZG10<E>>,
opening_challenges: &dyn Fn(u64),
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,
[src]Check combinations with individual challenges.
type BatchProof = Vec<<MarlinKZG10<E> as PolynomialCommitment<<E as PairingEngine>::Fr>>::Proof, Global>
type Commitment = Commitment<E>
type CommitterKey = CommitterKey<E>
type PreparedCommitment = PreparedCommitment<E>
type PreparedVerifierKey = PreparedVerifierKey<E>
type Randomness = Randomness<E>
type UniversalParams = UniversalParams<E>
type VerifierKey = VerifierKey<E>
pub fn batch_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>>,
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,
[src]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,
[src]