Advances in Consortium Chain Scalability: A Review of the Practical Byzantine Fault Tolerance Consensus Algorithm

Blockchain technology, renowned for its decentralized, immutable, and transparent features, offers a reliable framework for trust in distributed systems. The growing popularity of consortium blockchains, which include public, private, hybrid, and consortium chains, stems from their balance of privacy and collaboration. A significant challenge in these systems is the scalability of consensus mechanisms, particularly when employing the Practical Byzantine Fault Tolerance (PBFT) algorithm. This review focuses on enhancing PBFT's scalability, a critical factor in the effectiveness of consortium chains. Innovations such as Boneh–Lynn–Shacham (BLS) signatures and Verifiable Random Functions (VRF) are highlighted for their ability to reduce algorithmic complexity and increase transaction throughput. The discussion extends to real-world applications, particularly in platforms like Hyperledger Fabric, showcasing the practical benefits of these advancements. This paper provides a concise overview of the latest methodologies that enhance the performance scalability of PBFT-based consortium chains, serving as a valuable resource for researchers and practitioners aiming to optimize these systems for high-performance demands.

@article{Wahab2024,
  title     = {Advances in Consortium Chain Scalability: A Review of the Practical Byzantine Fault Tolerance Consensus Algorithm},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {15},
  number    = {7},
  year      = {2024},
  publisher = {The Science and Information Organization},
  author    = {Nur Haliza Abdul Wahab and Zhang Dayong and Juniardi Nur Fadila and Keng Yinn Wong},
  doi       = {10.14569/IJACSA.2024.0150796},
  url       = {https://doi.org/10.14569/IJACSA.2024.0150796}
}