pub struct ProverSumchecked<'a, Zt: ZincTypes<D, FD>, U: Uair, C: BaseFieldConfig, const D: usize, const FD: usize> { /* private fields */ }Expand description
After step 5 (sumcheck).
Implementations§
Source§impl<'a, Zt, U, C, const D: usize, const FD: usize> ProverSumchecked<'a, Zt, U, C, D, FD>where
Zt: ZincTypes<D, FD>,
Zt::Int: ProjectableToField<C>,
Zt::CombR: MulByScalar<Zt::Chal>,
<Zt::ArbitraryZt as ZipTypes>::Eval: ProjectableToField<C>,
U: Uair<Prime = Zt::Fmod> + 'static,
C: BaseFieldConfig<Integer = Zt::Fmod> + ProjectPrimitiveIntegersWithConfig + ProjectElementWithConfig<Zt::Int> + ProjectElementWithConfig<Zt::CombR> + ProjectElementWithConfig<Zt::Chal> + 'static,
C::Integer: ConstTranscribable,
impl<'a, Zt, U, C, const D: usize, const FD: usize> ProverSumchecked<'a, Zt, U, C, D, FD>where
Zt: ZincTypes<D, FD>,
Zt::Int: ProjectableToField<C>,
Zt::CombR: MulByScalar<Zt::Chal>,
<Zt::ArbitraryZt as ZipTypes>::Eval: ProjectableToField<C>,
U: Uair<Prime = Zt::Fmod> + 'static,
C: BaseFieldConfig<Integer = Zt::Fmod> + ProjectPrimitiveIntegersWithConfig + ProjectElementWithConfig<Zt::Int> + ProjectElementWithConfig<Zt::CombR> + ProjectElementWithConfig<Zt::Chal> + 'static,
C::Integer: ConstTranscribable,
Sourcepub fn step6_multipoint_eval(
self,
) -> Result<ProverMultipointEvaled<'a, Zt, U, C, D, FD>, ProtocolError<C::Element>>
pub fn step6_multipoint_eval( self, ) -> Result<ProverMultipointEvaled<'a, Zt, U, C, D, FD>, ProtocolError<C::Element>>
Step 6: Multi-point evaluation sumcheck. Combines up_evals and
down_evals at r* into a single evaluation point r_0.
Only the sumcheck proof is sent; scalar evaluations at r_0 are derived from the
polynomial-valued lifted_evals in Step 7.
When the booleanity argument ran (witness binary-poly columns
present), the multipoint-eval inputs are extended with one extra
$\alpha’$-projected column MLE and one extra scalar up_eval
$c_j = \sum_i b_{j,i},(\alpha’)^{i}$ per witness binary-poly column,
placed at indices [num_total_cols, num_total_cols + num_wit_bin).
On the Q-family these carry the real bit-slice bridge claim; on the
per-prime families they are zero-padded so all families share
the same column layout (UAIR rule D6: binary witness columns live
only in Q[X], so per-prime families have no booleanity-bridge
claim to make there). The shared layout lets a single $(n+1)$-family
lockstep MP-eval produce a single shared $r_0$ across all families,
which Phases H/I rely on for the lift-to-$Z$ + $q’‘$-anchored
PCS open. No ShiftSpec references those indices, so
down_evals/shifts are untouched and shifted booleanity is
inherited from the un-shifted column (which continues to live at
its original $\psi_a$-projected slot).
See the module-level BooleanityChecker docs for the soundness
argument (Schwartz-Zippel at $\alpha’$ + MP/PCS chain at $r_0$).
Trait Implementations§
Source§impl<'a, Zt: Clone + ZincTypes<D, FD>, U: Clone + Uair, C: Clone + BaseFieldConfig, const D: usize, const FD: usize> Clone for ProverSumchecked<'a, Zt, U, C, D, FD>where
C::Element: Clone,
impl<'a, Zt: Clone + ZincTypes<D, FD>, U: Clone + Uair, C: Clone + BaseFieldConfig, const D: usize, const FD: usize> Clone for ProverSumchecked<'a, Zt, U, C, D, FD>where
C::Element: Clone,
Source§fn clone(&self) -> ProverSumchecked<'a, Zt, U, C, D, FD>
fn clone(&self) -> ProverSumchecked<'a, Zt, U, C, D, FD>
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreAuto Trait Implementations§
impl<'a, Zt, U, C, const D: usize, const FD: usize> Freeze for ProverSumchecked<'a, Zt, U, C, D, FD>
impl<'a, Zt, U, C, const D: usize, const FD: usize> RefUnwindSafe for ProverSumchecked<'a, Zt, U, C, D, FD>where
C: RefUnwindSafe,
<C as SetConfig>::Element: RefUnwindSafe,
<Zt as ZincTypes<D, FD>>::BinaryLc: RefUnwindSafe,
<Zt as ZincTypes<D, FD>>::ArbitraryLc: RefUnwindSafe,
<Zt as ZincTypes<D, FD>>::IntLc: RefUnwindSafe,
U: RefUnwindSafe,
<Zt as ZincTypes<D, FD>>::BinaryZt: RefUnwindSafe,
<Zt as ZincTypes<D, FD>>::ArbitraryZt: RefUnwindSafe,
<Zt as ZincTypes<D, FD>>::IntZt: RefUnwindSafe,
<Zt as ZincTypes<D, FD>>::Fmod: RefUnwindSafe,
<Zt as ZincTypes<D, FD>>::Int: RefUnwindSafe,
<<Zt as ZincTypes<D, FD>>::BinaryZt as ZipTypes>::Cw: RefUnwindSafe,
<<Zt as ZincTypes<D, FD>>::ArbitraryZt as ZipTypes>::Cw: RefUnwindSafe,
<<Zt as ZincTypes<D, FD>>::IntZt as ZipTypes>::Cw: RefUnwindSafe,
impl<'a, Zt, U, C, const D: usize, const FD: usize> Send for ProverSumchecked<'a, Zt, U, C, D, FD>where
U: Send,
impl<'a, Zt, U, C, const D: usize, const FD: usize> Sync for ProverSumchecked<'a, Zt, U, C, D, FD>where
U: Sync,
impl<'a, Zt, U, C, const D: usize, const FD: usize> Unpin for ProverSumchecked<'a, Zt, U, C, D, FD>where
C: Unpin,
<C as SetConfig>::Element: Unpin,
U: Unpin,
<Zt as ZincTypes<D, FD>>::Fmod: Unpin,
<Zt as ZincTypes<D, FD>>::Int: Unpin,
<<Zt as ZincTypes<D, FD>>::BinaryZt as ZipTypes>::Cw: Unpin,
<<Zt as ZincTypes<D, FD>>::ArbitraryZt as ZipTypes>::Cw: Unpin,
<<Zt as ZincTypes<D, FD>>::IntZt as ZipTypes>::Cw: Unpin,
impl<'a, Zt, U, C, const D: usize, const FD: usize> UnsafeUnpin for ProverSumchecked<'a, Zt, U, C, D, FD>where
C: UnsafeUnpin,
<C as SetConfig>::Element: UnsafeUnpin,
impl<'a, Zt, U, C, const D: usize, const FD: usize> UnwindSafe for ProverSumchecked<'a, Zt, U, C, D, FD>where
C: UnwindSafe,
<C as SetConfig>::Element: UnwindSafe,
<Zt as ZincTypes<D, FD>>::BinaryLc: RefUnwindSafe,
<Zt as ZincTypes<D, FD>>::ArbitraryLc: RefUnwindSafe,
<Zt as ZincTypes<D, FD>>::IntLc: RefUnwindSafe,
U: UnwindSafe,
<Zt as ZincTypes<D, FD>>::BinaryZt: RefUnwindSafe,
<Zt as ZincTypes<D, FD>>::ArbitraryZt: RefUnwindSafe,
<Zt as ZincTypes<D, FD>>::IntZt: RefUnwindSafe,
<Zt as ZincTypes<D, FD>>::Fmod: UnwindSafe,
<Zt as ZincTypes<D, FD>>::Int: RefUnwindSafe + UnwindSafe,
<<Zt as ZincTypes<D, FD>>::BinaryZt as ZipTypes>::Cw: UnwindSafe,
<<Zt as ZincTypes<D, FD>>::ArbitraryZt as ZipTypes>::Cw: UnwindSafe,
<<Zt as ZincTypes<D, FD>>::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>
§fn as_ref_uninit(&self) -> &<T as AsMaybeUninit>::Uninit
fn as_ref_uninit(&self) -> &<T as AsMaybeUninit>::Uninit
&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
&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
§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
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
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>
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>
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