加权投票的快速概率共识
Fast Probabilistic Consensus with Weighted Votes
摘要：
快速概率共识（FPC）是一种投票共识协议，在拜占庭基础设施中是健壮和高效的。我们提出了一个自适应的FPC的设置，其中的投票权是成比例的节点的声誉。我们使用Zipf定律对声誉进行建模，并使用模拟表明，该协议在拜占庭基础设施中的性能随着Zipf指数的增加而增加。此外，我们提出了几个改进的FPC，降低故障率显着，并允许协议承受对手更高的重量。我们区分谨慎和狂暴策略的对手，并提出了一个有效的方法来检测更有害的狂暴策略。我们的研究在几个方面提到了IOTA协议的具体实现，但主要结果适用于声誉模型的一般实现。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
