Proof of Stake (PoS) protocols rely on voting mechanisms to reach consensus on the current state. If an enhanced majority of staking nodes, also called validators, agree on a proposed block, then this block is appended to the blockchain. Yet, these protocols remain vulnerable to faults caused by validators who abstain either accidentally or maliciously. To protect against such faults while retaining the PoS selection and reward allocation schemes, we study weighted voting in validator committees. We formalize the block creation process and introduce validators' voting profiles which we update by a multiplicative weights algorithm relative to validators' voting behavior and aggregate blockchain rewards. Using this framework, we leverage weighted majority voting rules that optimize collective decision making to show, both numerically and analytically, that the consensus mechanism is more robust if validators' votes are appropriately scaled. We raise potential issues and limitations of weighted voting in trustless, decentralized networks and relate our results to the design of current PoS protocols.
翻译:Scake (Pos) 协议的证明取决于投票机制才能就当前状态达成共识。 如果增加多数的接点(也称为验证人)就一个拟议的区块达成一致,那么这个区块就会被附在块链上。 然而,这些协议仍然容易受到意外或恶意弃权的验证人造成的差错的伤害。为了在保留Pos 选择和奖励分配计划的同时防范这些差错,我们在验证委员会中研究加权投票。我们正式确定区块创建过程并引入验证人的投票剖面图,我们用一个与验证人的投票行为和总块链收益有关的倍增权重算进行更新。我们利用这个框架,利用加权多数投票规则优化集体决策,在数字上和分析上表明,如果验证人的投票规模适当的话,协商一致机制就更加有力。我们提出了无信任、分散的网络加权投票的潜在问题和限制,并将我们的结果与当前的Pos 协议的设计联系起来。