Logo image
LaKSA: A Probabilistic Proof-of-Stake Protocol
Conference proceeding

LaKSA: A Probabilistic Proof-of-Stake Protocol

Daniel Reijsbergen, Pawel Szalachowski, Junming Ke, Zengpeng Li, Jianying Zhou and Internet Soc
28TH ANNUAL NETWORK AND DISTRIBUTED SYSTEM SECURITY SYMPOSIUM (NDSS 2021)
01/01/2021

Abstract

Computer Science Computer Science, Information Systems Computer Science, Theory & Methods Science & Technology Technology
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.
url
https://doi.org/10.14722/ndss.2021.24164View
Published (Version of record) Open

Metrics

1 Record Views

Details

Logo image