High-Throughput Permissionless Blockchain Consensus Under Realistic Network Assumptions
Sandro Coretti, Matthias Fitzi, Aggelos Kiayias, Giorgos Panagiotakos, Alexander Russell
Abstract
. Throughput, i.e., the amount of payload data processed per unit of time, is a crucial measure of scalability for blockchain consensus mechanisms. This paper revisits the design of secure, high-throughput proof-of-stake (PoS) protocols in the permissionless setting. Existing high-throughput protocols are either analyzed using overly simplified network models or are designed for permissioned settings, with the task of adapting them to a permissionless environment while maintaining both scalability and adaptive security (which is essential in permissionless environments) remaining an open question. Two particular challenges arise when designing high-throughput protocols in a permissionless setting: message bursts , where the adversary simultaneously releases a large volume of withheld protocol messages, and—in the PoS setting— message equivocations , where the adversary diffuses arbitrarily many versions of a protocol message. It is essential for the security of the ultimately deployed protocol that these issues be captured by the network model. Therefore, this work first introduces a new, realistic network model based on the operation of real-world gossip networks—the standard means of diffusion in permissionless systems, which may involve many thousands of nodes. The model specifically addresses challenges such as message bursts and PoS equivocations and is also of independent interest. The second and main contribution of this paper is Leios, a blockchain protocol that transforms any underlying low-throughput base protocol into a blockchain achieving a throughput corresponding to a
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 6101e5fd-aa40-4f40-8ea1-1f5194130a2bRelated papers
- OHIE: Blockchain Scaling Made SimpleHaifeng Yu, Ivica Nikolic, Ruomu Hou, Prateek SaxenaS&P 2020 · 166 citations
- Prism: Deconstructing the Blockchain to Approach Physical LimitsVivek Kumar Bagaria, Sreeram Kannan, David Tse, Giulia Fanti et al.CCS 2019 · 256 citations
- Security-Performance Tradeoff in DAG-based Proof-of-Work Blockchain ProtocolsShichen Wu, Puwen Wei, Ren Zhang, Bowen JiangNDSS 2024
- SpotLess: Concurrent Rotational Consensus Made Practical Through Rapid View SynchronizationDakai Kang, Sajjad Rahnama, Jelle Hellings, Mohammad SadoghiICDE 2024 · 10 citations
- A Weak Consensus Algorithm and Its Application to High-Performance BlockchainQin Wang, Rujia LiINFOCOM 2021 · 27 citations
