arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2006.01427cs.CR
收藏

LaKSA:一种概率权益证明协议

LaKSA: A Probabilistic Proof-of-Stake Protocol

Daniel Reijsbergen, Pawel Szalachowski, Junming Ke, Zengpeng Li, Jianying Zhou

摘要:

我们提出了大规模已知委员会基于利益的协议(LaKSA),这是一种基于链的权益证明协议,专用于但不限于加密货币。LaKSA通过轻量级委员会投票最大限度地减少了节点之间的交互,从而产生了比竞争系统更简单,更强大,更可扩展的提案。它还减轻了以前系统的其他缺点,例如高奖励方差和长确认时间。LaKSA可以通过设计支持大量节点,并提供概率安全保证,其中客户端通过基于其区块链视图计算事务被恢复的概率来做出提交决策。我们提出了一个彻底的分析LaKSA和报告其实施和评估。此外,我们证明安全性的新技术可以更广泛地应用于其他权益证明协议。

英文摘要:

We present Large-scale Known-committee Stake-based Agreement (LaKSA), a chain-based Proof-of-Stake protocol that is dedicated, but not limited, to cryptocurrencies. LaKSA minimizes interactions between nodes through lightweight committee voting, resulting in a simpler, more robust, and more scalable proposal than competing systems. It also mitigates other drawbacks of previous systems, such as high reward variance and long confirmation times. LaKSA can support large numbers of nodes by design, and provides probabilistic safety guarantees in which a client makes commit decisions by calculating the probability that a transaction is reverted based on its blockchain view. We present a thorough analysis of LaKSA and report on its implementation and evaluation. Furthermore, our new technique of proving safety can be applied more broadly to other Proof-of-Stake protocols.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑