# FPC-BI: Fast Probabilistic Consensus within Byzantine Infrastructures

**Authors:** Serguei Popov, William J Buchanan

arXiv: 1905.10895 · 2020-09-15

## TL;DR

This paper introduces FPC-BI, a leaderless, low-communication protocol for fast probabilistic consensus in Byzantine environments, suitable for decentralized systems like cryptocurrencies, using weak to strong consensus techniques and decentralized randomness.

## Contribution

It presents a novel, leaderless consensus protocol with provable high-probability correctness and explicit timing estimates, incorporating decentralized randomness for enhanced trustworthiness.

## Key findings

- Protocol achieves high probability of consensus despite Byzantine nodes.
- Explicit estimates on consensus finalization time are provided.
- Uses decentralized randomness to improve trust in the consensus process.

## Abstract

This paper presents a novel leaderless protocol (FPC-BI: Fast Probabilistic Consensus within Byzantine Infrastructures) with a low communicational complexity and which allows a set of nodes to come to a consensus on a value of a single bit. The paper makes the assumption that part of the nodes are Byzantine, and are thus controlled by an adversary who intends to either delay the consensus, or break it (this defines that 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. Along this the paper also provides explicit estimates on the probability that the protocol finalizes in the consensus state in a given time. This protocol could be applied to reaching consensus in decentralized cryptocurrency systems. A special feature of it 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. This increases the overall trustworthiness of the infrastructure. A core contribution of the paper is that it uses a very weak consensus to obtain a strong consensus on the value of a bit, and which can relate to the validity of a transaction.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1905.10895/full.md

## Figures

4 figures with captions in the complete paper: https://tomesphere.com/paper/1905.10895/full.md

## References

28 references — full list in the complete paper: https://tomesphere.com/paper/1905.10895/full.md

---
Source: https://tomesphere.com/paper/1905.10895