subtree

func ConsistencyProof ¶

func ConsistencyProof(start, end, treeSize int64, reader tlog.HashReader) ([]tlog.Hash, error)

ConsistencyProof returns SUBTREE_PROOF(start, end, D_n) for the tree of size treeSize, reading stored hashes through the provided reader, per the MTC draft section 4.4.1 Generating a Subtree Consistency Proof, detailed further in the draft's Appendix B.4. [start, end) must be a valid subtree with end <= treeSize.

• https://ietf-plants-wg.github.io/merkle-tree-certs/draft-ietf-plants-merkle-tree-certs.html#section-4.4.1
• https://ietf-plants-wg.github.io/merkle-tree-certs/draft-ietf-plants-merkle-tree-certs.html#appendix-B.4

func HashFromProof ¶ added in v0.20261006.0

func HashFromProof(entryHash tlog.Hash, proof []tlog.Hash, entryIndex, start, end int64) (tlog.Hash, error)

HashFromProof returns a subtree hash given an entry hash and an inclusion proof across a subtree of some Merkle tree.

https://ietf-plants-wg.github.io/merkle-tree-certs/draft-ietf-plants-merkle-tree-certs.html#name-evaluating-a-subtree-inclus

func MTH ¶ added in v0.20260728.0

func MTH(leaves []tlog.Hash) tlog.Hash

MTH emits the Merkle Tree Hash of its inputs, as defined in RFC 9162 section 2.1.1.

https://www.rfc-editor.org/info/rfc9162/#name-definition-of-the-merkle-tr

func VerifyConsistency ¶

func VerifyConsistency(start, end, n int64, proof []tlog.Hash, nodeHash, rootHash tlog.Hash) bool

VerifyConsistency reports whether proof shows that the subtree [start, end), whose hash is nodeHash, sits at those positions in the tree of size n with root rootHash. It follows the procedure in MTC draft section 4.4.3, detailed further in the draft's Appendix B.5.

• https://ietf-plants-wg.github.io/merkle-tree-certs/draft-ietf-plants-merkle-tree-certs.html#section-4.4.3
• https://ietf-plants-wg.github.io/merkle-tree-certs/draft-ietf-plants-merkle-tree-certs.html#appendix-B.5