Finally, check ( h_k \stackrel?= R_\textknown ).

If only ( m ) out of ( n ) possible leaves are filled, a sparse Merkle tree stores only non-empty subtrees. Mathematical representation uses binary tries of depth ( k ) with empty markers.

The textbook series by Milan Merkle, particularly the versions published by , is designed to bridge the gap between abstract theory and practical engineering applications.

Merkle trees match this bound exactly (within 1 hash).