Divide \& Scale: formalization and roadmap to robust sharding

DOI10.1007/978-3-031-32733-9_10arXiv1910.10434OpenAlexW4377971973MaRDI QIDQ6188156

Z. Avarikioti, Lefteris Kokoris Kogias, Roger Wattenhofer, Antoine Desjardins

Publication date: 11 January 2024

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.10434

zbMATH Keywords

scalabilityformalizationblockchainssharding

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Unnamed Item
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Batching techniques for accumulators with applications to IOPs and stateless blockchains
• Non-interactive proofs of proof-of-work
• On trees, chains and fast transactions in the blockchain
• Secure High-Rate Transaction Processing in Bitcoin
• The Bitcoin Backbone Protocol: Analysis and Applications
• Asynchronous consensus and broadcast protocols
• The Byzantine generals problem
• HotStuff
• Analysis of the Blockchain Protocol in Asynchronous Networks
• SoK: blockchain light clients

This page was built for publication: Divide \& Scale: formalization and roadmap to robust sharding