pub struct KzgAs<M, MOS>(/* private fields */);
Expand description
KZG accumulation scheme. The second generic MOS
stands for different kind
of multi-open scheme.
Trait Implementations§
Source§impl<M, MOS> AccumulationDecider<<M as Engine>::G1Affine, NativeLoader> for KzgAs<M, MOS>where
M: MultiMillerLoop,
M::G1Affine: CurveAffine<ScalarExt = M::Fr, CurveExt = M::G1>,
MOS: Clone + Debug,
impl<M, MOS> AccumulationDecider<<M as Engine>::G1Affine, NativeLoader> for KzgAs<M, MOS>where
M: MultiMillerLoop,
M::G1Affine: CurveAffine<ScalarExt = M::Fr, CurveExt = M::G1>,
MOS: Clone + Debug,
Source§type DecidingKey = KzgDecidingKey<M>
type DecidingKey = KzgDecidingKey<M>
Deciding key. The key for decider for perform the final accumulator
check.
Source§fn decide(
dk: &Self::DecidingKey,
_: KzgAccumulator<M::G1Affine, NativeLoader>,
) -> Result<(), Error>
fn decide( dk: &Self::DecidingKey, _: KzgAccumulator<M::G1Affine, NativeLoader>, ) -> Result<(), Error>
Decide if a
AccumulationScheme::Accumulator
is valid.Source§fn decide_all(
dk: &Self::DecidingKey,
accumulators: Vec<KzgAccumulator<M::G1Affine, NativeLoader>>,
) -> Result<(), Error>
fn decide_all( dk: &Self::DecidingKey, accumulators: Vec<KzgAccumulator<M::G1Affine, NativeLoader>>, ) -> Result<(), Error>
Decide if all
AccumulationScheme::Accumulator
s are valid.Source§impl<M, MOS> AccumulationDecider<<M as Engine>::G1Affine, Rc<EvmLoader>> for KzgAs<M, MOS>where
M: MultiMillerLoop,
M::G1Affine: CurveAffine<ScalarExt = M::Fr, CurveExt = M::G1>,
M::G2Affine: CurveAffine<ScalarExt = M::Fr, CurveExt = M::G2>,
M::Fr: PrimeField<Repr = [u8; 32]>,
MOS: Clone + Debug,
impl<M, MOS> AccumulationDecider<<M as Engine>::G1Affine, Rc<EvmLoader>> for KzgAs<M, MOS>where
M: MultiMillerLoop,
M::G1Affine: CurveAffine<ScalarExt = M::Fr, CurveExt = M::G1>,
M::G2Affine: CurveAffine<ScalarExt = M::Fr, CurveExt = M::G2>,
M::Fr: PrimeField<Repr = [u8; 32]>,
MOS: Clone + Debug,
Source§type DecidingKey = KzgDecidingKey<M>
type DecidingKey = KzgDecidingKey<M>
Deciding key. The key for decider for perform the final accumulator
check.
Source§fn decide(
dk: &Self::DecidingKey,
_: KzgAccumulator<M::G1Affine, Rc<EvmLoader>>,
) -> Result<(), Error>
fn decide( dk: &Self::DecidingKey, _: KzgAccumulator<M::G1Affine, Rc<EvmLoader>>, ) -> Result<(), Error>
Decide if a
AccumulationScheme::Accumulator
is valid.Source§fn decide_all(
dk: &Self::DecidingKey,
accumulators: Vec<KzgAccumulator<M::G1Affine, Rc<EvmLoader>>>,
) -> Result<(), Error>
fn decide_all( dk: &Self::DecidingKey, accumulators: Vec<KzgAccumulator<M::G1Affine, Rc<EvmLoader>>>, ) -> Result<(), Error>
Decide if all
AccumulationScheme::Accumulator
s are valid.Source§impl<M, L, MOS> AccumulationScheme<<M as Engine>::G1Affine, L> for KzgAs<M, MOS>where
M: MultiMillerLoop,
M::G1Affine: CurveAffine<ScalarExt = M::Fr, CurveExt = M::G1>,
L: Loader<M::G1Affine>,
MOS: Clone + Debug,
impl<M, L, MOS> AccumulationScheme<<M as Engine>::G1Affine, L> for KzgAs<M, MOS>where
M: MultiMillerLoop,
M::G1Affine: CurveAffine<ScalarExt = M::Fr, CurveExt = M::G1>,
L: Loader<M::G1Affine>,
MOS: Clone + Debug,
Source§type Accumulator = KzgAccumulator<<M as Engine>::G1Affine, L>
type Accumulator = KzgAccumulator<<M as Engine>::G1Affine, L>
Accumulator to be accumulated.
Source§type VerifyingKey = KzgAsVerifyingKey
type VerifyingKey = KzgAsVerifyingKey
Verifying key.
Source§fn read_proof<T>(
vk: &Self::VerifyingKey,
instances: &[Self::Accumulator],
transcript: &mut T,
) -> Result<Self::Proof, Error>where
T: TranscriptRead<M::G1Affine, L>,
fn read_proof<T>(
vk: &Self::VerifyingKey,
instances: &[Self::Accumulator],
transcript: &mut T,
) -> Result<Self::Proof, Error>where
T: TranscriptRead<M::G1Affine, L>,
Read a
AccumulationScheme::Proof
from transcript.Source§fn verify(
_: &Self::VerifyingKey,
instances: &[Self::Accumulator],
proof: &Self::Proof,
) -> Result<Self::Accumulator, Error>
fn verify( _: &Self::VerifyingKey, instances: &[Self::Accumulator], proof: &Self::Proof, ) -> Result<Self::Accumulator, Error>
Verify old
AccumulationScheme::Accumulator
s are accumulated properly
into a new one with the AccumulationScheme::Proof
, and returns the
new one as output.Source§impl<M, MOS> AccumulationSchemeProver<<M as Engine>::G1Affine> for KzgAs<M, MOS>where
M: MultiMillerLoop,
M::G1Affine: CurveAffine<ScalarExt = M::Fr, CurveExt = M::G1>,
MOS: Clone + Debug,
impl<M, MOS> AccumulationSchemeProver<<M as Engine>::G1Affine> for KzgAs<M, MOS>where
M: MultiMillerLoop,
M::G1Affine: CurveAffine<ScalarExt = M::Fr, CurveExt = M::G1>,
MOS: Clone + Debug,
Source§type ProvingKey = KzgAsProvingKey<<M as Engine>::G1Affine>
type ProvingKey = KzgAsProvingKey<<M as Engine>::G1Affine>
Proving key.
Source§fn create_proof<T, R>(
pk: &Self::ProvingKey,
instances: &[KzgAccumulator<M::G1Affine, NativeLoader>],
transcript: &mut T,
rng: R,
) -> Result<KzgAccumulator<M::G1Affine, NativeLoader>, Error>
fn create_proof<T, R>( pk: &Self::ProvingKey, instances: &[KzgAccumulator<M::G1Affine, NativeLoader>], transcript: &mut T, rng: R, ) -> Result<KzgAccumulator<M::G1Affine, NativeLoader>, Error>
Create a proof that argues if old
AccumulationScheme::Accumulator
s
are properly accumulated into the new one, and returns the new one as
output.Source§impl<M> CostEstimation<<M as Engine>::G1Affine> for KzgAs<M, Bdfg21>where
M: MultiMillerLoop,
impl<M> CostEstimation<<M as Engine>::G1Affine> for KzgAs<M, Bdfg21>where
M: MultiMillerLoop,
Source§impl<M> CostEstimation<<M as Engine>::G1Affine> for KzgAs<M, Gwc19>where
M: MultiMillerLoop,
impl<M> CostEstimation<<M as Engine>::G1Affine> for KzgAs<M, Gwc19>where
M: MultiMillerLoop,
Source§impl<M, L> PolynomialCommitmentScheme<<M as Engine>::G1Affine, L> for KzgAs<M, Bdfg21>where
M: MultiMillerLoop,
M::G1Affine: CurveAffine<ScalarExt = M::Fr, CurveExt = M::G1>,
M::Fr: Ord,
L: Loader<M::G1Affine>,
impl<M, L> PolynomialCommitmentScheme<<M as Engine>::G1Affine, L> for KzgAs<M, Bdfg21>where
M: MultiMillerLoop,
M::G1Affine: CurveAffine<ScalarExt = M::Fr, CurveExt = M::G1>,
M::Fr: Ord,
L: Loader<M::G1Affine>,
Source§type VerifyingKey = KzgSuccinctVerifyingKey<<M as Engine>::G1Affine>
type VerifyingKey = KzgSuccinctVerifyingKey<<M as Engine>::G1Affine>
Verifying key.
Source§fn read_proof<T>(
_: &KzgSuccinctVerifyingKey<M::G1Affine>,
_: &[Query<Rotation>],
transcript: &mut T,
) -> Result<Bdfg21Proof<M::G1Affine, L>, Error>where
T: TranscriptRead<M::G1Affine, L>,
fn read_proof<T>(
_: &KzgSuccinctVerifyingKey<M::G1Affine>,
_: &[Query<Rotation>],
transcript: &mut T,
) -> Result<Bdfg21Proof<M::G1Affine, L>, Error>where
T: TranscriptRead<M::G1Affine, L>,
Read
PolynomialCommitmentScheme::Proof
from transcript.Source§fn verify(
svk: &KzgSuccinctVerifyingKey<M::G1Affine>,
commitments: &[Msm<'_, M::G1Affine, L>],
z: &L::LoadedScalar,
queries: &[Query<Rotation, L::LoadedScalar>],
proof: &Bdfg21Proof<M::G1Affine, L>,
) -> Result<Self::Output, Error>
fn verify( svk: &KzgSuccinctVerifyingKey<M::G1Affine>, commitments: &[Msm<'_, M::G1Affine, L>], z: &L::LoadedScalar, queries: &[Query<Rotation, L::LoadedScalar>], proof: &Bdfg21Proof<M::G1Affine, L>, ) -> Result<Self::Output, Error>
Verify
PolynomialCommitmentScheme::Proof
and output PolynomialCommitmentScheme::Output
.Source§impl<M, L> PolynomialCommitmentScheme<<M as Engine>::G1Affine, L> for KzgAs<M, Gwc19>where
M: MultiMillerLoop,
M::G1Affine: CurveAffine<ScalarExt = M::Fr, CurveExt = M::G1>,
L: Loader<M::G1Affine>,
impl<M, L> PolynomialCommitmentScheme<<M as Engine>::G1Affine, L> for KzgAs<M, Gwc19>where
M: MultiMillerLoop,
M::G1Affine: CurveAffine<ScalarExt = M::Fr, CurveExt = M::G1>,
L: Loader<M::G1Affine>,
Source§type VerifyingKey = KzgSuccinctVerifyingKey<<M as Engine>::G1Affine>
type VerifyingKey = KzgSuccinctVerifyingKey<<M as Engine>::G1Affine>
Verifying key.
Source§fn read_proof<T>(
_: &Self::VerifyingKey,
queries: &[Query<Rotation>],
transcript: &mut T,
) -> Result<Self::Proof, Error>where
T: TranscriptRead<M::G1Affine, L>,
fn read_proof<T>(
_: &Self::VerifyingKey,
queries: &[Query<Rotation>],
transcript: &mut T,
) -> Result<Self::Proof, Error>where
T: TranscriptRead<M::G1Affine, L>,
Read
PolynomialCommitmentScheme::Proof
from transcript.Source§fn verify(
svk: &Self::VerifyingKey,
commitments: &[Msm<'_, M::G1Affine, L>],
z: &L::LoadedScalar,
queries: &[Query<Rotation, L::LoadedScalar>],
proof: &Self::Proof,
) -> Result<Self::Output, Error>
fn verify( svk: &Self::VerifyingKey, commitments: &[Msm<'_, M::G1Affine, L>], z: &L::LoadedScalar, queries: &[Query<Rotation, L::LoadedScalar>], proof: &Self::Proof, ) -> Result<Self::Output, Error>
Verify
PolynomialCommitmentScheme::Proof
and output PolynomialCommitmentScheme::Output
.Auto Trait Implementations§
impl<M, MOS> Freeze for KzgAs<M, MOS>
impl<M, MOS> RefUnwindSafe for KzgAs<M, MOS>where
M: RefUnwindSafe,
MOS: RefUnwindSafe,
impl<M, MOS> Send for KzgAs<M, MOS>
impl<M, MOS> Sync for KzgAs<M, MOS>
impl<M, MOS> Unpin for KzgAs<M, MOS>
impl<M, MOS> UnwindSafe for KzgAs<M, MOS>where
M: UnwindSafe,
MOS: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)Source§impl<T> FmtForward for T
impl<T> FmtForward for T
Source§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
Causes
self
to use its Binary
implementation when Debug
-formatted.Source§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
Causes
self
to use its Display
implementation when
Debug
-formatted.Source§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
Causes
self
to use its LowerExp
implementation when
Debug
-formatted.Source§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
Causes
self
to use its LowerHex
implementation when
Debug
-formatted.Source§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
Causes
self
to use its Octal
implementation when Debug
-formatted.Source§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
Causes
self
to use its Pointer
implementation when
Debug
-formatted.Source§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
Causes
self
to use its UpperExp
implementation when
Debug
-formatted.Source§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
Causes
self
to use its UpperHex
implementation when
Debug
-formatted.Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
Source§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
Pipes by value. This is generally the method you want to use. Read more
Source§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
Borrows
self
and passes that borrow into the pipe function. Read moreSource§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
Mutably borrows
self
and passes that borrow into the pipe function. Read moreSource§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
Source§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
Source§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
Borrows
self
, then passes self.as_ref()
into the pipe function.Source§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
Mutably borrows
self
, then passes self.as_mut()
into the pipe
function.Source§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
Borrows
self
, then passes self.deref()
into the pipe function.Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<F, Fp, Pt, FC> Selectable<F, Reduced<Pt, Fp>> for FC
impl<F, Fp, Pt, FC> Selectable<F, Reduced<Pt, Fp>> for FC
Source§impl<T> Tap for T
impl<T> Tap for T
Source§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Immutable access to the
Borrow<B>
of a value. Read moreSource§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
Mutable access to the
BorrowMut<B>
of a value. Read moreSource§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
Immutable access to the
AsRef<R>
view of a value. Read moreSource§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
Mutable access to the
AsMut<R>
view of a value. Read moreSource§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Immutable access to the
Deref::Target
of a value. Read moreSource§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Mutable access to the
Deref::Target
of a value. Read moreSource§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
Calls
.tap()
only in debug builds, and is erased in release builds.Source§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
Calls
.tap_mut()
only in debug builds, and is erased in release
builds.Source§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
Calls
.tap_borrow()
only in debug builds, and is erased in release
builds.Source§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
Calls
.tap_borrow_mut()
only in debug builds, and is erased in release
builds.Source§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
Calls
.tap_ref()
only in debug builds, and is erased in release
builds.Source§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
Calls
.tap_ref_mut()
only in debug builds, and is erased in release
builds.Source§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
Calls
.tap_deref()
only in debug builds, and is erased in release
builds.