Abstract
Blockchain is a solution for transmission, distribution and decentralized storage of data, the core of which lies in the way to reach consensuses among distributed nodes under trustless environments. Practical Byzantine Fault Tolerance (PBFT) is one of the most popular blockchain consensus mechanisms used nowadays, especially in consortium blockchain. To improve the performance of PBFT, many works have been done since early years. This paper proposes a novel classification approach of improved PBFT algorithms and summarizes several performance indicators of them. The work aims to offer reference for further innovation upon blockchain consensus mechanisms based on improved PBFT under variant circumstances.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
