Class/Object

scorex.crypto.authds.merkle.sparse

SparseMerkleTree

Related Docs: object SparseMerkleTree | package sparse

Permalink

class SparseMerkleTree[D <: Digest] extends AnyRef

An implementation of sparse Merkle tree of predefined height. Supported operations are append new leaf and update previously appended leaf.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SparseMerkleTree
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SparseMerkleTree(rootDigest: Option[D], height: Byte, lastProof: SparseMerkleProof[D])(implicit hf: CryptographicHash[D])

    Permalink

    rootDigest

    - root hash of the tree

    height

    - W parameter from the paper, defines how many bits in the key, up to 127

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  9. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  10. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  11. val height: Byte

    Permalink

    - W parameter from the paper, defines how many bits in the key, up to 127

  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  13. lazy val lastIndex: ID

    Permalink

  14. val lastProof: SparseMerkleProof[D]

    Permalink

  15. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  17. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  18. val rootDigest: Option[D]

    Permalink

    - root hash of the tree

  19. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  20. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  21. def update(proof: SparseMerkleProof[D], newLeafData: Option[LeafData], proofsToUpdate: Seq[SparseMerkleProof[D]] = Seq(), filterFn: FilterFn = SparseMerkleTree.passAllFilterFn): Try[(SparseMerkleTree[D], Seq[SparseMerkleProof[D]])]

    Permalink

    Both append and update ops are here.

    Both append and update ops are here.

    proof

    - proof for some leaf

    newLeafData

    - new data for the leaf

  22. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  23. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  24. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped