Merkle Trees

Tree of Hashes of Leaf Nodes

Used as vector commitments

Given a vector A = [a0, a1, ..., a(n-1)], merkle trees can be used to create a commitment C for the vector A by hashing all its elements.

These hashed elements are the leaf nodes of the merkle tree which are then used to recursively construct the merkle root in a bottom up fashion.