LogHasher provides the hash functions needed to compute dense merkle trees.
type LogHasher interface {
// EmptyRoot supports returning a special case for the root of an empty tree.
EmptyRoot() []byte
// HashLeaf computes the hash of a leaf that exists.
HashLeaf(leaf []byte) []byte
// HashChildren computes interior nodes.
HashChildren(l, r []byte) []byte
// Size returns the number of bytes the Hash* functions will return.
Size() int
}
| Name | Synopsis |
|---|---|
| .. | |
| compact | Package compact provides compact Merkle tree data structures. |
| proof | Package proof contains helpers for constructing log Merkle tree proofs. |
| rfc6962 | Package rfc6962 provides hashing functionality according to RFC6962. |
| testonly | Package testonly contains code and data for testing Merkle trees, such as a reference implementation of in-memory Merkle tree. |