OptChain: Optimal Transactions Placement for Scalable Blockchain Sharding
Lan N. Nguyen, Truc Nguyen, Thang N. Dinh, My T. Thai

TL;DR
OptChain introduces a novel transaction placement method for sharded blockchains that significantly reduces cross-shard transactions, boosting throughput and decreasing confirmation times through an online graph-based approach.
Contribution
The paper presents OptChain, a new sharding paradigm that minimizes cross-shard transactions using an online graph method, improving performance and scalability.
Findings
Up to 10-fold reduction in cross-shard transactions
More than 2x decrease in confirmation time
50% increase in throughput
Abstract
A major challenge in blockchain sharding protocols is that more than 95% transactions are cross-shard. Not only those cross-shard transactions degrade the system throughput but also double the confirmation time, and exhaust an already scarce network bandwidth. Are cross-shard transactions imminent for sharding schemes? In this paper, we propose a new sharding paradigm, called OptChain, in which cross-shard transactions are minimized, resulting in almost twice faster confirmation time and throughput. By treating transactions as a stream of nodes in an online graph, OptChain utilizes a lightweight and on-the-fly transaction placement method to group both related and soon-related transactions into the same shards. At the same time, OptChain maintains a temporal balance among shards to guarantee the high parallelism. Our comprehensive and large-scale simulation using Oversim P2P library…
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.
