• Corpus ID: 230770163

Highway: Efficient Consensus with Flexible Finality

  title={Highway: Efficient Consensus with Flexible Finality},
  author={Daniel Kane and Andreas Fackler and Adam Gagol and Damian Straszak},
There has been recently a lot of progress in designing efficient partially synchronous BFT consensus protocols that are meant to serve as core consensus engines for Proof of Stake blockchain systems. While the state-of-the-art solutions attain virtually optimal performance under this theoretical model, there is still room for improvement, as several practical aspects of such systems are not captured by this model. Most notably, during regular execution, due to financial incentives in such… 
BFT Protocol Forensics
It is shown that all secure BFT protocols designed for 2t+1 replicas communicating over a synchronous network forensic support is inherently nonexistent; this impossibility result holds for all B FT protocols and even if one has access to the states of all replicas.


Ebb-and-Flow Protocols: A Resolution of the Availability-Finality Dilemma
A new class of flexible consensus protocols, ebb-and-flow protocols, are formulated, which support a full dynamically available ledger in conjunction with a finalized prefix ledger, to resolve the availability-finality dilemma.
Combining GHOST and Casper
Gasper, a proof-of-stake-based consensus protocol, is presented, which is an idealized version of the proposed Ethereum 2.0 beacon chain and proves safety, plausible liveness, and probabilistic liveness under different sets of assumptions.
Streamlet: Textbook Streamlined Blockchains
An extremely simple and natural paradigm called Streamlet for constructing consensus protocols that is inspired by the core techniques that have been uncovered in the past five years of work on consensus partly driven by the cryptocurrency community and how remarkably simple the new generation of consensus protocols has become in comparison with classical mainstream approaches such as PBFT and Paxos.
Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes
This work proposes a protocol in which a set of nodes maintains and updates a linear ordering of transactions that are being submitted by users, and improves upon the state-of-the-art HoneyBadgerBFT by Miller et al. by reducing the asymptotic latency while matching the optimal communication complexity.
Flexible Byzantine Fault Tolerance
A synchronous BFT protocol in which only the commit step requires to know the network delay bound and thus replicas execute the protocol without any synchrony assumption is introduced, and a notion called Flexible Byzantine Quorums is introduced by dissecting the roles of different quorums in existing consensus protocols.
HotStuff: BFT Consensus with Linearity and Responsiveness
HotStuff is the first partially synchronous BFT replication protocol exhibiting these combined properties, and its simplicity enables it to be further pipelined and simplified into a practical, concise protocol for building large-scale replication services.
SBFT: A Scalable and Decentralized Trust Infrastructure
The results show that SBFT simultaneously provides almost 2x better throughput and about 1.5x better latency relative to a highly optimized system that implements the PBFT protocol.
Sync HotStuff: Synchronous SMR with 2∆ Latency and Optimistic Responsiveness
A consensus protocol named Sync HotStuff designed to achieve consensus on a sequence of values with a latency of 2∆ in the common mode when less than half of the replicas are Byzantine, which is within a factor of 2 of the optimal latency.
Introducing the minimal cbc casper family of consensus
  • 2018
Introducing the minimal cbc casper family of consensus protocols
  • 2018