Trait DigestAlgorithm

pub trait DigestAlgorithm<E, I, T>
where
    E: Element,
    I: Index,
    T: NodeValue,
{
    // Required methods
    fn digest(data: &[T]) -> Result<T, MerkleTreeError>;
    fn digest_leaf(pos: &I, elem: &E) -> Result<T, MerkleTreeError>;
}

Merkle tree hash function WARN: it’s important to domain separate the two digest functions. Otherwise, you may suffer from the length extension attack.

Required Methods

fn digest(data: &[T]) -> Result<T, MerkleTreeError>

Digest a list of values

fn digest_leaf(pos: &I, elem: &E) -> Result<T, MerkleTreeError>

Digest an indexed element

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementations on Foreign Types

impl<I, F, S, const INPUT_SIZE: usize> DigestAlgorithm<F, I, F> for FixedLenPoseidon2Hash<F, S, INPUT_SIZE, 1>

where I: Index, F: PrimeField + From<I> + Unit, S: Sponge<U = F> + Poseidon2Sponge,

fn digest(data: &[F]) -> Result<F, MerkleTreeError>

fn digest_leaf(pos: &I, elem: &F) -> Result<F, MerkleTreeError>

Implementors

impl<E, I, H> DigestAlgorithm<E, I, HasherNode<H>> for HasherDigestAlgorithm

where E: Element + CanonicalSerialize, I: Index + CanonicalSerialize, H: HasherDigest,

impl<E: Element + CanonicalSerialize, I: Index> DigestAlgorithm<E, I, Keccak256Node> for Keccak256Digest

impl<E: Element + CanonicalSerialize, I: Index> DigestAlgorithm<E, I, Sha3Node> for Sha3Digest

impl<F: RescueParameter> DigestAlgorithm<Interval<F>, u64, F> for RescueHash<F>

impl<I: Index, F: RescueParameter + From<I>> DigestAlgorithm<F, I, F> for RescueHash<F>