package sparse
Ordering
- Alphabetic
Visibility
- Public
- All
Type Members
- case class InternalNode[D <: Digest](left: Option[Node[D]], right: Option[Node[D]])(implicit hf: CryptographicHash[D]) extends Node[D] with Product with Serializable
- case class Leaf[D <: Digest](idx: ID, data: LeafData)(implicit hf: CryptographicHash[D]) extends Node[D] with Product with Serializable
- case class LeafHash[D <: Digest](hash: D) extends Node[D] with Product with Serializable
- trait Node[D <: Digest] extends AnyRef
-
case class
SparseMerkleProof[D <: Digest](idx: ID, leafDataOpt: Option[LeafData], levels: Vector[Option[D]]) extends Product with Serializable
Sparse Merkle tree proof for leaf
Sparse Merkle tree proof for leaf
- idx
- index of a leaf
- leafDataOpt
- leaf bytes, or null
- levels
- bottom-up levels
-
class
SparseMerkleTree[D <: Digest] extends AnyRef
An implementation of sparse Merkle tree of predefined height.
An implementation of sparse Merkle tree of predefined height. Supported operations are append new leaf and update previously appended leaf.
Value Members
- object BlockchainSimulator extends App
- object Node
- object OpsBenchmark extends App
- object SparseMerkleTree