Voting-based probabilistic consensuses and their applications in distributed ledgers

04/12/2021
by   Serguei Popov, et al.
0

We review probabilistic models known as majority dynamics (also known as threshold Voter Models) and discuss their possible applications for achieving consensus in cryptocurrency systems. In particular, we show that using this approach straightforwardly for practical consensus in Byzantine setting can be problematic and requires extensive further research. We then discuss the FPC consensus protocol which circumvents the problems mentioned above by using external randomness.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 41

11/20/2019

Robustness and efficiency of leaderless probabilistic consensus protocols within Byzantine infrastructures

This paper investigates leaderless binary majority consensus protocols w...
06/01/2020

Fast Probabilistic Consensus with Weighted Votes

The fast probabilistic consensus (FPC) is a voting consensus protocol th...
06/10/2020

Efficient democratic decisions via nondeterministic proportional consensus

Are there voting methods which (i) give everyone, including minorities, ...
03/12/2021

Reaching Agreement in Competitive Microbial Systems

In this work, we consider distributed agreement tasks in microbial distr...
05/25/2021

Payment Does Not Imply Consensus (For Distributed Payment Systems)

Decentralized payment systems such as Bitcoin have become massively popu...
04/11/2021

Simple Majority Consensus in Networks with Unreliable Communication

In this work, we analyze the performance of a simple majority-rule proto...
11/03/2020

AWARE: Adaptive Wide-Area Replication for Fast and Resilient Byzantine Consensus

With upcoming blockchain infrastructures, world-spanning Byzantine conse...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.