StableShard: Stable and Scalable Blockchain Sharding with High Concurrency via Collaborative Committees
Mingzhe Li, You Lin, and Jin Zhang

TL;DR
StableShard introduces a novel blockchain sharding approach that balances high concurrency and security by asymmetric roles and parameter tuning, enabling scalable performance without system stagnation.
Contribution
The paper proposes StableShard, a new sharding architecture with asymmetric roles and cross-layer protocols that improve scalability and security in blockchain systems.
Findings
Achieves up to 10x higher throughput than existing solutions.
Maintains stable concurrency under attack scenarios.
Ensures safety and liveness with many small proposer shards.
Abstract
Sharding enhances blockchain scalability by partitioning nodes into multiple groups for concurrent transaction processing. Configuring a large number of small shards usually helps improve transaction concurrency, but it also increases the fraction of malicious nodes in each shard, easily causing shard corruption and jeopardizing system security. Existing works attempt to improve concurrency by reducing shard sizes while maintaining security, but typically rely on time-consuming recovery of corrupted shards to restore liveness and network-wide consensus. This causes severe system stagnation and limits scalability. To address this, we present StableShard, a sharded blockchain that securely provides high concurrency with stable and scalable performance. The core idea is to carefully co-design the division of labor between proposer shards (PSs) and finalizer committees (FCs): we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlockchain Technology Applications and Security · Cloud Computing and Resource Management · IoT and Edge/Fog Computing
