DeepAI AI Chat
Log In Sign Up

On fast probabilistic consensus in the Byzantine setting

by   Serguei Popov, et al.
IOTA Foundation
University of Campinas

In this paper we discuss a leaderless protocol of low communicational complexity which allows a set of nodes to come to a consensus on a value of a bit. In addition, we assume that part of the nodes are Byzantine, i.e., they are controlled by an adversary who intends to either delay the consensus, or break it (i.e., make at least a couple of honest nodes come to different conclusions). We prove that, nevertheless, the protocol works with high probability when its parameters are suitably chosen, and we also provide some explicit estimates on the probability that the protocol finalizes in the consensus state in a given time. This protocol can possibly be applied to reaching consensus in decentralized cryptocurrency systems. A special feature of our protocol is that it makes use of a sequence of random numbers which are either provided by a trusted source or generated by the nodes themselves using some decentralized random number generating protocol.


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...

SENATE: A Permissionless Byzantine Consensus Protocol in Wireless Networks

The blockchain technology has achieved tremendous success in open (permi...

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

In this paper we present an open source, fully asynchronous, leaderless ...

Voting-based probabilistic consensuses and their applications in distributed ledgers

We review probabilistic models known as majority dynamics (also known as...

Robustness of the Tangle 2.0 Consensus

In this paper, we investigate the performance of the Tangle 2.0 consensu...

Byzantine Resilience at Swarm Scale: A Decentralized Blocklist Protocol from Inter-robot Accusations

The Weighted-Mean Subsequence Reduced (W-MSR) algorithm, the state-of-th...

Fast Probabilistic Consensus with Weighted Votes

The fast probabilistic consensus (FPC) is a voting consensus protocol th...