pub struct ProductProver<P: PackedField, Data: BufferData<P>> { /* private fields */ }Expand description
The state of one claim $\sum_x u^\infty(x) \cdot w^\infty(x) = s$.
batch_prove drives these with random batching weights. A caller that needs another
combination of the round polynomials drives them itself.
Implementations§
Source§impl<F, P, Data> ProductProver<P, Data>
impl<F, P, Data> ProductProver<P, Data>
Sourcepub fn new(tables: [FieldBuffer<P, Data>; 2]) -> Self
pub fn new(tables: [FieldBuffer<P, Data>; 2]) -> Self
Creates the prover of $\langle u, w \rangle$ for the tables [u, w].
§Preconditions
- the two tables must have the same number of variables
Sourcepub fn round_coeffs(&self) -> RoundCoeffs<F>
pub fn round_coeffs(&self) -> RoundCoeffs<F>
The round polynomial in the top variable $X$.
With $u = u_0 + X u_1$ split on the top variable, and likewise $w$,
$$ R(X) = \langle u_0, w_0 \rangle + X (\langle u_0, w_1 \rangle + \langle u_1, w_0 \rangle) + X^2 \langle u_1, w_1 \rangle $$
and $R(0) = s - R(\infty)$ comes from the claim.
Auto Trait Implementations§
impl<P, Data> Freeze for ProductProver<P, Data>
impl<P, Data> RefUnwindSafe for ProductProver<P, Data>
impl<P, Data> Send for ProductProver<P, Data>where
Data: Send,
impl<P, Data> Sync for ProductProver<P, Data>where
Data: Sync,
impl<P, Data> Unpin for ProductProver<P, Data>
impl<P, Data> UnsafeUnpin for ProductProver<P, Data>
impl<P, Data> UnwindSafe for ProductProver<P, Data>
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
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§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 more