Optimal Sharding for Scalable Blockchains with Deconstructed SMR
Jianting Zhang, Zhongtang Luo, Raghavendra Ramesh, Aniket Kate
摘要
Sharding enhances blockchain scalability by dividing system nodes into multiple shards to handle transactions in parallel. However, a size-security dilemma where every shard must be large enough to ensure its security constrains the efficacy of individual shards and the degree of sharding itself. Most existing sharding solutions therefore rely on either weakening the adversary or making stronger assumptions on network links. This paper presents Arete, an optimally scalable blockchain sharding protocol designed to resolve the dilemma based on an observation that if individual shards can tolerate a higher fraction of (Byzantine) faults, we can securely create smaller shards in a larger quantity. The key idea of Arete, therefore, is to improve the security resilience/threshold of shards by dividing the blockchain's State Machine Replication (SMR) process itself. Similar to modern blockchains, Arete first decouples SMR in three steps: transaction dissemination, ordering, and execution. However, unlike other blockchains, for Arete, a single ordering shard performs the ordering task while multiple processing shards perform the dissemination and execution of blocks. As processing shards do not run consensus, each of those can tolerate up to half compromised nodes. Moreover, the SMR process in the ordering shard is extremely lightweight as it only operates on the block digests. Second, Arete considers safety and liveness against Byzantine failures separately to improve the safety threshold further while tolerating temporary liveness violations in a controlled manner. Apart from the creation of more optimal-size shards, such a deconstructed SMR scheme also empowers us to devise a novel certify-order-execute architecture to fully parallelize transaction handling, thereby significantly improving the performance of sharded blockchain systems. We implement Arete and evaluate it on a geo-distributed AWS environment by running up to 500 nodes. Our results demonstrate that Arete outperforms the state-of-the-art sharding protocols in terms of scalability, transaction throughput, and cross-shard confirmation latency without compromising on intra-shard confirmation latency.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper40
- A Secure Sharding Protocol For Open BlockchainsLoi Luu, Viswesh Narayanan, Chaodong Zheng, Kunal Baweja 等CCS 2016 · 被引用 1,392 次
- OmniLedger: A Secure, Scale-Out, Decentralized Ledger via ShardingEleftherios Kokoris-Kogias, Philipp Jovanovic, Linus Gasser, Nicolas Gailly 等S&P 2018 · 被引用 1,145 次
- RapidChain: Scaling Blockchain via Full ShardingMahdi Zamani, Mahnush Movahedi, Mariana RaykovaCCS 2018 · 被引用 1,084 次
- Chainspace: A Sharded Smart Contracts PlatformMustafa Al-Bassam, Alberto Sonnino, Shehar Bano, Dave Hrycyszyn 等NDSS 2018 · 被引用 313 次
- Narwhal and Tusk: a DAG-based mempool and efficient BFT consensusGeorge Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander SpiegelmanEuroSys 2022 · 被引用 259 次
相关 Paper
- Sharon: Secure and Efficient Cross-shard Transaction Processing via Shard RotationShan Jiang, Jiannong Cao, Cheung Leong Tung, Yuqin Wang 等INFOCOM 2024 · 被引用 22 次
- CoChain: High Concurrency Blockchain Sharding via Consensus on ConsensusMingzhe Li, You Lin, Jin Zhang, Wei WangINFOCOM 2023 · 被引用 42 次
- Realizing Corrupted-Shard Tolerance: A Sharding Blockchain with Preserving Global ResilienceYizhong Liu, Andi Liu, Zhuocheng Pan, Yuxuan Hu 等CCS 2025 · 被引用 1 次
- Prophet: Conflict-Free Sharding Blockchain via Byzantine-Tolerant Deterministic OrderingZicong Hong, Song Guo, Enyuan Zhou, Jianting Zhang 等INFOCOM 2023 · 被引用 40 次
- A Two-Layer Blockchain Sharding Protocol Leveraging Safety and Liveness for Enhanced PerformanceYibin Xu, Jingyi Zheng, Boris Düdder, Tijs Slaats 等NDSS 2024
