Correctness and Fairness of Tendermint-core Blockchains

Tendermint-core blockchains offer strong consistency (no forks) in an open system relying on two ingredients (i) a set of validators that generate blocks via a variant of Practical Byzantine Fault Tolerant (PBFT) consensus protocol and (ii) a rewarding mechanism that dynamically selects nodes to be validators for the next block via proof-of-stake, a non-energy consuming alternative of proof-of-work. It is well-known that in those open systems the main threat is the tragedy of commons that may yield the system to collapse if the rewarding mechanism is not adequate. At minima the rewarding mechanism must be f air, i.e. distributing the rewards in proportion to the merit of participants. The contribution of this paper is twofold. First, we provide a formal description of Tendermint-core protocol and we prove that in eventual synchronous systems (i) it verifies a variant of one-shot consensus for the validation of one single block and (ii) a variant of the repeated consensus problem for multiple blocks. Our second contribution relates to the fairness of Tendermint rewarding mechanism. We prove that Tendermint rewarding is not fair. However, a small twist in the protocol makes it eventually fair. Additionally, we prove that there exists an (eventual) fair rewarding mechanism in repeated consensus-based blockchains if and only if the system is (eventually) synchronous.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/22/2019

On Fairness in Committee-based Blockchains

Committee-based blockchains are among the most popular alternatives of p...
research
01/31/2020

Tenderbake – Classical BFT Style Consensus for Public Blockchains

Our work has been originally motivated by Tezos, a public blockchain whi...
research
07/24/2022

Approach to Alleviate Wealth Compounding in Proof-of-Stake Cryptocurrencies

Due to its minimal energy requirement the PoS consensus protocol has bec...
research
05/28/2021

SoK: Achieving State Machine Replication in Blockchains based on Repeated Consensus

This paper revisits the ubiquitous problem of achieving state machine re...
research
09/23/2019

IBFT 2.0: A Safe and Live Variation of the IBFT Blockchain Consensus Protocol for Eventually Synchronous Networks

In this work, we present IBFT 2.0 (Istanbul BFT 2.0), which is a Proof-o...
research
09/26/2018

Dissecting Tendermint

In this paper we analyze Tendermint proposed in [7], one of the most pop...
research
08/31/2023

Accountable Safety Implies Finality

Motivated by proof-of-stake (PoS) blockchains such as Ethereum, two key ...

Please sign up or login with your details

Forgot password? Click here to reset