A secure and scalable two-layer consensus algorithm based on PBFT

Abstract

Practical Byzantine Fault Tolerance (PBFT), the widest-used consensus algorithm in the alliance blockchain, suffers from high communications complexity and relatively low scalability, making it difficult to support large-scale networks. To overcome these limitations, we propose a secure and scalable consensus algorithm, Vague Sets-based Double Layer PBFT (VSDL-PBFT). Roles and tasks of consensus nodes are redesigned. Three-phase consensus process of the original PBFT is optimized. Through these approaches, the communication complexity of the algorithm is significantly reduced. In order to better fit the complexity of voting in the real world, we use a vague set to select primary nodes of consensus groups. This can greatly reduce the likelihood of malicious nodes being selected as the primary nodes. The experimental results show that the VSDL-PBFT consensus algorithm improves the system’s fault tolerance, it also achieves better performance in algorithm security, communications complexity, and transaction throughput compared to the baseline consensus algorithms.