Type Alias GoldilocksPermutationConfig

pub type GoldilocksPermutationConfig<P> = StarkConfig<TwoAdicFriPcs<Goldilocks, Radix2DitParallel<Goldilocks>, MerkleTreeMmcs<<Goldilocks as Field>::Packing, <Goldilocks as Field>::Packing, PaddingFreeSponge<P, WIDTH, RATE, DIGEST_WIDTH>, TruncatedPermutation<P, 2, DIGEST_WIDTH, WIDTH>, DIGEST_WIDTH>, ExtensionMmcs<Goldilocks, BinomialExtensionField<Goldilocks, 2>, MerkleTreeMmcs<<Goldilocks as Field>::Packing, <Goldilocks as Field>::Packing, PaddingFreeSponge<P, WIDTH, RATE, DIGEST_WIDTH>, TruncatedPermutation<P, 2, DIGEST_WIDTH, WIDTH>, DIGEST_WIDTH>>>, FriLogUpPhase<Goldilocks, BinomialExtensionField<Goldilocks, 2>, Challenger<P>>, BinomialExtensionField<Goldilocks, 2>, Challenger<P>>;

Aliased Type

struct GoldilocksPermutationConfig<P> { /* private fields */ }

Implementations

impl<Pcs, RapPhaseSeq, Challenge, Challenger> StarkConfig<Pcs, RapPhaseSeq, Challenge, Challenger>

pub const fn new( pcs: Pcs, rap_phase: RapPhaseSeq, ) -> StarkConfig<Pcs, RapPhaseSeq, Challenge, Challenger>

Trait Implementations

impl<Pcs, RapPhaseSeq, Challenge, Challenger> Debug for StarkConfig<Pcs, RapPhaseSeq, Challenge, Challenger>

where Pcs: Debug, RapPhaseSeq: Debug, Challenge: Debug, Challenger: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<Pcs, Rps, Challenge, Challenger> StarkGenericConfig for StarkConfig<Pcs, Rps, Challenge, Challenger>

where Challenge: ExtensionField<<<Pcs as Pcs<Challenge, Challenger>>::Domain as PolynomialSpace>::Val>, Pcs: Pcs<Challenge, Challenger>, <Pcs as Pcs<Challenge, Challenger>>::Domain: Send + Sync, <Pcs as Pcs<Challenge, Challenger>>::Commitment: Send + Sync, <Pcs as Pcs<Challenge, Challenger>>::ProverData: Send + Sync, <Pcs as Pcs<Challenge, Challenger>>::Proof: Send + Sync, Rps: RapPhaseSeq<<<Pcs as Pcs<Challenge, Challenger>>::Domain as PolynomialSpace>::Val, Challenge, Challenger>, <Rps as RapPhaseSeq<<<Pcs as Pcs<Challenge, Challenger>>::Domain as PolynomialSpace>::Val, Challenge, Challenger>>::PartialProof: Send + Sync, <Rps as RapPhaseSeq<<<Pcs as Pcs<Challenge, Challenger>>::Domain as PolynomialSpace>::Val, Challenge, Challenger>>::PartialProvingKey: Send + Sync, Challenger: FieldChallenger<<<Pcs as Pcs<Challenge, Challenger>>::Domain as PolynomialSpace>::Val> + CanObserve<<Pcs as Pcs<Challenge, Challenger>>::Commitment> + CanSample<Challenge>,

type Pcs = Pcs

The PCS used to commit to trace polynomials.

type RapPhaseSeq = Rps

The RAP challenge phases used to establish, e.g., that interactions are balanced.

type Challenge = Challenge

The field from which most random challenges are drawn.

type Challenger = Challenger

The challenger (Fiat-Shamir) implementation used.

fn pcs( &self, ) -> &<StarkConfig<Pcs, Rps, Challenge, Challenger> as StarkGenericConfig>::Pcs

fn rap_phase_seq( &self, ) -> &<StarkConfig<Pcs, Rps, Challenge, Challenger> as StarkGenericConfig>::RapPhaseSeq