Struct Permutation

pub struct Permutation { /* private fields */ }

A Grøstl 512-bit state permutation.

The Grøstl hash function involves two permutations, P and Q, which are closely related. This gadget verifies one permutation, depending on the variant given as a constructor argument.

The state is represented as an array of 64 B8 elements, which is isomorphic to the standard representation of bytes in a Grøstl state. This isomorphic representation is cheaper to verify with a Binius M3 constrant system.

Implementations

impl Permutation

pub fn new( table: &mut TableBuilder<'_>, pq: PermutationVariant, state_in: [Col<B8, 8>; 8], ) -> Self

pub fn state_in(&self) -> [Col<B8, 8>; 8]

Returns the input state columns.

pub fn state_out(&self) -> [Col<B8, 8>; 8]

Returns the output state columns.

pub fn populate<P>(&self, index: &mut TableWitnessSegment<'_, P>) -> Result<()>

where P: PackedFieldIndexable<Scalar = B128> + PackedExtension<B1> + PackedExtension<B8>, PackedSubfield<P, B8>: PackedTransformationFactory<PackedSubfield<P, B8>>,

pub fn populate_state_in<'a, P>( &self, index: &mut TableWitnessSegment<'_, P>, states: impl IntoIterator<Item = &'a [B8; 64]>, ) -> Result<()>

where P: PackedExtension<B8>, P::Scalar: TowerField,

Populate the input column of the witness with a full permutation state.

pub fn read_state_outs<'a, P>( &'a self, index: &'a mut TableWitnessSegment<'a, P>, ) -> Result<impl Iterator<Item = [B8; 64]> + 'a>

where P: PackedExtension<B8>, P::Scalar: TowerField,

Reads the state outputs from the witness index.

This is currently only used for testing.

Trait Implementations

impl Clone for Permutation

fn clone(&self) -> Permutation

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Permutation

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

Formats the value using the given formatter.