Struct ark_poly_commit::marlin::marlin_pc::MarlinKZG10 [−][src]
pub struct MarlinKZG10<E: PairingEngine, P: UVPolynomial<E::Fr>> { /* fields omitted */ }
Expand description
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>,
[src]
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>,
[src]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,
[src]
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,
[src]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,
[src]
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,
[src]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,
[src]
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,
[src]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,
[src]
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,
[src]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,
[src]
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,
[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.
type UniversalParams = UniversalParams<E>
type UniversalParams = UniversalParams<E>
The universal parameters for the commitment scheme. These are “trimmed”
down to Self::CommitterKey
and Self::VerifierKey
by Self::trim
. Read more
type CommitterKey = CommitterKey<E>
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. Read more
type VerifierKey = VerifierKey<E>
type VerifierKey = VerifierKey<E>
The verifier key for the scheme; used to check an evaluation proof.
type PreparedVerifierKey = PreparedVerifierKey<E>
type PreparedVerifierKey = PreparedVerifierKey<E>
The prepared verifier key for the scheme; used to check an evaluation proof.
type Commitment = Commitment<E>
type Commitment = Commitment<E>
The commitment to a polynomial.
type PreparedCommitment = PreparedCommitment<E>
type PreparedCommitment = PreparedCommitment<E>
The prepared commitment to a polynomial.
type Randomness = Randomness<E::Fr, P>
type Randomness = Randomness<E::Fr, P>
The commitment randomness.
type BatchProof = Vec<Self::Proof>
type BatchProof = Vec<Self::Proof>
The evaluation proof for a query set.
fn trim(
pp: &Self::UniversalParams,
supported_degree: usize,
supported_hiding_bound: usize,
enforced_degree_bounds: Option<&[usize]>
) -> Result<(Self::CommitterKey, Self::VerifierKey), Self::Error>
[src]
fn trim(
pp: &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
. Read more
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,
[src]
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,
[src]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,
[src]
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,
[src]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,
[src]
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,
[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. Read more
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,
[src]
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,
[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. Read more
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,
[src]
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,
[src]Verifies that values
are the evaluations at point
of the polynomials
committed inside commitments
. Read more
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,
[src]
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,
[src]Checks that values
are the true evaluations at query_set
of the polynomials
committed in labeled_commitments
. Read more
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,
[src]
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,
[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. Read more
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,
[src]
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,
[src]Checks that evaluations
are the true evaluations at query_set
of the
linear combinations of polynomials committed in commitments
. Read more
Auto Trait Implementations
impl<E, P> RefUnwindSafe for MarlinKZG10<E, P> where
E: RefUnwindSafe,
P: RefUnwindSafe,
impl<E, P> Send for MarlinKZG10<E, P> where
P: Send,
impl<E, P> Sync for MarlinKZG10<E, P> where
P: Sync,
impl<E, P> Unpin for MarlinKZG10<E, P> where
E: Unpin,
P: Unpin,
impl<E, P> UnwindSafe for MarlinKZG10<E, P> where
E: UnwindSafe,
P: UnwindSafe,