package
0.9.0
Repository: https://github.com/tendermint/go-crypto.git
Documentation: pkg.go.dev

# README

Simple Merkle Tree

For smaller static data structures that don't require immutable snapshots or mutability; for instance the transactions and validation signatures of a block can be hashed using this simple merkle tree logic.

# Functions

SimpleHashFromHashers computes a Merkle tree from items that can be hashed.
SimpleHashFromMap computes a Merkle tree from sorted map.
SimpleHashFromTwoHashes is the basic operation of the Merkle tree: Hash(left | right).
SimpleProofsFromHashers computes inclusion proof for given items.
SimpleProofsFromMap generates proofs from a map.

# Structs

SimpleProof represents a simple merkle proof.
SimpleProofNode is a helper structure to construct merkle proof.

# Interfaces

Hasher represents a hashable piece of data which can be hashed in the Tree.
Tree is a Merkle tree interface.

# Type aliases

A local extension to KVPair that can be hashed.