consensus
  • README
  • Blockchain Consensus Encyclopedia Infographic
  • CONTRIBUTING
  • Introduction
  • Blockchain Consensus?
  • Glossary
  • Categorizing consensus
  • Chain-based Proof of Work
    • Proof of Work (PoW)
    • Proof of Meaningful Work (PoMW)
    • Hybrid Proof of Work (HPoW)
    • Proof of Work time (PoWT)
    • Delayed Proof of Work (dPoW)
    • Proof of Edit Distance
    • ePoW: equitable chance and energy-saving.
    • Semi-Synchronous Proof of Work (SSPoW)
  • Chain-based Proof of Stake
    • Delegated Proof-of-Contribution (DPoC)
    • Secure Proof of Stake (SPoS)
    • Hybrid PBFT/Aurand
    • Proof of Stake (PoS)
    • Delegated Proof of Stake (DPoS)
    • Proof of Stake Time (PoST)
    • Proof of stake Boo (PoS Boo)
    • High Interest Proof of Stake (HiPoS)
    • Asset PoS (APoS )
    • Traditional Proof of Stake / Tiered Proof Of Stake (TPOS)
    • Casper the Friendly Finality Gadget (FFG)
    • Correct By Construction (CBC) Casper
    • Variable Delayed Proof of Stake (vDPOS)
    • Proof of Stake Velocity
    • Magi's Proof of Stake (mPoS)
    • Leased Proof of Stake (LPoS)
    • Delegated Proof of Importance (DPoI)
    • Leasing Proof of Stake (PoS/LPoS)
  • Chain-based Proof of Capacity/Space
    • Proof of Process
    • Proof of capacity (PoC)
    • Proof of Signature (PoSign)
    • Proof of Retrievability (POR)
    • Proof of Location
    • Proof of Reputation (PoR)
    • Proof of Proof (PoP)
    • Proof of History
    • Proof of Existence
    • Proof of Research (DPoR)
    • Proof of Activity
    • Proof of Weight (PoWeight)
    • Proof of Zero (PoZ)
    • Proof of Importance
    • Proof of Care (PoC)
    • Raft
    • Proof of Value (PoV)
    • Proof of Participation (PoP)
    • Proof of Believability
    • Proof of Stake (POS) / Proof of Presence (PoP)
    • Proof of Ownership
    • Proof of Quality (PoQ)
    • Proof of Space (PoC)
  • Chain-based Hybrid models
    • GRANDPA
    • Proof of authority (PoA)
    • Ethereum Proof of Authority
    • Limited Confidence Proof-of-Activity (LCPoA)
    • Proof of Work (PoW) / Nexus Proof of State (nPoS) or Nexus Proof of Holding (nPOH)
    • Proof of Activity
    • Proof of Work (PoW) / Proof of Stake (PoS) / Proof Of Care (PoC)
    • Proof of work (PoW) / High Interest Proof of Stake (HiPoS)
    • Proof of Work (PoW) / PoM / PoSII
  • Chain-based Proof of Burn
    • Proof of Processed Payments (PoPP)
    • Proof of Burn (PoB)
    • Proof of Time
    • Proof of Stake (PoS) / Proof of Disintegration (PoD)
  • Chain-based Trusted computing algorithms
    • Proof of Elapsed Time (PoET)
  • Chain-based PBFT and BFT-based Proof of Stake
    • leaderless BFT dual ledger architecture
    • Albatross
    • asynchronous BFT protocol
    • BFTree
    • Byzantine Fault Tolerance (BFT)
    • Delegated Byzantine Fault Tolerance
    • Federated Byzantine Agreement
    • HotStuff
    • LibraBFT
    • Modified Federated Byzantine Agreement (mFBA)
    • Ouroboros
    • Practical Byzantine Fault Tolerance
  • Chain-based others
    • Proof of Trust (PoT)
    • Proof of Devotion
    • Snowglobe
    • Avalanche
    • Serialization of Proof-of-work Events (Spectre)
    • Scrypt-adaptive-N (ASIC resistant)
  • Chain-based DAG
    • BlockFlow
    • Direct Acyclic Graph Tangle (DAG)
    • Hashgraph
    • Block-lattice - Directed Acyclic Graphs (DAGs)
  • Magi's proof-of-work (mPoW)
  • Common Attacks
  • Performance indicators
  • ThresholdRelay
  • Holochain
Powered by GitBook
On this page
  • Whitepaper
  • Used in
  1. Chain-based PBFT and BFT-based Proof of Stake

BFTree

Allows an honest and reliable quorum of validators to quickly aggregate the required number of signatures in a distributed manner, allowing the algorithm to scale to large numbers of validators.

Previousasynchronous BFT protocolNextByzantine Fault Tolerance (BFT)

Last updated 5 years ago

(BFtreee) ... enable a more decentralized proof-of-stake protocol by eliminating the need for two classes of nodes and delegation to a small number of validators. We view the goal of scaling to millions of validators as a forcing function to create a more scalable consensus algorithm where BFT is no longer the bottleneck in terms of making cryptocurrencies more decentralized. In practice, other bottlenecks, such as block sizes, may make the ideal number of validators be tens or hundreds of thousands of nodes for large cryptocurrencies.

BFTree arranges validators into a virtual tree, to parallelize signature aggregation between non-byzantine nodes working to achieve consensus. When byzantine nodes interfere with the aggregation, the roots of all subtrees that were able to achieve agreement perform BFT consensus to finish the round, frequently with fewer messages than if all validators participated. By thoughtfully reorganizing the tree such that nodes that have historically been reliable are paired with other reliable nodes, BFTree limits the impact that a byzantine node can have. Source:

Whitepaper

Used in

CELO Whitepaper
Celo
https://medium.com/celohq/bftree-scaling-hotstuff-to-millions-of-validators-7d6930ee046a
A step by step example of how BFTree achieves consensus in the presence of faulty validators.