E-PBFT: An Improved Consensus Mechanism Based on PBFT

To address the problems of high communication overhead and complexity of the practical Byzantine fault-tolerant (PBFT) consensus algorithm applied to federated chains, an efficient Byzantine fault-tolerant consensus algorithm E-PBFT is proposed based on the improved PBFT algorithm. First, the random matching rules are designed to design the all-nodes broadcast communication between nodes as a single communication of random nodes. Second, the random matching rules are embedded in the Commit phase of the PBFT algorithm. Finally, the progress of lagging nodes is synchronized using an acknowledgement mechanism. Experimental analysis shows that compared with the PBFT algorithm, the E-PBFT algorithm can significantly reduce the transaction latency and increase the throughput of the federated chain by more than 30% while having Byzantine fault tolerance.