Struct BHP

pub struct BHP<E, const NUM_WINDOWS: u8, const WINDOW_SIZE: u8>
where
    E: Environment,
{ /* private fields */ }

BHP is a collision-resistant hash function that takes a variable-length input. The BHP hash function does not behave like a random oracle, see Poseidon for one.

Design

The BHP hash function splits the given input into blocks, and processes them iteratively.

The first iteration is initialized as follows:

DIGEST_0 = BHP([ 0...0 || DOMAIN || LENGTH(INPUT) || INPUT[0..BLOCK_SIZE] ]);

Each subsequent iteration is initialized as follows:

DIGEST_N+1 = BHP([ DIGEST_N[0..DATA_BITS] || INPUT[(N+1)*BLOCK_SIZE..(N+2)*BLOCK_SIZE] ]);

Trait Implementations

impl<E, const NUM_WINDOWS: u8, const WINDOW_SIZE: u8> Commit for BHP<E, NUM_WINDOWS, WINDOW_SIZE>

where E: Environment,

fn commit( &self, input: &[<BHP<E, NUM_WINDOWS, WINDOW_SIZE> as Commit>::Input], randomizer: &<BHP<E, NUM_WINDOWS, WINDOW_SIZE> as Commit>::Randomizer, ) -> <BHP<E, NUM_WINDOWS, WINDOW_SIZE> as Commit>::Output

Returns the BHP commitment of the given input and randomizer as a field element.

type Input = Boolean<E>

type Output = Field<E>

type Randomizer = Scalar<E>

impl<E, const NUM_WINDOWS: u8, const WINDOW_SIZE: u8> CommitUncompressed for BHP<E, NUM_WINDOWS, WINDOW_SIZE>

where E: Environment,

fn commit_uncompressed( &self, input: &[<BHP<E, NUM_WINDOWS, WINDOW_SIZE> as CommitUncompressed>::Input], randomizer: &<BHP<E, NUM_WINDOWS, WINDOW_SIZE> as CommitUncompressed>::Randomizer, ) -> <BHP<E, NUM_WINDOWS, WINDOW_SIZE> as CommitUncompressed>::Output

Returns the BHP commitment of the given input and randomizer as an affine group element.

type Input = Boolean<E>

type Output = Group<E>

type Randomizer = Scalar<E>

impl<E, const NUM_WINDOWS: u8, const WINDOW_SIZE: u8> Hash for BHP<E, NUM_WINDOWS, WINDOW_SIZE>

where E: Environment,

fn hash( &self, input: &[<BHP<E, NUM_WINDOWS, WINDOW_SIZE> as Hash>::Input], ) -> <BHP<E, NUM_WINDOWS, WINDOW_SIZE> as Hash>::Output

Returns the BHP hash of the given input as a field element.

type Input = Boolean<E>

type Output = Field<E>

impl<E, const NUM_WINDOWS: u8, const WINDOW_SIZE: u8> HashUncompressed for BHP<E, NUM_WINDOWS, WINDOW_SIZE>

where E: Environment,

fn hash_uncompressed( &self, input: &[<BHP<E, NUM_WINDOWS, WINDOW_SIZE> as HashUncompressed>::Input], ) -> <BHP<E, NUM_WINDOWS, WINDOW_SIZE> as HashUncompressed>::Output

Returns the BHP hash of the given input as an affine group element.

This uncompressed variant of the BHP hash function is provided to support the BHP commitment scheme, as it is typically not used by applications.

type Input = Boolean<E>

type Output = Group<E>

impl<E, const NUM_WINDOWS: u8, const WINDOW_SIZE: u8> Inject for BHP<E, NUM_WINDOWS, WINDOW_SIZE>

where E: Environment,

fn new( _mode: Mode, bhp: <BHP<E, NUM_WINDOWS, WINDOW_SIZE> as Inject>::Primitive, ) -> BHP<E, NUM_WINDOWS, WINDOW_SIZE>

Initializes a new instance of a BHP circuit with the given BHP variant.

type Primitive = BHP<<E as Environment>::Network, NUM_WINDOWS, WINDOW_SIZE>

fn constant(value: Self::Primitive) -> Self

where Self: Sized,

Initializes a constant of the given primitive value.

impl<E, const NUM_WINDOWS: u8, const WINDOW_SIZE: u8> LeafHash for BHP<E, NUM_WINDOWS, WINDOW_SIZE>

where E: Environment,

fn hash_leaf( &self, leaf: &<BHP<E, NUM_WINDOWS, WINDOW_SIZE> as LeafHash>::Leaf, ) -> <BHP<E, NUM_WINDOWS, WINDOW_SIZE> as LeafHash>::Hash

Returns the hash of the given leaf node.

type Hash = Field<E>

type Leaf = Vec<Boolean<E>>

impl<E, const NUM_WINDOWS: u8, const WINDOW_SIZE: u8> PathHash<E> for BHP<E, NUM_WINDOWS, WINDOW_SIZE>

where E: Environment,

fn hash_children( &self, children: &[<BHP<E, NUM_WINDOWS, WINDOW_SIZE> as PathHash<E>>::Hash], ) -> <BHP<E, NUM_WINDOWS, WINDOW_SIZE> as PathHash<E>>::Hash

Returns the hash of the given child nodes.

type Hash = Field<E>

type Primitive = BHP<<E as Environment>::Network, NUM_WINDOWS, WINDOW_SIZE>

fn hash_empty<const ARITY: u8>(&self) -> Self::Hash

Returns the empty hash.