pub struct IdentityGate<F: Field> {
layer_id: LayerId,
wiring: Vec<(u32, u32)>,
source_mle: DenseMle<F>,
beta_g2_vec: Option<Vec<BetaValues<F>>>,
g1_challenges_vec: Option<Vec<Vec<F>>>,
challenges_vec: Option<Vec<Vec<F>>>,
a_hg_mle_phase_1: Option<DenseMle<F>>,
total_num_vars: usize,
num_dataparallel_vars: usize,
}Expand description
The Identity Gate struct allows being able to select specific indices
from the source_mle that are not necessarily regular.
Fields§
§layer_id: LayerIdLayer ID for this gate.
wiring: Vec<(u32, u32)>Wiring tuples are of the form (dest_idx, src_idx), which specifies
that we would like the value in the src_idx of the source_mle to
be copied into dest_idx of the output MLE.
source_mle: DenseMle<F>The MLE from which we are selecting the indices.
beta_g2_vec: Option<Vec<BetaValues<F>>>The BetaValues struct which enumerates the incoming claim’s challenge points on the dataparallel vars of the MLE.
g1_challenges_vec: Option<Vec<Vec<F>>>The nondataparallel claim points in the layer.
challenges_vec: Option<Vec<Vec<F>>>The claim points in the layer (both nondataparallel and dataparallel) challenges.
a_hg_mle_phase_1: Option<DenseMle<F>>The MLE initialized in phase 1, which contains the beta values over
g1_challenges folded into the wiring function.
total_num_vars: usizeThe total number of variables in the layer.
num_dataparallel_vars: usizeThe number of vars representing the number of “dataparallel” copies of the circuit.
Implementations§
Source§impl<F: Field> IdentityGate<F>
impl<F: Field> IdentityGate<F>
Sourcepub fn new(
layer_id: LayerId,
wiring: Vec<(u32, u32)>,
mle: DenseMle<F>,
total_num_vars: usize,
num_dataparallel_vars: usize,
) -> IdentityGate<F>
pub fn new( layer_id: LayerId, wiring: Vec<(u32, u32)>, mle: DenseMle<F>, total_num_vars: usize, num_dataparallel_vars: usize, ) -> IdentityGate<F>
Create a new IdentityGate struct.
fn append_leaf_mles_to_transcript( &self, transcript_writer: &mut impl ProverTranscript<F>, )
Sourcefn init_phase_1(&mut self, challenge: &[F], fully_bound_beta_g2: F)
fn init_phase_1(&mut self, challenge: &[F], fully_bound_beta_g2: F)
Initialize the bookkeeping table necessary for phase 1, which is the binding of the non-dataparallel variables in the source MLE. This is the initialization function used when we are doing interpolative claim aggregation.
For the random coefficients, we simply use the fully bound value of beta_g2 since this is the value that scales all of the sumcheck evaluations.
Sourcefn init_phase_1_rlc(&mut self, challenges: &[&[F]], random_coefficients: &[F])
fn init_phase_1_rlc(&mut self, challenges: &[&[F]], random_coefficients: &[F])
Initialize the bookkeeping table necessary for phase 1, which is the binding of the non-dataparallel variables in the source MLE. This is the initialization function used when we are doing RLC claim aggregation.
Trait Implementations§
Source§impl<F: Clone + Field> Clone for IdentityGate<F>
impl<F: Clone + Field> Clone for IdentityGate<F>
Source§fn clone(&self) -> IdentityGate<F>
fn clone(&self) -> IdentityGate<F>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl<F: Debug + Field> Debug for IdentityGate<F>
impl<F: Debug + Field> Debug for IdentityGate<F>
Source§impl<'de, F> Deserialize<'de> for IdentityGate<F>where
F: Field,
impl<'de, F> Deserialize<'de> for IdentityGate<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>,
Source§impl<F: Field> Error for IdentityGate<F>
impl<F: Field> Error for IdentityGate<F>
1.30.0 · Source§fn source(&self) -> Option<&(dyn Error + 'static)>
fn source(&self) -> Option<&(dyn Error + 'static)>
1.0.0 · Source§fn description(&self) -> &str
fn description(&self) -> &str
Source§impl<F: Field> From<IdentityGate<F>> for LayerEnum<F>
impl<F: Field> From<IdentityGate<F>> for LayerEnum<F>
Source§fn from(var: IdentityGate<F>) -> LayerEnum<F>
fn from(var: IdentityGate<F>) -> LayerEnum<F>
Source§impl<F: Field> Layer<F> for IdentityGate<F>
The layer trait implementation for IdentityGate, which has the proving
functionality as well as the modular functions for each round of sumcheck.
impl<F: Field> Layer<F> for IdentityGate<F>
The layer trait implementation for IdentityGate, which has the proving functionality as well as the modular functions for each round of sumcheck.
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<()>
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<()>
Source§fn initialize_rlc(&mut self, random_coefficients: &[F], claims: &[&RawClaim<F>])
fn initialize_rlc(&mut self, random_coefficients: &[F], claims: &[&RawClaim<F>])
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>>
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<()>
challenge to the bit.
labeled with that round_index.Source§fn sumcheck_round_indices(&self) -> Vec<usize>
fn sumcheck_round_indices(&self) -> Vec<usize>
Source§fn max_degree(&self) -> usize
fn max_degree(&self) -> usize
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>
Auto Trait Implementations§
impl<F> Freeze for IdentityGate<F>where
F: Freeze,
impl<F> RefUnwindSafe for IdentityGate<F>where
F: RefUnwindSafe,
impl<F> Send for IdentityGate<F>
impl<F> Sync for IdentityGate<F>
impl<F> Unpin for IdentityGate<F>where
F: Unpin,
impl<F> UnwindSafe for IdentityGate<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
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,
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,
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,
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,
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,
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,
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,
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,
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,
§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>
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§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,
§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,
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,
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
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
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
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
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
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
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
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
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
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
.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
.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
.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
.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
.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
.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
.tap_deref() only in debug builds, and is erased in release
builds.