Struct BabyBearPoseidon2Config 

pub struct BabyBearPoseidon2Config { /* private fields */ }

Implementations

impl BabyBearPoseidon2Config

pub fn new( params: SystemParams, hasher: Hasher<F, Digest, PaddingFreeSponge<Poseidon2BabyBear<WIDTH>, WIDTH, RATE, DIGEST_SIZE>, TruncatedPermutation<Poseidon2BabyBear<WIDTH>, 2, CHUNK, WIDTH>>, ) -> Self

Constructs a new BabyBearPoseidon2Config.

impl BabyBearPoseidon2Config

pub fn new_from_perm( params: SystemParams, perm: Poseidon2BabyBear<WIDTH>, ) -> Self

pub fn default_from_params(params: SystemParams) -> Self

Trait Implementations

impl Clone for BabyBearPoseidon2Config

fn clone(&self) -> BabyBearPoseidon2Config

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BabyBearPoseidon2Config

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

Formats the value using the given formatter.

impl DecodableConfig for BabyBearPoseidon2Config

fn decode_base_field<R: Read>(reader: &mut R) -> Result<F>

fn decode_extension_field<R: Read>(reader: &mut R) -> Result<EF>

fn decode_digest<R: Read>(reader: &mut R) -> Result<Digest>

fn decode_base_field_n<R>( reader: &mut R, n: usize, ) -> Result<Vec<Self::F>, Error>

where R: Read,

Decode n base field elements (known length, no length prefix).

fn decode_extension_field_n<R>( reader: &mut R, n: usize, ) -> Result<Vec<Self::EF>, Error>

where R: Read,

Decode n extension field elements (known length, no length prefix).

fn decode_digest_n<R>( reader: &mut R, n: usize, ) -> Result<Vec<Self::Digest>, Error>

where R: Read,

Decode n digests (known length, no length prefix).

fn decode_base_field_vec<R>(reader: &mut R) -> Result<Vec<Self::F>, Error>

where R: Read,

Decode a length-prefixed vector of base field elements.

fn decode_extension_field_vec<R>(reader: &mut R) -> Result<Vec<Self::EF>, Error>

where R: Read,

Decode a length-prefixed vector of extension field elements.

fn decode_digest_vec<R>(reader: &mut R) -> Result<Vec<Self::Digest>, Error>

where R: Read,

Decode a length-prefixed vector of digests.

impl EncodableConfig for BabyBearPoseidon2Config

fn encode_base_field<W: Write>(val: &F, writer: &mut W) -> Result<()>

fn encode_extension_field<W: Write>(val: &EF, writer: &mut W) -> Result<()>

fn encode_digest<W: Write>(digest: &Self::Digest, writer: &mut W) -> Result<()>

fn encode_base_field_iter<'a, W>( iter: impl Iterator<Item = &'a Self::F>, writer: &mut W, ) -> Result<(), Error>

where W: Write, Self::F: 'a,

Encode each element from an iterator (no length prefix).

fn encode_extension_field_iter<'a, W>( iter: impl Iterator<Item = &'a Self::EF>, writer: &mut W, ) -> Result<(), Error>

where W: Write, Self::EF: 'a,

Encode each element from an iterator (no length prefix).

fn encode_digest_iter<'a, W>( iter: impl Iterator<Item = &'a Self::Digest>, writer: &mut W, ) -> Result<(), Error>

where W: Write, Self::Digest: 'a,

Encode each element from an iterator (no length prefix).

fn encode_base_field_slice<W>( vals: &[Self::F], writer: &mut W, ) -> Result<(), Error>

where W: Write,

Encode length-prefixed slice of base field elements.

fn encode_extension_field_slice<W>( vals: &[Self::EF], writer: &mut W, ) -> Result<(), Error>

where W: Write,

Encode length-prefixed slice of extension field elements.

fn encode_digest_slice<W>( vals: &[Self::Digest], writer: &mut W, ) -> Result<(), Error>

where W: Write,

Encode length-prefixed slice of digests.

impl FiatShamirTranscript<BabyBearPoseidon2Config> for CpuTranscript

fn observe(&mut self, value: BabyBear)

fn sample(&mut self) -> BabyBear

fn observe_commit(&mut self, digest: [BabyBear; 8])

Implementations should pass through to Self::observe, but no default implementation is provided since an explicit conversion from Digest to array of F is required.

fn grind(&mut self, bits: usize) -> BabyBear

Finds a proof-of-work witness w such that Self::check_witness(bits, w) holds, by brute force over the base field.

fn observe_ext(&mut self, value: <SC as StarkProtocolConfig>::EF)

fn sample_ext(&mut self) -> <SC as StarkProtocolConfig>::EF

fn sample_bits(&mut self, bits: usize) -> u64

Samples and returns an integer in the range [0, 2^bits).

fn check_witness( &mut self, bits: usize, witness: <SC as StarkProtocolConfig>::F, ) -> bool

Checks a proof-of-work witness: observes witness into the transcript and accepts iff the next Self::sample_bits is zero (probability ≈ 2^{-bits} for a random witness, so Self::grind tries ≈ 2^bits witnesses to find one).

impl StarkProtocolConfig for BabyBearPoseidon2Config

type F = MontyField31<BabyBearParameters>

The prime base field.

type EF = BinomialExtensionField<MontyField31<BabyBearParameters>, 4>

The extension field, used for random challenges.

type Digest = [MontyField31<BabyBearParameters>; 8]

The digest type used for commitments.

type Hasher = Hasher<MontyField31<BabyBearParameters>, [MontyField31<BabyBearParameters>; 8], PaddingFreeSponge<Poseidon2<MontyField31<BabyBearParameters>, Poseidon2ExternalLayerMonty31<BabyBearParameters, WIDTH>, Poseidon2InternalLayerMonty31<BabyBearParameters, WIDTH, BabyBearInternalLayerParameters>, WIDTH, p3_baby_bear::::poseidon2::Poseidon2BabyBear::{constant#0}>, WIDTH, RATE, DIGEST_SIZE>, TruncatedPermutation<Poseidon2<MontyField31<BabyBearParameters>, Poseidon2ExternalLayerMonty31<BabyBearParameters, WIDTH>, Poseidon2InternalLayerMonty31<BabyBearParameters, WIDTH, BabyBearInternalLayerParameters>, WIDTH, p3_baby_bear::::poseidon2::Poseidon2BabyBear::{constant#0}>, 2, CHUNK, WIDTH>>

The merkle tree hasher used by the polynomial commitment scheme.

fn params(&self) -> &SystemParams

fn hasher(&self) -> &Self::Hasher

const D_EF: usize = _

Degree of the extension field.