PGS-BFT: A Pipeline-Based Graph Structure Byzantine Fault Tolerance Consensus Algorithm

The Byzantine fault-tolerant (BFT) consensus algorithm is widely used in blockchain systems due to its ability to tolerate malicious nodes and ensure system consistency. However, existing consensus protocols still face significant challenges. This paper proposes a pipeline-based graph structure Byzantine Fault Tolerant (PGS-BFT) consensus algorithm. It leverages parallel pipeline execution to accelerate block generation efficiency. By synchronizing block dependencies among nodes, all validated blocks eventually form an ordered graph structure within a cycle, enabling nodes to achieve final consensus. The proposed PGS-BFT algorithm effectively improves system consensus efficiency and reduces transaction latency while ensuring Byzantine fault-tolerant security. It can be applied to existing consortium blockchain platforms.