DeepAI AI Chat
Log In Sign Up

Protocol for Asynchronous, Reliable, Secure and Efficient Consensus (PARSEC) Version 2.0

by   Pierre Chevalier, et al.

In this paper we present an open source, fully asynchronous, leaderless algorithm for reaching consensus in the presence of Byzantine faults in an asynchronous network. We prove the algorithm's correctness provided that less than a third of participating nodes are faulty. We also present a way of applying the algorithm to a network with dynamic membership, i.e. a network in which nodes can join and leave at will. The core contribution of this paper is an optimal model in the definition of an asynchronous BFT protocol, and which is resilient to 1/3 byzantine nodes. This model matches an agreement with probability one (unlike some probabilistic methods), and where a common coin is used as a source of randomization so that it respects the FLP impossibility result.


page 1

page 2

page 3

page 4


Analysis of the XRP Ledger Consensus Protocol

The XRP Ledger Consensus Protocol is a previously developed consensus pr...

Asynchronous Consensus Algorithm

This document describes a new consensus algorithm which is asynchronous ...

Consensus on Demand

Digital money can be implemented efficiently by avoiding consensus. Howe...

A Filtering Approach for Resiliency of Distributed Observers against Smart Spoofers

For a Linear Time-Invariant (LTI) system, a network of observers is cons...

On fast probabilistic consensus in the Byzantine setting

In this paper we discuss a leaderless protocol of low communicational co...

Deconstructing Stellar Consensus (Extended Version)

Some of the recent blockchain proposals, such as Stellar and Ripple, all...

Fair Byzantine Agreements for Blockchains

Byzantine general problem is the core problem of the consensus algorithm...