Corpus ID: 225040881

Fast-HotStuff: A Fast and Resilient HotStuff Protocol

@article{Jalalzai2020FastHotStuffAF,
  title={Fast-HotStuff: A Fast and Resilient HotStuff Protocol},
  author={Mohammad M. Jalalzai and Jianyu Niu and Chen Feng},
  journal={ArXiv},
  year={2020},
  volume={abs/2010.11454}
}
The HotStuff protocol is a recent breakthrough inByzantine Fault Tolerant (BFT) consensus that enjoys responsiveness and linear view change. It uses a clever three-chain commit rule to achieve responsiveness while the vast majority of BFT protocols are using the standard two-chain commit rule. This brings us to a fundamental question: Is a three-chain commit rule really necessary to achieve responsiveness? In this paper, we answer this question by designing a two-chain variant ofHotStuff called… Expand

Figures from this paper

On the Performance of Pipelined HotStuff
TLDR
A multi-metric evaluation framework is developed to quantitatively analyze pipelined HotStuff’s performance with respect to its chain growth rate, chain quality, and latency and finds that certain engineering optimizations adopted by LibraBFT make the system more vulnerable to attacks. Expand
Dissecting the Performance of Chained-BFT
TLDR
These protocols are evaluated under various parameters and scenarios, including two Byzantine attacks that have not been widely discussed in the literature, and interesting trade-offs are revealed between different cBFT protocols and their design choices, which provide developers and researchers with insights into the design and implementation of this protocol family. Expand
Fast B4B: Fast BFT for Blockchains
TLDR
This paper proposes a protocol called Fast B4B, in which the protocol achieves consensus in just two communication steps, and can tolerate maximum number of faults a partial BFT consensus can tolerate. Expand
Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback
TLDR
Ditto is designed, a Byzantine SMR protocol that enjoys the best of both worlds: optimal communication on and off the happy path (linear and quadratic, respectively) and progress guarantee under asynchrony and DDoS attacks. Expand
Leaderless Byzantine Fault Tolerant Consensus
TLDR
This paper aims to design a leaderless Byzantine fault tolerant (LBFT) protocol, in which nodes simply compete to propose blocks without the need of explicit coordination through view synchronization. Expand
Brief Announcement: Malicious Security Comes for Free in Consensus with Leaders
  • M. Rambaud
  • Computer Science
  • IACR Cryptol. ePrint Arch.
  • 2020
TLDR
This work replaces the communication bottleneck of PBFT with a responsive subprotocol, with linear communication complexity, that enables halting in finite time with (amortized) linear complexity, which was an unsolved question so far when external validity is required. Expand
Gemini: BFT Systems Made Robust
This paper presents Gemini, a principled strategy for effectuating Byzantine attack scenarios at scale in Byzantine Fault Tolerant (BFT) systems and examining their behavior. Gemini builds a thinExpand
Brief Announcement: Twins - BFT Systems Made Robust
TLDR
Twins is an effective strategy for generating test scenarios with Byzantine nodes in order to find flaws in Byzantine Fault Tolerant (BFT) systems and is incorporated into the continuous release testing process of a production setting in which it can execute 44M Twins-generated scenarios daily. Expand
Twins: BFT Systems Made Robust
16 This paper presents Twins, a principled strategy for effectuating Byzantine attack scenarios at scale 17 in Byzantine Fault Tolerant (BFT) systems and examining their behavior. Twins builds a thinExpand
BigBFT: A Multileader Byzantine Fault Tolerance Protocol for High Throughput
TLDR
This paper describes BigBFT, a multi-leader Byzantine fault tolerance protocol that achieves high throughput and scalable consensus in blockchain systems and evaluates its performance both analytically, using back-of-the-envelope load formulas to construct a cost analysis, and empirically by implementing it in the PaxiBFT framework. Expand
...
1
2
...

References

SHOWING 1-10 OF 24 REFERENCES
State Machine Replication in the Libra Blockchain
This report describes the Libra Byzantine Fault Tolerance (LibraBFT) algorithmic core and discusses next steps in its production. The consensus protocol is responsible for forming agreement onExpand
HotStuff: BFT Consensus with Linearity and Responsiveness
TLDR
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. Expand
Algorand: Scaling Byzantine Agreements for Cryptocurrencies
TLDR
Experimental results show that Algorand confirms transactions in under a minute, achieves 125x Bitcoin's throughput, and incurs almost no penalty for scaling to more users. Expand
PaLa: A Simple Partially Synchronous Blockchain
TLDR
A simple partially synchronous blockchain protocol called PaLa is described that is inspired by the pipelined-BFT paradigm and a generalization called “doubly-pipelined PaLa” that is geared towards settings that require high throughput. Expand
SBFT: a Scalable Decentralized Trust Infrastructure for Blockchains
TLDR
SBFT provides a smart contract execution environment based on Ethereum's EVM byte-code that addresses the challenges of scalability and decentralization and shows speedups both in throughput and in latency. Expand
Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography
TLDR
A new protocol for Byzantine agreement in a completely asynchronous network is presented that makes use of new cryptographic protocols, specifically protocols for threshold signatures and coin-tossing based on the Diffie-Hellman problem. Expand
Window Based BFT Blockchain Consensus
  • Mohammad M. Jalalzai, C. Busch
  • Computer Science
  • 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)
  • 2018
TLDR
The Musch protocol is presented, this is the first BFT-based blockchain protocol which efficiently addresses simultaneously the issues of communication complexity and latency under the presence of failures. Expand
State Machine Replication for the Masses with BFT-SMART
TLDR
BFT-SMART is an open-source Java-based library implementing robust BFT state machine replication with improved reliability, modularity as a first-class property, multicore-awareness, reconfiguration support and a flexible programming interface. Expand
Tendermint: Byzantine Fault Tolerance in the Age of Blockchains
TLDR
Tendermint modernizes classic academic work on the subject to provide a secure consensus protocol with accountability guarantees, as well as an interface for building arbitrary applications above the consensus. Expand
Practical Byzantine fault tolerance
TLDR
A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude. Expand
...
1
2
3
...