TY - GEN
T1 - Scaling Blockchain via a Lightweight Tree-based Sharding System
AU - Guan, Zhenyu
AU - Zhang, Yang
AU - Li, Shizhong
AU - Chen, Ruonan
AU - Li, Dawei
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - The scalability issue in blockchain seriously restricts the performance of blockchain and limits the practical development of blockchain applications. Existing schemes are mainly divided into blockchain sharding and off-chain payment channels. Blockchain sharding technology splits the blockchain network into multiple sub-networks, each of which is called a shard. Each shard contains only some nodes, which can independently verify, store, and process transactions in parallel, thus improving the performance and handling capacity of the system. Most of the existing shard technologies start from the complete shard type, dividing each shard in terms of storage and communication, in order to maximize the system handling capacity. However, these approaches also bring with them the processing burden of cross-shard transactions. This paper proposes a sharding system with a tree-based structure, dividing the shard system into i-shards and b-shards according to their respective functions. Combining these two features with the consensus approach in design, we reduce the communication and consensus complexity of cross- shard transaction processing. In addition, we use a lightweight storage design, which reduces the storage pressure on the system. Finally, we analyze the safety of the system during operation and investigate the pressure advantage of utilizing this particular structure. With 6,400 nodes and 32 shards in the system, we come up with a pretty good security guarantee.
AB - The scalability issue in blockchain seriously restricts the performance of blockchain and limits the practical development of blockchain applications. Existing schemes are mainly divided into blockchain sharding and off-chain payment channels. Blockchain sharding technology splits the blockchain network into multiple sub-networks, each of which is called a shard. Each shard contains only some nodes, which can independently verify, store, and process transactions in parallel, thus improving the performance and handling capacity of the system. Most of the existing shard technologies start from the complete shard type, dividing each shard in terms of storage and communication, in order to maximize the system handling capacity. However, these approaches also bring with them the processing burden of cross-shard transactions. This paper proposes a sharding system with a tree-based structure, dividing the shard system into i-shards and b-shards according to their respective functions. Combining these two features with the consensus approach in design, we reduce the communication and consensus complexity of cross- shard transaction processing. In addition, we use a lightweight storage design, which reduces the storage pressure on the system. Finally, we analyze the safety of the system during operation and investigate the pressure advantage of utilizing this particular structure. With 6,400 nodes and 32 shards in the system, we come up with a pretty good security guarantee.
KW - Binary Tree
KW - Blockchain
KW - Lightweight
KW - Scalability
KW - Sharding
UR - https://www.scopus.com/pages/publications/85176800743
U2 - 10.1109/NaNA60121.2023.00072
DO - 10.1109/NaNA60121.2023.00072
M3 - 会议稿件
AN - SCOPUS:85176800743
T3 - Proceedings - 2023 International Conference on Networking and Network Applications, NaNA 2023
SP - 397
EP - 403
BT - Proceedings - 2023 International Conference on Networking and Network Applications, NaNA 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2023 International Conference on Networking and Network Applications, NaNA 2023
Y2 - 18 August 2023 through 21 August 2023
ER -