scalus.crypto.tree.IncrementalMerkleTree
See theIncrementalMerkleTree 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
Create an empty tree with the given depth.
Create an empty tree with the given depth.
Attributes
Build a tree from a sequence of keys. Builds efficiently by filling leaves and computing branch hashes bottom-up.
Build a tree from a sequence of keys. Builds efficiently by filling leaves and computing branch hashes bottom-up.
Attributes