Abstract

Blockchain was first proposed in 2009, it is a kind of distributed ledger system with peer-to-peer network, which has drawn wide spread attention because of its characteristics such as decentralization, security and credibility. The consensus algorithm of the blockchain is a mechanism for achieving agreement among the nodes in the blockchain. How to reach consensus quickly and effectively is the core issue of the blockchain. Byzantine nodes are invalid or malicious nodes in the blockchain. This paper considers the actual situation of Byzantine nodes in the blockchain. For the problem that the classical PBFT algorithm has too much communication spending and cannot dynamically follow the change of consensus nodes, an improved PBFT algorithm in this paper is proposed. In the improved Practical Byzantine consensus algorithm (IMP-PBFT), the convergence speed of the consensus process is effectively improved under the condition of the fault tolerance rate. The experiment proves the accuracy and effectiveness of the improved PBFT algorithm.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.