MerkleProof

Proof is given leaf data, leaf hash sibling and also siblings for parent nodes. Using this data, it is possible to compute nodes on the path to root hash, and the hash itself. The picture of a proof given below. In the picture, "^^" is leaf data(to compute leaf hash from), "=" values are to be computed, "*" values are to be stored.

........= Root ..... / \ .... * = ....... / \ ...... * = ......... /.\ .........* = ............ ^^

leafData: - leaf data bytes
levels: - levels in proof, bottom up, each level is about stored value and position of computed element (whether it is left or right to stored value)

Linear Supertypes

Serializable, Serializable, Product, Equals, ScorexEncoding, AnyRef, Any

Instance Constructors

new MerkleProof(leafData: LeafData, levels: Seq[(Digest, Side)])(implicit hf: CryptographicHash[D])

leafData
- leaf data bytes
levels
- levels in proof, bottom up, each level is about stored value and position of computed element (whether it is left or right to stored value)

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
implicit val encoder: BytesEncoder

Definition Classes
ScorexEncoding
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
implicit val hf: CryptographicHash[D]
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val leafData: LeafData

- leaf data bytes
val levels: Seq[(Digest, Side)]

- levels in proof, bottom up, each level is about stored value and position of computed element (whether it is left or right to stored value)
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
MerkleProof → AnyRef → Any
def valid(expectedRootHash: Digest): Boolean
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: object MerkleProof | package merkle

case class MerkleProof[D <: Digest](leafData: LeafData, levels: Seq[(Digest, Side)])(implicit hf: CryptographicHash[D]) extends ScorexEncoding with Product with Serializable

Instance Constructors

new MerkleProof(leafData: LeafData, levels: Seq[(Digest, Side)])(implicit hf: CryptographicHash[D])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

implicit val encoder: BytesEncoder

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

final def getClass(): Class[_]

implicit val hf: CryptographicHash[D]

final def isInstanceOf[T0]: Boolean

val leafData: LeafData

val levels: Seq[(Digest, Side)]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

def valid(expectedRootHash: Digest): Boolean

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from ScorexEncoding

Inherited from AnyRef

Inherited from Any

Ungrouped