论文标题
Laksa：概率证明协议
LaKSA: A Probabilistic Proof-of-Stake Protocol
论文作者
论文摘要
我们提出了大规模的已知委员会股份协议（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.
