Struct sp1_core::utils::BabyBearPoseidon2
source · pub struct BabyBearPoseidon2 {
pub perm: Perm,
/* private fields */
}Fields§
§perm: PermImplementations§
source§impl BabyBearPoseidon2
impl BabyBearPoseidon2
pub fn new() -> Self
pub fn compressed() -> Self
Trait Implementations§
source§impl Clone for BabyBearPoseidon2
impl Clone for BabyBearPoseidon2
source§impl Default for BabyBearPoseidon2
impl Default for BabyBearPoseidon2
source§impl<'de> Deserialize<'de> for BabyBearPoseidon2
impl<'de> Deserialize<'de> for BabyBearPoseidon2
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 From<PhantomData<BabyBearPoseidon2>> for BabyBearPoseidon2
impl From<PhantomData<BabyBearPoseidon2>> for BabyBearPoseidon2
source§fn from(_: PhantomData<BabyBearPoseidon2>) -> Self
fn from(_: PhantomData<BabyBearPoseidon2>) -> Self
Converts to this type from the input type.
source§impl Serialize for BabyBearPoseidon2
impl Serialize for BabyBearPoseidon2
Implement serialization manually instead of using serde to avoid cloing the config.
source§impl StarkGenericConfig for BabyBearPoseidon2
impl StarkGenericConfig for BabyBearPoseidon2
type Val = BabyBear
type Domain = <TwoAdicFriPcs<BabyBear, Radix2DitParallel, FieldMerkleTreeMmcs<<BabyBear as Field>::Packing, <BabyBear as Field>::Packing, PaddingFreeSponge<Poseidon2<BabyBear, Poseidon2ExternalMatrixGeneral, DiffusionMatrixBabyBear, 16, 7>, 16, 8, 8>, TruncatedPermutation<Poseidon2<BabyBear, Poseidon2ExternalMatrixGeneral, DiffusionMatrixBabyBear, 16, 7>, 2, 8, 16>, 8>, ExtensionMmcs<BabyBear, BinomialExtensionField<BabyBear, 4>, FieldMerkleTreeMmcs<<BabyBear as Field>::Packing, <BabyBear as Field>::Packing, PaddingFreeSponge<Poseidon2<BabyBear, Poseidon2ExternalMatrixGeneral, DiffusionMatrixBabyBear, 16, 7>, 16, 8, 8>, TruncatedPermutation<Poseidon2<BabyBear, Poseidon2ExternalMatrixGeneral, DiffusionMatrixBabyBear, 16, 7>, 2, 8, 16>, 8>>> as Pcs<BinomialExtensionField<BabyBear, 4>, DuplexChallenger<BabyBear, Poseidon2<BabyBear, Poseidon2ExternalMatrixGeneral, DiffusionMatrixBabyBear, 16, 7>, 16, 8>>>::Domain
§type Pcs = TwoAdicFriPcs<BabyBear, Radix2DitParallel, FieldMerkleTreeMmcs<<BabyBear as Field>::Packing, <BabyBear as Field>::Packing, PaddingFreeSponge<Poseidon2<BabyBear, Poseidon2ExternalMatrixGeneral, DiffusionMatrixBabyBear, 16, 7>, 16, 8, 8>, TruncatedPermutation<Poseidon2<BabyBear, Poseidon2ExternalMatrixGeneral, DiffusionMatrixBabyBear, 16, 7>, 2, 8, 16>, 8>, ExtensionMmcs<BabyBear, BinomialExtensionField<BabyBear, 4>, FieldMerkleTreeMmcs<<BabyBear as Field>::Packing, <BabyBear as Field>::Packing, PaddingFreeSponge<Poseidon2<BabyBear, Poseidon2ExternalMatrixGeneral, DiffusionMatrixBabyBear, 16, 7>, 16, 8, 8>, TruncatedPermutation<Poseidon2<BabyBear, Poseidon2ExternalMatrixGeneral, DiffusionMatrixBabyBear, 16, 7>, 2, 8, 16>, 8>>>
type Pcs = TwoAdicFriPcs<BabyBear, Radix2DitParallel, FieldMerkleTreeMmcs<<BabyBear as Field>::Packing, <BabyBear as Field>::Packing, PaddingFreeSponge<Poseidon2<BabyBear, Poseidon2ExternalMatrixGeneral, DiffusionMatrixBabyBear, 16, 7>, 16, 8, 8>, TruncatedPermutation<Poseidon2<BabyBear, Poseidon2ExternalMatrixGeneral, DiffusionMatrixBabyBear, 16, 7>, 2, 8, 16>, 8>, ExtensionMmcs<BabyBear, BinomialExtensionField<BabyBear, 4>, FieldMerkleTreeMmcs<<BabyBear as Field>::Packing, <BabyBear as Field>::Packing, PaddingFreeSponge<Poseidon2<BabyBear, Poseidon2ExternalMatrixGeneral, DiffusionMatrixBabyBear, 16, 7>, 16, 8, 8>, TruncatedPermutation<Poseidon2<BabyBear, Poseidon2ExternalMatrixGeneral, DiffusionMatrixBabyBear, 16, 7>, 2, 8, 16>, 8>>>
The PCS used to commit to trace polynomials.
§type Challenge = BinomialExtensionField<BabyBear, 4>
type Challenge = BinomialExtensionField<BabyBear, 4>
The field from which most random challenges are drawn.
§type Challenger = DuplexChallenger<BabyBear, Poseidon2<BabyBear, Poseidon2ExternalMatrixGeneral, DiffusionMatrixBabyBear, 16, 7>, 16, 8>
type Challenger = DuplexChallenger<BabyBear, Poseidon2<BabyBear, Poseidon2ExternalMatrixGeneral, DiffusionMatrixBabyBear, 16, 7>, 16, 8>
The challenger (Fiat-Shamir) implementation used.
source§fn challenger(&self) -> Self::Challenger
fn challenger(&self) -> Self::Challenger
Initialize a new challenger.
Auto Trait Implementations§
impl Freeze for BabyBearPoseidon2
impl RefUnwindSafe for BabyBearPoseidon2
impl Send for BabyBearPoseidon2
impl Sync for BabyBearPoseidon2
impl Unpin for BabyBearPoseidon2
impl UnwindSafe for BabyBearPoseidon2
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,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit)source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§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