A Blockchain Consensus for Message Queue Based on Byzantine Fault Tolerance

Blockchain technology is developing rapidly, and many companies that develop and apply blockchain technology have gradually risen. Most companies choose to use the consortium blockchain. Because the consortium blockchain is for small-scale groups or institutions, identity authentication is required to join the consortium blockchains. Therefore, security can be guaranteed to a certain extent. Blockchain is often considered as a distributed accounting system. An important mechanism to ensure the stable operation of this accounting system is to ensure consistency among the distributed ledgers. The consensus mechanism in the blockchain is the algorithm that accomplishes this function. To improve throughput, many consortium blockchains use message queues as the consensus algorithm. However, the message queue consensus cannot tolerate malicious nodes. Aiming at this problem, this paper designs and implements a consensus for message queue based on Byzantine fault tolerance, which improves and combines message queue and PBFT. Moreover, it is verified through experiments that the consensus algorithm can reach the general level of TPS. The system can still operate normally when malicious nodes appear within the tolerable range, which has certain robustness and efficiency.