scalus.crypto.tree.MerkleTree
See theMerkleTree companion class
Attributes
- Companion
-
class
- Graph
-
- Supertypes
-
class Object
trait Matchable
class Any
- Self type
-
Members list
Compute the minimum depth needed to hold n elements.
Compute the minimum depth needed to hold n elements.
Attributes
Build a static Merkle tree from a sequence of elements.
Build a static Merkle tree from a sequence of elements.
Elements are hashed into leaf slots, padded to the next power-of-2 with empty hashes, and internal nodes are computed bottom-up.
Attributes