BFT class

Byzantine Fault Tolerance (BFT) - generic broadcast model

A concise, production-minded simulation of BFT-style reliable broadcast primitives that captures the core mechanics: authenticated messages, message quorum rules, view changes, and leader proposals. This is a protocol research tool suitable for unit tests and simulation of small networks.

Contract:

  • Input: set of nodes, f (max Byzantine nodes), message proposals
  • Output: which nodes commit proposals under standard BFT quorum rules
  • Errors: throws on invalid f or insufficient nodes

Constructors

BFT(int n, int f)

Properties

f → int
final
hashCode → int
The hash code for this object.
no setterinherited
n → int
final
runtimeType → Type
A representation of the runtime type of the object.
no setterinherited

Methods

canChangeView(int complaints) → bool
Simple view-change helper: is it safe to change view given complaints from nodes?
commit(Map<int, bool> votes) → bool
Given a set of boolean accepts, decide if commit quorum met.
commitQuorum() → int
noSuchMethod(Invocation invocation) → dynamic
Invoked when a nonexistent method or property is accessed.
inherited
toString() → String
A string representation of this object.
inherited

Operators

operator ==(Object other) → bool
The equality operator.
inherited