Multi-round Verification Scheme For Transaction Overload In State Sharding

Currently,sharding is the most effective blockchain expansion scheme,among which state sharding has the most application prospect.Theoretically,sharding technology has realized the expansion of blockchain without reducing decentralization.However,in actual operation,when transactions are allocated to one shard according to established rules,they are randomly allocated to the nodes of this shard that have completed state synchronization,which may lead to a large gap in the verification processing capacity of sharding at this time,and then the problem of overload of single shard transaction may occur.In addition,the adjustment of nodes in state sharding is limited by state synchronization,so nodes cannot be randomly scheduled among shards.At present,in the blockchain projects adopting state sharding technology,there is no special discussion on how to deal with the transaction overload that may result from state sharding.Aiming at the possible transaction overload problem in blockchain state sharding,this paper proposes a multi-round verification scheme for transaction overload under the constraint of state sharding.Through multiple rounds of verification of transactions in a shard,after each round of verification,comprehensive points are made according to the communication ability of nodes and the consensus performance of nodes,the transaction load in a shard is calculated according to the transaction load calculation model,and the node campaign strategy is used to effectively organize nodes to conduct transaction verification.On the basis of improving the scale and effectiveness of sharding,the advantages of high-performance nodes are fully exerted,so that overload transactions can be verified in time in subsequent rounds.In this paper,the simulation experiment is carried out in the laboratory environment.Firstly,the sharding scale and transaction verification rounds of this scheme are determined through experiments.Then,the scheme in this paper is compared with the Multi-round of PBFT verification(MRPV)scheme and OmniLedger scheme without transaction overload treatment in terms of transaction verification rate,system throughput,average block time and overload treatment effect of a single sharding.The experiment shows that this scheme can effectively deal with the transaction overload in sharding,shorten the average time of blocking,improve the transaction verification rate and the Transaction Per Second(TPS)of the system while running stably,which provides a valuable reference for the practical application of sharding technology in the future.