JAR: JAM Axiomatic Reference

12.3. Binary Merkle Tree🔗

🔗def
Jar.Merkle.binaryMerkleRoot (items : Array Hash) : Hash
Jar.Merkle.binaryMerkleRoot
  (items : Array Hash) : Hash
🔗def
Jar.Merkle.constDepthMerkleRoot (items : Array Hash) (depth : Nat) :
  Hash
Jar.Merkle.constDepthMerkleRoot
  (items : Array Hash) (depth : Nat) :
  Hash

M(data, depth) : Constant-depth binary Merkle tree. GP Appendix E eq (E.4). Pads to 2^depth leaves with zero hashes, then computes binary Merkle root.