pub struct ProverEvalProjected<'a, Zt: ZincTypes<D, FD>, U: Uair, C: BaseFieldConfig, const D: usize, const FD: usize> { /* private fields */ }Expand description
After step 4 (eval projection). projected_scalars_fx has been consumed.
Implementations§
Source§impl<'a, Zt, U, C, const D: usize, const FD: usize> ProverEvalProjected<'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> ProverEvalProjected<'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 step5_sumcheck(
self,
) -> Result<ProverSumchecked<'a, Zt, U, C, D, FD>, ProtocolError<C::Element>>
pub fn step5_sumcheck( self, ) -> Result<ProverSumchecked<'a, Zt, U, C, D, FD>, ProtocolError<C::Element>>
Step 5: Combined CPR + Booleanity + Lookup multi-degree sumcheck over F_q.
Batches the CPR constraint claim (degree max_deg+2), the booleanity
argument (degree 3), and lookup groups (one per table type) into a
single sumcheck sharing one evaluation point r*. Produces
up_evals/down_evals (CPR), bit_slice_evals (booleanity), and
lookup auxiliary witnesses at r*.
After booleanity’s finalize_prover absorbs all committed and affine
bit_slice_evals into
the transcript, this step squeezes a fresh challenge $\alpha’$ and
stores it on ProverSumchecked. The actual Schwartz-Zippel bridge
is installed in step6_multipoint_eval, which appends one extra
$\alpha’$-projected witness-bin column MLE (and matching up_eval
$c_j = \sum_i b_{j,i} (\alpha’)^i$) per witness binary-poly column
to the multipoint-eval inputs. Unshifted affine virtuals are collapsed
at the same $\alpha’$ and checked directly by the verifier against
their source projections at $r^*$. Shifts continue to reference the
original $\psi_a$-projected witness-bin slot, so down_evals are
untouched: shifted booleanity is inherited from un-shifted
booleanity (same committed column).
The PCS chain (step6_multipoint_eval + lifted-evals + Zip+ open)
closes the bridge: at the random sumcheck output $r_0$,
$\overline{u_j}(\alpha’) = \widetilde{g_j}(r_0)$ pins the appended
column’s multilinear extension to the true $\alpha’$-projection
$g_j$ of the committed $u_j$, replacing the previous
underconstrained $\psi_a$ linear pin-down (sound only for $D=1$).
Trait Implementations§
Source§impl<'a, Zt: Clone + ZincTypes<D, FD>, U: Clone + Uair, C: Clone + BaseFieldConfig, const D: usize, const FD: usize> Clone for ProverEvalProjected<'a, Zt, U, C, D, FD>
impl<'a, Zt: Clone + ZincTypes<D, FD>, U: Clone + Uair, C: Clone + BaseFieldConfig, const D: usize, const FD: usize> Clone for ProverEvalProjected<'a, Zt, U, C, D, FD>
Source§fn clone(&self) -> ProverEvalProjected<'a, Zt, U, C, D, FD>
fn clone(&self) -> ProverEvalProjected<'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 ProverEvalProjected<'a, Zt, U, C, D, FD>where
C: Freeze,
impl<'a, Zt, U, C, const D: usize, const FD: usize> RefUnwindSafe for ProverEvalProjected<'a, Zt, U, C, D, FD>where
C: 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,
<C as SetConfig>::Element: RefUnwindSafe,
<U as Uair>::Scalar: 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 ProverEvalProjected<'a, Zt, U, C, D, FD>where
U: Send,
impl<'a, Zt, U, C, const D: usize, const FD: usize> Sync for ProverEvalProjected<'a, Zt, U, C, D, FD>where
U: Sync,
impl<'a, Zt, U, C, const D: usize, const FD: usize> Unpin for ProverEvalProjected<'a, Zt, U, C, D, FD>where
C: Unpin,
U: Unpin,
<Zt as ZincTypes<D, FD>>::Fmod: Unpin,
<C as SetConfig>::Element: Unpin,
<U as Uair>::Scalar: 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 ProverEvalProjected<'a, Zt, U, C, D, FD>where
C: UnsafeUnpin,
impl<'a, Zt, U, C, const D: usize, const FD: usize> UnwindSafe for ProverEvalProjected<'a, Zt, U, C, D, FD>where
C: UnwindSafe,
<U as Uair>::Scalar: 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