Struct sp1_core::utils::BabyBearPoseidon2Inner

pub struct BabyBearPoseidon2Inner {
    pub perm: InnerPerm,
    pub pcs: InnerPcs,
}

The recursion config used for recursive reduce circuit.

Fields

perm: InnerPerm

pcs: InnerPcs

Implementations

impl BabyBearPoseidon2Inner

pub fn new() -> Self

Trait Implementations

impl Clone for BabyBearPoseidon2Inner

fn clone(&self) -> Self

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Default for BabyBearPoseidon2Inner

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for BabyBearPoseidon2Inner

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl From<PhantomData<BabyBearPoseidon2Inner>> for BabyBearPoseidon2Inner

fn from(_: PhantomData<BabyBearPoseidon2Inner>) -> Self

Converts to this type from the input type.

impl Serialize for BabyBearPoseidon2Inner

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl StarkGenericConfig for BabyBearPoseidon2Inner

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>>>

The PCS used to commit to trace polynomials.

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>

The challenger (Fiat-Shamir) implementation used.

fn pcs(&self) -> &Self::Pcs

Get the PCS used by this configuration.

fn challenger(&self) -> Self::Challenger

Initialize a new challenger.