State Synchronization Scheme Supporting Multiple Rounds of PBFT Verification Algorithm in Sharding

Sharding is one of the on-chain solutions for blockchain scalability.State sharding can solve the scalability problem of the public chain without reducing security.Each state sharding only maintains a part of the state.There is a certain probability that the proportion of Byzantine nodes will exceed...

Full description

Saved in:
Bibliographic Details
Published inJi suan ji ke xue Vol. 49; p. 706
Main Authors Gao, Dong-xue, Li, Zhi-huai, Duan, Pei-pei, Chen, Yu-hua
Format Journal Article
LanguageChinese
Published Chongqing Guojia Kexue Jishu Bu 01.01.2022
Subjects
Algorithms
Cryptography
Nodes
Queues
Synchronism
Verification
Online AccessGet full text

Cover

More Information
Summary:Sharding is one of the on-chain solutions for blockchain scalability.State sharding can solve the scalability problem of the public chain without reducing security.Each state sharding only maintains a part of the state.There is a certain probability that the proportion of Byzantine nodes will exceed one third in a single sharding,even if the probability of Byzantine nodes is no more than one third in all nodes with PBFT consensus algorithm,resulting in the failure of verifying the consensus.Therefore,the nodes in the sharding need to be reconfigured periodically,and multi-round PBFT consensus verification algorithm with small time slots can effectively solve this problem.However,stateless nodes cannot work effectively,and new nodes need to synchronize the state of the sharding.The state synchronization scheme based on candidate nodes queue for multi-round PBFT consensus verification algorithm is proposed to solve this problem.Nodes that are in synchronized state first enter the queue of candidate nodes,and di
ISSN:1002-137X