pub struct MatMult<F: Field> {
layer_id: LayerId,
matrix_a: Matrix<F>,
matrix_b: Matrix<F>,
num_vars_middle_ab: usize,
}Expand description
Used to represent a matrix multiplication layer.
#Attributes:
layer_id- the LayerId of this MatMult layer.matrix_a- the lefthand side matrix in the multiplication.matrix_b- the righthand side matrix in the multiplication.
Fields§
§layer_id: LayerId§matrix_a: Matrix<F>§matrix_b: Matrix<F>§num_vars_middle_ab: usizeImplementations§
Source§impl<F: Field> MatMult<F>
impl<F: Field> MatMult<F>
Sourcepub fn new(
layer_id: LayerId,
matrix_a: Matrix<F>,
matrix_b: Matrix<F>,
) -> MatMult<F>
pub fn new( layer_id: LayerId, matrix_a: Matrix<F>, matrix_b: Matrix<F>, ) -> MatMult<F>
Create a new matrix multiplication layer.
Sourcefn pre_processing_step(&mut self, claim_a: Vec<F>, claim_b: Vec<F>)
fn pre_processing_step(&mut self, claim_a: Vec<F>, claim_b: Vec<F>)
The step, according to Tha13, which makes the matmult algorithm super-efficient.
Given the claim on the output of the matrix multiplication, we bind
the variables representing the “rows” of matrix_a to the first
log(num_rows_a) vars in this claim, and we bind the variables
representing the “columns” of matrix_b to the last log(num_cols_b)
vars in the claim.
#Arguments
claim_a: the first log_num_rows variables of the claim made on the MLE representing the output of this layer.claim_b: the last log_num_cols variables of the claim made on the MLE representing the output of this layer.
fn append_leaf_mles_to_transcript( &self, transcript_writer: &mut impl ProverTranscript<F>, )
Trait Implementations§
Source§impl<'de, F> Deserialize<'de> for MatMult<F>where
F: Field,
impl<'de, F> Deserialize<'de> for MatMult<F>where
F: Field,
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl<F: Field> Layer<F> for MatMult<F>
impl<F: Field> Layer<F> for MatMult<F>
Source§fn get_post_sumcheck_layer(
&self,
_round_challenges: &[F],
_claim_challenges: &[&[F]],
_random_coefficients: &[F],
) -> PostSumcheckLayer<F, F>
fn get_post_sumcheck_layer( &self, _round_challenges: &[F], _claim_challenges: &[&[F]], _random_coefficients: &[F], ) -> PostSumcheckLayer<F, F>
Return the PostSumcheckLayer, panicking if either of the MLE refs is not fully bound. Relevant for the Hyrax IP, where we need commitments to fully bound MLEs as well as their intermediate products.
Source§fn get_claims(&self) -> Result<Vec<Claim<F>>>
fn get_claims(&self) -> Result<Vec<Claim<F>>>
Get the claims that this layer makes on other layers
Source§fn prove(
&mut self,
claims: &[&RawClaim<F>],
transcript_writer: &mut impl ProverTranscript<F>,
) -> Result<()>
fn prove( &mut self, claims: &[&RawClaim<F>], transcript_writer: &mut impl ProverTranscript<F>, ) -> Result<()>
Tries to prove
claims for this layer. There is only a single
aggregated claim if our
[shared_types::config::ClaimAggregationStrategy] is
[shared_types::config::ClaimAggregationStrategy::Interpolative],
otherwise we have several claims we take the random linear
combination over. Read moreSource§fn initialize(&mut self, claim_point: &[F]) -> Result<()>
fn initialize(&mut self, claim_point: &[F]) -> Result<()>
Initialize this layer and perform any necessary pre-computation: beta
table, number of rounds, etc.
Source§fn initialize_rlc(
&mut self,
_random_coefficients: &[F],
_claims: &[&RawClaim<F>],
)
fn initialize_rlc( &mut self, _random_coefficients: &[F], _claims: &[&RawClaim<F>], )
Transforms the underlying expression in the layer to the expression that
must be sumchecked over to verify claims combined using the RLC claim
aggregation method presented in Libra (2019).
Source§fn compute_round_sumcheck_message(
&mut self,
round_index: usize,
_random_coefficients: &[F],
) -> Result<Vec<F>>
fn compute_round_sumcheck_message( &mut self, round_index: usize, _random_coefficients: &[F], ) -> Result<Vec<F>>
Return the evaluations of the univariate polynomial generated during this round of sumcheck. Read more
Source§fn bind_round_variable(
&mut self,
round_index: usize,
challenge: F,
) -> Result<()>
fn bind_round_variable( &mut self, round_index: usize, challenge: F, ) -> Result<()>
Mutate the underlying bookkeeping tables to “bind” the given
challenge to the bit.
labeled with that round_index.Source§fn sumcheck_round_indices(&self) -> Vec<usize>
fn sumcheck_round_indices(&self) -> Vec<usize>
The list of sumcheck rounds this layer will prove, by index.
Source§fn max_degree(&self) -> usize
fn max_degree(&self) -> usize
The maximum degree for any univariate in the sumcheck protocol.
Auto Trait Implementations§
impl<F> Freeze for MatMult<F>where
F: Freeze,
impl<F> RefUnwindSafe for MatMult<F>where
F: RefUnwindSafe,
impl<F> Send for MatMult<F>
impl<F> Sync for MatMult<F>
impl<F> Unpin for MatMult<F>where
F: Unpin,
impl<F> UnwindSafe for MatMult<F>where
F: 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,
§impl<T> Conv for T
impl<T> Conv for T
§impl<T> FmtForward for T
impl<T> FmtForward for T
§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.§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.§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.§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.§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.§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.§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.§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.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
Formats each item in a sequence. 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§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§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
§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 more§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 more§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
§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
§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.§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.§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.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> Tap for T
impl<T> Tap for T
§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 more§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 more§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 more§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 more§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 more§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 more§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.§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.§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.§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.§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.§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.§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.