ParaBFT: An Efficient Parallel Asynchronous BFT Agreement

With the increasing need for safeguarding confidential and secure healthcare information, Blockchain has become a pioneering approach to managing medical data due to its decentralized structure, resistance to tampering, and high level of transparency. Protocols for Asynchronous Byzantine Fault Tolerance (BFT) are fundamental for maintaining the depend-ability and uniformity of distributed systems. Nonetheless, these mechanisms still face challenges in terms of performance and efficiency. This work introduces an efficient parallel asynchronous BFT agreement (ParaBFT). First, we replace the traditional ABA with MVBA, enabling the processing of multiple values or proposals in each round of decision-making, which significantly enhances decision-making efficiency. Then, to optimize the message processing flow, ParaBFT incorporates a First-In-First-Out (FIFO) queue as a buffer pool, ensuring the simplicity and fairness of the processing logic. Finally, our experimental analysis reveals that ParaBFT offers enhanced throughput and reduced latency for managing large-scale transactions.