GRANDPA: a Byzantine Finality Gadget

07/03/2020
by   Alistair Stewart, et al.
0

Classic Byzantine fault-tolerant consensus protocols forfeit liveness in the face of asynchrony in order to preserve safety, whereas most deployed blockchain protocols forfeit safety in order to remain live. In this work, we achieve the best of both worlds by proposing a novel abstractions called the finality gadget. A finality gadget allows for transactions to always optimistically commit but informs the clients that these transactions might be unsafe. As a result, a blockchain can execute transactions optimistically and only commit them after they have been sufficiently and provably audited. In this work, we formally model the finality gadget abstraction, prove that it is impossible to solve it deterministically in full asynchrony (even though it is stronger than consensus) and provide a partially synchronous protocol which is currently securing a major blockchain. This way we show that the protocol designer can decouple safety and liveness in order to speed up recovery from failures. We believe that there can be other types of finality gadgets that provide weaker safety (e.g., probabilistic) in order to gain more efficiency and this can depend on the probability that the network is not in synchrony.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/27/2019

A lightweight BFT consensus protocol for blockchains

We present a general consensus framework that allows to easily introduce...
research
06/10/2019

FairLedger: A Fair Blockchain Protocol for Financial Institutions

Financial institutions are currently looking into technologies for permi...
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
01/24/2023

Quorum Tree Abstractions of Consensus Protocols

Distributed algorithms solving agreement problems like consensus or stat...
research
08/31/2023

Accountable Safety Implies Finality

Motivated by proof-of-stake (PoS) blockchains such as Ethereum, two key ...
research
05/27/2021

PAC: Practical Accountability for CCF

Permissioned ledger systems execute transactions on a set of replicas go...
research
11/21/2018

Tetris

Tetris is an Asynchronous Byzantine Fault Tolerance consensus algorithm ...

Please sign up or login with your details

Forgot password? Click here to reset