History

History of a blockchain system is some blocktree in fact (like this: http://image.slidesharecdn.com/sfbitcoindev-chepurnoy-2015-150322043044-conversion-gate01/95/proofofstake-its-improvements-san-francisco-bitcoin-devs-hackathon-12-638.jpg), where longest chain is being considered as canonical one, containing right kind of history.

In cryptocurrencies of today blocktree view is usually implicit, means code supports only linear history, but other options are possible.

To say "longest chain" is the canonical one is simplification, usually some kind of "cumulative difficulty" function has been used instead, even in PoW systems.

Linear Supertypes

NodeViewComponent, AnyRef, Any

Known Subclasses

BlockChain

Type Members

abstract type NVCT >: History.this.type <: NodeViewComponent

Definition Classes
NodeViewComponent

Abstract Value Members

abstract def append(modifier: PM): Try[(HT, RollbackInfo[PM])]
abstract def compare(other: SI): History.HistoryComparisonResult.Value

Whether another's node syncinfo shows that another node is ahead or behind ours
Whether another's node syncinfo shows that another node is ahead or behind ours
other
other's node sync info
returns
Equal if nodes have the same history, Younger if another node is behind, Older if a new node is ahead
abstract def continuationIds(from: ModifierIds, size: Int): Option[ModifierIds]
abstract def isEmpty: Boolean

Is there's no history, even genesis block
abstract def modifierById(modifierId: ModifierId): Option[PM]
abstract def openSurfaceIds(): Seq[ModifierId]
abstract def syncInfo(answer: Boolean): SI

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
def applicable(modifier: PM): Boolean

Whether a modifier could be applied to the history
Whether a modifier could be applied to the history
modifier
- modifier to apply
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def contains(id: ModifierId): Boolean

Whether the history contains a modifier with the given id
Whether the history contains a modifier with the given id
id
- modifier's id
def contains(persistentModifier: PM): Boolean

Whether the history contains the given modifier
Whether the history contains the given modifier
persistentModifier
- modifier
def continuation(from: ModifierIds, size: Int): Option[Seq[PM]]
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
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
def modifierById(modifierId: String): Option[PM]
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 History | package consensus

trait History[P <: Proposition, TX <: Transaction[P], PM <: PersistentNodeViewModifier[P, TX], SI <: SyncInfo, HT <: History[P, TX, PM, SI, HT]] extends NodeViewComponent

Type Members

abstract type NVCT >: History.this.type <: NodeViewComponent

Abstract Value Members

abstract def append(modifier: PM): Try[(HT, RollbackInfo[PM])]

abstract def compare(other: SI): History.HistoryComparisonResult.Value

abstract def continuationIds(from: ModifierIds, size: Int): Option[ModifierIds]

abstract def isEmpty: Boolean

abstract def modifierById(modifierId: ModifierId): Option[PM]

abstract def openSurfaceIds(): Seq[ModifierId]

abstract def syncInfo(answer: Boolean): SI

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def applicable(modifier: PM): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def contains(id: ModifierId): Boolean

def contains(persistentModifier: PM): Boolean

def continuation(from: ModifierIds, size: Int): Option[Seq[PM]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def modifierById(modifierId: String): Option[PM]

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 NodeViewComponent

Inherited from AnyRef

Inherited from Any

Ungrouped