Improving Fault Tolerance in Blockchain Sharding using One-to-Many Block-to-Shard Mapping

被引:1
作者
Ramburn, Tirathraj [1 ]
Goswami, Dhrubajyoti [1 ]
机构
[1] Concordia Univ, Montreal, PQ, Canada
来源
2023 IEEE 35TH INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING, SBAC-PAD | 2023年
关键词
Blockchain; Sharding; Multi-Round Consensus; Faulty block detection; Throughput; Transaction mapping; Hierarchical blockchain; Byzantine Fault Tolerance; CONSENSUS;
D O I
10.1109/SBAC-PAD59825.2023.00019
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The goal of sharding in a contemporary Blockchain system is to increase throughput linearly in proportion to the number of shards. This is achieved in practice by one-to-one mapping of each transaction block to a shard, with the assumption that each shard is 'perfect' and hence cannot fail. The notion of perfection is achieved by forming shards that have negligible failure probabilities. This contemporary approach to blockchain sharding has two drawbacks: (1) shards tend to be large in size to maintain low failure probability, which can negatively affect performance and throughput; (2) the 'perfect' shard assumption can easily be breached if any shard becomes faulty, which can fail an entire blockchain system because there is no fault-detection mechanism during transaction-processing (i.e., faulty blocks approved by faulty shards may only be detected after being appended to the blockchain). To overcome these drawbacks, this paper presents a multi-round consensus scheme which adopts one-to-many mapping of a transaction block to k shards, followed by a second consensus round among the k shard leaders (inter-shard consensus) in an epoch to validate and commit a transaction block with finality. In return, the following are achieved: (1) possibility of increased fault tolerance, despite using smaller shard sizes, because the collective failure probability of a group of k small shards can be much lower than the failure probability of an individual larger shard with the proper selection of the values of k and other parameters; (2) capability of faulty block detection with high probability during transaction processing; and (3) relaxation of the 'perfect' shard assumption so that the system can be tolerant to more faulty shards and still maintain safety. Detailed theoretical analyses are presented which demonstrate the benefits of such a multi-round block validation approach over contemporary approaches in terms of achieving better fault tolerance without compromising on throughput.
引用
收藏
页码:98 / 108
页数:11
相关论文
共 24 条
[1]  
Abraham I., 2019, Synchrony, Asynchrony and Partial synchrony
[2]  
Al-Bassam M, 2017, Arxiv, DOI arXiv:1708.03778
[3]  
[Anonymous], 2012, IACR CRYPTOL EPRINT
[4]  
Baudet Mathieu, 2019, State Machine Replication in the Libra Blockchain
[5]   Short signatures from the Weil pairing [J].
Boneh, D ;
Lynn, B ;
Shacham, H .
JOURNAL OF CRYPTOLOGY, 2004, 17 (04) :297-319
[6]  
Buterin V., 2021, Why sharding is great: Demystifying the technical properties
[7]   Practical byzantine fault tolerance and proactive recovery [J].
Castro, M ;
Liskov, B .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2002, 20 (04) :398-461
[8]   CONSENSUS IN THE PRESENCE OF PARTIAL SYNCHRONY [J].
DWORK, C ;
LYNCH, N ;
STOCKMEYER, L .
JOURNAL OF THE ACM, 1988, 35 (02) :288-323
[9]  
Hanke T., 2018, CoRR
[10]   Determining Optimal Shard Size in a Hierarchical Blockchain Architecture [J].
Kantesariya, Shyam ;
Goswami, Dhrubajyoti .
2020 IEEE INTERNATIONAL CONFERENCE ON BLOCKCHAIN AND CRYPTOCURRENCY (IEEE ICBC), 2020,