192-bit output blake3 hasher.
256-bit output blake3 hasher.
A merkle path container, composed of a sequence of nodes of a Merkle tree.
An in-memory data store for Merkelized data.
A fully-balanced binary Merkle tree (i.e., a tree where the number of leaves is a power of two).
Address to an arbitrary node in a binary tree using level order form.
A partial Merkle tree with NodeIndex keys and 4-element RpoDigest leaf values. Partial Merkle
Tree allows to create Merkle Tree by providing Merkle paths of different lengths.
Implementation of the Rescue Prime Optimized hash function with 256-bit output.
A sparse Merkle tree with 64-bit keys and 4-element leaf values, without compaction.
Pseudo-random element generator for finite fields, which is a default implementation of the
RandomCoin trait.