Struct Hasher 

pub struct Hasher<F, Digest, H, C> { /* private fields */ }

MerkleHasher implementation built from a cryptographic hash function and a compression function. This struct is intended for use by the protocol verifier. Prover backends may use independent but functionally equivalent implementations.

The compression function does not need to be collision-resistant and only needs to be a pseudo-cryptographic function: https://eprint.iacr.org/2026/089.

Implementations

impl<F, Digest, H, C> Hasher<F, Digest, H, C>

pub fn new(hash: H, compress: C) -> Self

Constructs a new Hasher.

Trait Implementations

impl<F, Digest, H, C> Clone for Hasher<F, Digest, H, C>

where H: Clone, C: Clone,

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<F, Digest, H, C> Debug for Hasher<F, Digest, H, C>

where H: Debug, C: Debug,

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

Formats the value using the given formatter.

impl<F, Digest, H, C> MerkleHasher for Hasher<F, Digest, H, C>

where F: Field, Digest: 'static + Copy + Send + Sync, H: 'static + Send + Sync + CryptographicHasher<F, Digest>, C: 'static + Send + Sync + PseudoCompressionFunction<Digest, 2>,

type F = F

type Digest = Digest

fn hash_slice(&self, vals: &[Self::F]) -> Self::Digest

Hash a slice of field elements into a digest (used for leaf hashing).

fn compress(&self, left: Self::Digest, right: Self::Digest) -> Self::Digest

Compress two digests into one (used for internal Merkle tree nodes).

fn tree_compress(&self, hashes: Vec<Self::Digest>) -> Self::Digest

Compress a vector of digests (must be power-of-two length) into a single digest by repeated binary compression.