Expand description
Merkle tree implementation for transparency log.
Uses SHA-256 with byte 0x01 prefix for leaf hashing and 0x02
prefix for internal node hashing (RFC 6962-style domain separation).
Inclusion proofs include direction bits per RFC 6962 §2.1.1.
Structs§
- Inclusion
Proof - A complete inclusion proof: list of (sibling_hash, side) pairs.
- Merkle
Tree - The Merkle tree.
- Proof
Step - A single step in an inclusion proof.
Enums§
- Merkle
Error - Errors during Merkle tree operations.
- Side
- Which side the proof sibling sits on relative to the current hash.
Type Aliases§
- Hash
- 32-byte SHA-256 hash.