Fast Probabilistic Consensus with Weighted Votes

The fast probabilistic consensus (FPC) is a voting consensus protocol that is robust and efficient in Byzantine infrastructure. We propose an adaption of the FPC to a setting where the voting power is proportional to the nodes reputations. We model the reputation using a Zipf law and show using simu...

Full description

Saved in:
Bibliographic Details
Main Authors Müller, Sebastian, Penzkofer, Andreas, Kuśmierz, Bartosz, Camargo, Darcy, Buchanan, William J
Format Journal Article
LanguageEnglish
Published 01.06.2020
Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Online AccessGet full text

Cover

More Information
Summary:The fast probabilistic consensus (FPC) is a voting consensus protocol that is robust and efficient in Byzantine infrastructure. We propose an adaption of the FPC to a setting where the voting power is proportional to the nodes reputations. We model the reputation using a Zipf law and show using simulations that the performance of the protocol in Byzantine infrastructure increases with the Zipf exponent. Moreover, we propose several improvements of the FPC that decrease the failure rates significantly and allow the protocol to withstand adversaries with higher weight. We distinguish between cautious and berserk strategies of the adversaries and propose an efficient method to detect the more harmful berserk strategies. Our study refers at several points to a specific implementation of the IOTA protocol, but the principal results hold for general implementations of reputation models.
Bibliography:Conference: FTC 2020 - Future Technologies Conference 2020
DOI:10.48550/arxiv.2006.00928