pub struct ProverBase<'a, Zt: ZincTypes<D>, U: Uair, F: PrimeField, const D: usize> { /* private fields */ }Expand description
Persistent prover infrastructure carried across every step: the Fiat-Shamir transcript, PCS parameters/hints/commitments, and trace reference.
Implementations§
Source§impl<'a, Zt, U, F, const D: usize> ProverBase<'a, Zt, U, F, D>where
Zt: ZincTypes<D>,
Zt::Int: ProjectableToField<F>,
<Zt::ArbitraryZt as ZipTypes>::Eval: ProjectableToField<F>,
U: Uair + 'static,
F: InnerTransparentField + FromPrimitiveWithConfig + for<'b> FromWithConfig<&'b Zt::Int> + for<'b> FromWithConfig<&'b Zt::CombR> + for<'b> FromWithConfig<&'b Zt::Chal> + for<'b> MulByScalar<&'b F> + FromRef<F> + Send + Sync + 'static,
F::Inner: ConstIntSemiring + ConstTranscribable + FromRef<Zt::Fmod> + Send + Sync + Zero + Default,
F::Modulus: ConstTranscribable + FromRef<Zt::Fmod>,
impl<'a, Zt, U, F, const D: usize> ProverBase<'a, Zt, U, F, D>where
Zt: ZincTypes<D>,
Zt::Int: ProjectableToField<F>,
<Zt::ArbitraryZt as ZipTypes>::Eval: ProjectableToField<F>,
U: Uair + 'static,
F: InnerTransparentField + FromPrimitiveWithConfig + for<'b> FromWithConfig<&'b Zt::Int> + for<'b> FromWithConfig<&'b Zt::CombR> + for<'b> FromWithConfig<&'b Zt::Chal> + for<'b> MulByScalar<&'b F> + FromRef<F> + Send + Sync + 'static,
F::Inner: ConstIntSemiring + ConstTranscribable + FromRef<Zt::Fmod> + Send + Sync + Zero + Default,
F::Modulus: ConstTranscribable + FromRef<Zt::Fmod>,
Sourcepub fn step1_combined<S: Fn(&U::Scalar, &F::Config) -> DynamicPolynomialF<F>>(
self,
project_scalar: S,
) -> Result<ProverProjectedCombined<'a, Zt, U, F, D>, ProtocolError<F, U::Ideal>>
pub fn step1_combined<S: Fn(&U::Scalar, &F::Config) -> DynamicPolynomialF<F>>( self, project_scalar: S, ) -> Result<ProverProjectedCombined<'a, Zt, U, F, D>, ProtocolError<F, U::Ideal>>
Step 1 (combined / row-major): Prime projection
(\phi_q: Z[X] -> F_q[X]). Samples a random prime, projects the
full trace and scalars using the row-major layout.
Works for both linear and non-linear constraints.
Sourcepub fn step1_mle_first<S: Fn(&U::Scalar, &F::Config) -> DynamicPolynomialF<F>>(
self,
project_scalar: S,
) -> Result<ProverProjectedMleFirst<'a, Zt, U, F, D>, ProtocolError<F, U::Ideal>>
pub fn step1_mle_first<S: Fn(&U::Scalar, &F::Config) -> DynamicPolynomialF<F>>( self, project_scalar: S, ) -> Result<ProverProjectedMleFirst<'a, Zt, U, F, D>, ProtocolError<F, U::Ideal>>
Step 1 (MLE-first / column-major): Prime projection
(\phi_q: Z[X] -> F_q[X]). Samples a random prime, projects the
full trace and scalars using the column-major layout.
Only suitable for linear constraints.
Trait Implementations§
Source§impl<'a, Zt: Clone + ZincTypes<D>, U: Clone + Uair, F: Clone + PrimeField, const D: usize> Clone for ProverBase<'a, Zt, U, F, D>
impl<'a, Zt: Clone + ZincTypes<D>, U: Clone + Uair, F: Clone + PrimeField, const D: usize> Clone for ProverBase<'a, Zt, U, F, D>
Source§fn clone(&self) -> ProverBase<'a, Zt, U, F, D>
fn clone(&self) -> ProverBase<'a, Zt, U, F, D>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl<'a, Zt, U, F, const D: usize> Freeze for ProverBase<'a, Zt, U, F, D>
impl<'a, Zt, U, F, const D: usize> RefUnwindSafe for ProverBase<'a, Zt, U, F, D>where
<Zt as ZincTypes<D>>::BinaryLc: RefUnwindSafe,
<Zt as ZincTypes<D>>::ArbitraryLc: RefUnwindSafe,
<Zt as ZincTypes<D>>::IntLc: RefUnwindSafe,
U: RefUnwindSafe,
F: RefUnwindSafe,
<Zt as ZincTypes<D>>::BinaryZt: RefUnwindSafe,
<Zt as ZincTypes<D>>::ArbitraryZt: RefUnwindSafe,
<Zt as ZincTypes<D>>::IntZt: RefUnwindSafe,
<Zt as ZincTypes<D>>::Int: RefUnwindSafe,
<<Zt as ZincTypes<D>>::BinaryZt as ZipTypes>::Cw: RefUnwindSafe,
<<Zt as ZincTypes<D>>::ArbitraryZt as ZipTypes>::Cw: RefUnwindSafe,
<<Zt as ZincTypes<D>>::IntZt as ZipTypes>::Cw: RefUnwindSafe,
impl<'a, Zt, U, F, const D: usize> Send for ProverBase<'a, Zt, U, F, D>where
U: Send,
impl<'a, Zt, U, F, const D: usize> Sync for ProverBase<'a, Zt, U, F, D>where
U: Sync,
impl<'a, Zt, U, F, const D: usize> Unpin for ProverBase<'a, Zt, U, F, D>
impl<'a, Zt, U, F, const D: usize> UnsafeUnpin for ProverBase<'a, Zt, U, F, D>
impl<'a, Zt, U, F, const D: usize> UnwindSafe for ProverBase<'a, Zt, U, F, D>where
<Zt as ZincTypes<D>>::BinaryLc: RefUnwindSafe,
<Zt as ZincTypes<D>>::ArbitraryLc: RefUnwindSafe,
<Zt as ZincTypes<D>>::IntLc: RefUnwindSafe,
U: UnwindSafe,
F: UnwindSafe,
<Zt as ZincTypes<D>>::BinaryZt: RefUnwindSafe,
<Zt as ZincTypes<D>>::ArbitraryZt: RefUnwindSafe,
<Zt as ZincTypes<D>>::IntZt: RefUnwindSafe,
<Zt as ZincTypes<D>>::Int: RefUnwindSafe,
<<Zt as ZincTypes<D>>::BinaryZt as ZipTypes>::Cw: UnwindSafe,
<<Zt as ZincTypes<D>>::ArbitraryZt as ZipTypes>::Cw: UnwindSafe,
<<Zt as ZincTypes<D>>::IntZt as ZipTypes>::Cw: UnwindSafe,
Blanket Implementations§
§impl<T> AsMaybeUninit for T
impl<T> AsMaybeUninit for T
§type Uninit = MaybeUninit<T>
type Uninit = MaybeUninit<T>
This type in its maybe-uninitialized form.
§fn as_ref_uninit(&self) -> &<T as AsMaybeUninit>::Uninit
fn as_ref_uninit(&self) -> &<T as AsMaybeUninit>::Uninit
Converts a
&self to its maybe-initialized equivalent.§unsafe fn as_mut_uninit(&mut self) -> &mut <T as AsMaybeUninit>::Uninit
unsafe fn as_mut_uninit(&mut self) -> &mut <T as AsMaybeUninit>::Uninit
Converts a
&mut T to its maybe-initialized equivalent. Read more§unsafe fn raw_as_uninit<'a>(raw: *const T) -> &'a <T as AsMaybeUninit>::Uninit
unsafe fn raw_as_uninit<'a>(raw: *const T) -> &'a <T as AsMaybeUninit>::Uninit
Converts a raw pointer to a reference to maybe-uninit. Read more
§unsafe fn raw_mut_as_uninit<'a>(
raw: *mut T,
) -> &'a mut <T as AsMaybeUninit>::Uninit
unsafe fn raw_mut_as_uninit<'a>( raw: *mut T, ) -> &'a mut <T as AsMaybeUninit>::Uninit
Converts a raw mutable pointer to a mutable reference to maybe-uninit. Read more
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§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 more