Dissecting Tendermint

In this paper we analyze Tendermint proposed in [7], one of the most popular blockchains based on PBFT Consensus. The current paper dissects Tendermint under various system communication models and Byzantine adversaries. Our methodology consists in identifying the algorithmic principles of Tendermint necessary for a specific combination of communication model-adversary. This methodology allowed to identify bugs [3] in preliminary versions of the protocol ([19], [7]) and to prove its correctness under the most adversarial conditions: an eventually synchronous communication model and asymmetric Byzantine faults.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/23/2019

No Need for Recovery: A Simple Two-Step Byzantine Consensus

In this paper, we give a deterministic two-step Byzantine consensus prot...
research
04/04/2020

A Lower Bound for Byzantine Agreement and Consensus for Adaptive Adversaries using VDFs

Large scale cryptocurrencies require the participation of millions of pa...
research
05/18/2020

Asymmetric Byzantine Consensus

Byzantine quorum systems provide a widely used abstraction for realizing...
research
06/08/2022

Authenticated Byzantine Gossip Protocol

ABGP refers to Authenticated Byzantine Gossip Protocol. The ABGP is a pa...
research
05/22/2018

Correctness and Fairness of Tendermint-core Blockchains

Tendermint-core blockchains offer strong consistency (no forks) in an op...
research
02/21/2019

Rationals vs Byzantines in Consensus-based Blockchains

In this paper we analyze from the game theory point of view Byzantine Fa...
research
11/03/2021

Byzantine Agreement with Less Communication: Recent Advances

In recent years, Byzantine Agreement is being considered in increasing s...

Please sign up or login with your details

Forgot password? Click here to reset