Expand description
An implementation of the “Merkle Tree-Structured Log” defined in the blog post Transparent Logs for Skeptical Clients.
Structs§
- Merkle
Log - A Merkle Tree-Structured Log is a potentially unbalanced merkle tree
containing the entries of an append-only log (maximum
2^63 + 1
entries). - TreeID
- Unique identifiers for binary tree nodes. Reproduced from flat-tree.
Enums§
Traits§
- Digest
- Node
- Type alias for nodes in the merkle tree.
- Store
- Represents access to immutable merkle tree nodes.
Type Aliases§
- Memory
Store - An in-memory store for the intermediate nodes of a
MerkleLog
. - Proof
- Type alias for a
BTreeMap
containing leaf and tree nodes.