Abstract
With the continuous development of blockchain technology, the application scenarios of alliance blockchain are also increasing. The consensus algorithm can achieve distributed consensus among nodes in the network. At present, the practical byzantine fault tolerance algorithm (PBFT) consensus algorithm commonly used in alliance blockchain requires all nodes in the network to participate in the consensus process. Experiments show that when the number of consensus nodes in the system exceeds 100, the bandwidth consumption and consensus delay will greatly increase, resulting in the inability of PBFT to be applied. In scenes with many nodes. How to improve the performance of alliance blockchains safely and efficiently has become an urgent problem to be solved at present. For the PBFT commonly used in alliance blockchains, there are some problems, such as large communication overhead, simple selection of master nodes, and inability to expand and exit nodes dynamically in the network. This paper proposes an improved algorithm tPBFT (trust-based practical Byzantine algorithm), which is suitable for high-frequency trading scenarios of consortium chains. By introducing a trust equity scoring mechanism between nodes in the network, the list of consensus nodes can be dynamically adjusted. tPBFT simplifies the pre-prepare stage of the PBFT consensus process, and realizes the verification of the hash transaction list in the reply stage, thereby reducing the interaction overhead between network nodes. Theoretical analysis and experiments show that when the number of nodes in the network is greater than 30, with the further increase of the number of nodes, the improved tPBFT algorithm has a relatively large performance in terms of node communication overhead, consensus efficiency and scalability outperforms the PBFT algorithm.
Highlights
This paper proposes an improved algorithm tPBFT, which is suitable for high-frequency trading scenarios of consortium chains
The tPBFT optimizes practical byzantine fault tolerance algorithm (PBFT) algorithm in three aspects: leader node election, transaction list hash and consensus node selection, so that tPBFT maintains high transactions completed per second (TPS) when there are a large number of nodes, which is more suitable for high-frequency transactions and scalable network node scenarios, so that the alliance blockchain can be popularized and applied in more fields
Based on the PBFT algorithm, this paper proposes an optimized consensus algorithm, tPBFT, suitable for scalable nodes of alliance blockchain and high-frequency transaction scenarios, which is widely used in public service fields such as carbon trading, government supervision, supply chain services, and intelligent inspection
Summary
In the process of classification and performance improvement evolution of the consensus algorithm, the consensus algorithm mentioned above is representative in the blockchain system. PBFT supporting Byzantine fault tolerance is optimized to continuously improve transaction speed and performance under the condition of ensuring security. It is the first choice of the alliance blockchain. The PBFT algorithm can solve the Byzantine generals problem, and even if there are a certain number of Byzantine nodes (malicious nodes), a consensus can still be reached among distributed nodes This algorithm requires all nodes in the network to participate in the consensus process. Hao, X and others have optimized the stability of PBFT21 This scheme realizes the dynamic joining and exiting of nodes in the cluster and introduces the centralized management node CA21.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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
