Struct MerkleTree

pub struct MerkleTree<F, W, M, const DIGEST_ELEMS: usize> { /* private fields */ }

A binary Merkle tree for packed data. It has leaves of type F and digests of type [W; DIGEST_ELEMS].

This generally shouldn’t be used directly. If you’re using a Merkle tree as an MMCS, see MerkleTreeMmcs.

Implementations

impl<F: Clone + Send + Sync, W: Clone, M: Matrix<F>, const DIGEST_ELEMS: usize> MerkleTree<F, W, M, DIGEST_ELEMS>

pub fn new<P, PW, H, C>(h: &H, c: &C, leaves: Vec<M>) -> Self

where P: PackedValue<Value = F>, PW: PackedValue<Value = W>, H: CryptographicHasher<F, [W; DIGEST_ELEMS]> + CryptographicHasher<P, [PW; DIGEST_ELEMS]> + Sync, C: PseudoCompressionFunction<[W; DIGEST_ELEMS], 2> + PseudoCompressionFunction<[PW; DIGEST_ELEMS], 2> + Sync,

Matrix heights need not be powers of two. However, if the heights of two given matrices round up to the same power of two, they must be equal.

pub fn root(&self) -> Hash<F, W, DIGEST_ELEMS>

where W: Copy,

Trait Implementations

impl<F: Debug, W: Debug, M: Debug, const DIGEST_ELEMS: usize> Debug for MerkleTree<F, W, M, DIGEST_ELEMS>

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

Formats the value using the given formatter.

impl<'de, F, W, M, const DIGEST_ELEMS: usize> Deserialize<'de> for MerkleTree<F, W, M, DIGEST_ELEMS>

where [W; DIGEST_ELEMS]: Deserialize<'de>, M: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<F, W, M, const DIGEST_ELEMS: usize> Serialize for MerkleTree<F, W, M, DIGEST_ELEMS>

where [W; DIGEST_ELEMS]: Serialize, M: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.