miden_crypto

Module merkle

source
Expand description

Data structures related to Merkle trees based on RPO256 hash function.

Structs§

  • Contains precomputed roots of empty subtrees in a Merkle tree.
  • Index of nodes in a perfectly balanced binary tree based on an in-order tree walk.
  • Representation of a node with two children used for iterating over containers.
  • The index of a leaf, at a depth known at compile-time.
  • 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).
  • A fully materialized Merkle Mountain Range, with every tree in the forest and all their elements.
  • Container for the update data of a super::PartialMmr
  • 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.
  • Partially materialized Merkle Mountain Range (MMR), used to efficiently store and update the authentication paths for a subset of the elements in a full MMR.
  • A container for a MerklePath and its crate::Word root.
  • A sparse Merkle tree with 64-bit keys and 4-element leaf values, without compaction.
  • Sparse Merkle tree mapping 256-bit keys to 256-bit values. Both keys and values are represented by 4 field elements.
  • A proof which can be used to assert membership (or non-membership) of key-value pairs in a super::Smt.
  • A container for a crate::Word value and its MerklePath opening.

Enums§

Constants§

Functions§

Type Aliases§