PartialMerkleTree

Created by chris on 8/7/16. Represents a subset of known txids inside of a Block in a way that allows recovery of the txids & merkle root without having to store them all explicitly. See BIP37 for more details

Encoding procedure: "Bitcoin.org: creating a merkleblock message" "Bitcoin Core: merkleblock.cpp" Traverse the tree in depth first order, storing a bit for each traversal. This bit signifies if the node is a parent of at least one matched leaf txid (or a matched leaf txid) itself. In case we are the leaf level, or this bit is 0, it's merkle node hash is stored and it's children are not explored any further. Otherwise no hash is stored, but we recurse all of this node's child branches.

Decoding procedure: "Bitcoin.org: parsing a merkleblock message" "Bitcoin Core: merkleblock.cpp" The same depth first decoding procedure is performed, but we consume the bits and hashes that we used during encoding

Linear Supertypes

BitcoinSLogger, AnyRef, Any

Abstract Value Members

abstract def bits: BitVector

A sequence representing if this node is the parent of another node that matched a txid
abstract def hashes: Seq[DoubleSha256Digest]

The hashes used to create the binary tree
abstract def transactionCount: UInt32

The total number of transactions in this block
abstract def tree: BinaryTree[DoubleSha256Digest]

The actual tree used to represent this partial merkle tree

Concrete 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( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def extractMatches: Seq[DoubleSha256Digest]

Extracts the txids that were matched inside of the bloom filter used to create this partial merkle tree
def finalize(): Unit

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

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
lazy val logger: Logger

Definition Classes
BitcoinSLogger
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
AnyRef → Any
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 PartialMerkleTree | package blockchain

sealed trait PartialMerkleTree extends BitcoinSLogger

Abstract Value Members

abstract def bits: BitVector

abstract def hashes: Seq[DoubleSha256Digest]

abstract def transactionCount: UInt32

abstract def tree: BinaryTree[DoubleSha256Digest]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def extractMatches: Seq[DoubleSha256Digest]

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

lazy val logger: Logger

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from BitcoinSLogger

Inherited from AnyRef

Inherited from Any

Ungrouped