A Comparative Analysis of the Efficiency of Blockchain Consensus Algorithms: Proof of Work, Proof of Stake, Delegated Proof of Stake, and Practical Byzantine Fault Tolerance

Authors

  • Desman Karya Jaya Zega Universitas Budi Darma Author
  • Laurensius So Putra Jaya Halawa Universitas Budi Darma Author
  • Siaman Lase Universitas Budi Darma Author
  • Melissa Putri Hutabarat Universitas Budi Darma Author

Keywords:

Blockchain, Consensus Algorithm, Proof of Stake, Proof of Work, Practical Byzantine Fault Tolerance, Delegated Proof of Stake

Abstract

The rapid development of blockchain technology has accelerated the adoption of distributed systems across various sectors, including financial services, supply chain management, the Internet of Things (IoT), and digital government. Consensus algorithms play a fundamental role in blockchain by ensuring transaction validity and data consistency without relying on a centralized authority. Since each consensus mechanism exhibits different characteristics, a comparative analysis is required to identify its strengths and limitations. This study aims to analyze and compare the efficiency of four major blockchain consensus algorithms, namely Proof of Work (PoW), Proof of Stake (PoS), Delegated Proof of Stake (DPoS), and Practical Byzantine Fault Tolerance (PBFT). The research employed a comparative literature study by collecting, selecting, and analyzing relevant scientific publications. The comparison was conducted based on transaction throughput, energy efficiency, communication complexity, transaction finality, network characteristics, and fault tolerance. The results indicate that no single consensus algorithm provides optimal performance across all evaluation parameters. PoW offers high security and decentralization but suffers from high energy consumption and low throughput. PoS provides a balanced trade-off among energy efficiency, security, and scalability, while DPoS improves transaction capacity through a delegated validator mechanism. PBFT achieves high throughput and instant transaction finality but is more suitable for permissioned blockchain environments with a limited number of participating nodes. This study proposes a comparative analysis framework that can serve as a reference for selecting an appropriate consensus algorithm based on blockchain implementation requirements.

References

Castro, M., & Liskov, B. (1999). Practical Byzantine Fault Tolerance. Proceedings of the Third Symposium on Operating Systems Design and Implementation (OSDI), 173–186.

Feng, W. (2025). A comprehensive survey on blockchain technology: Consensus algorithms, data storage mechanisms, and architectures. Applied and Computational Engineering. https://doi.org/10.54254/2755-2721/2025

Gao, S., Yu, T., Zhu, J., & Cai, W. (2019). T-PBFT: An EigenTrust-Based Practical Byzantine Fault Tolerance Consensus Algorithm. Future Generation Computer Systems, 94, 111–123. https://doi.org/10.1016/j.future.2018.11.041

Ge, Y., Zhang, Y., Wang, X., & Liu, Z. (2022). Survey of consensus algorithms for Proof of Stake blockchain. Security and Communication Networks, 2022, 1–18. https://doi.org/10.1155/2022/2812526

Handoko, R. M., Ahmad Trisna, B. A., Pratama, R. D., & Parhusip, J. (2024). Implementasi blockchain untuk keamanan sistem pembayaran digital dan optimasi transaksi keuangan. Teknik: Jurnal Ilmu Teknik dan Informatika, 4(2), 64–74.

Li, W., Andreina, S., Bohli, J. M., & Karame, G. (2017). Securing Proof-of-Stake blockchain protocols. In Lecture Notes in Computer Science (Vol. 10436, pp. 297–315). Springer. https://doi.org/10.1007/978-3-319-67816-0_17

Nakamoto, S. (2008). Bitcoin: A Peer-to-Peer Electronic Cash System. https://bitcoin.org/bitcoin.pdf

Saad, S. M. S., Radzi, R. Z. R. M., & Othman, S. H. (2021). Comparative analysis of the blockchain consensus algorithm between Proof of Stake and Delegated Proof of Stake. Proceedings of the 2021 International Conference on Data Science and Its Applications (ICoDSA), 175–180. https://doi.org/10.1109/ICoDSA53588.2021.9617549

Saia, J., & Young, M. (2017). Proof of Work Without All the Work. arXiv. https://arxiv.org/abs/1708.01285

Saputra, W. I., & Poetro, B. S. W. (2025). Prediksi konsumsi energi menggunakan regresi linier dan multilayer perceptron pada algoritma konsensus Proof of Work (PoW). Jurnal Rekayasa Sistem Informasi dan Teknologi, 3(1), 183–197.

Shen, Z., Qu, Q., & Chen, X. B. (2025). Blockchain consensus mechanisms: A comprehensive review and performance analysis framework. Electronics, 14(17), 3567. https://doi.org/10.3390/electronics14173567

Wikarsa, L., Suwanto, T., & Lengkey, C. (2022). Implementasi algoritma konsensus Proof-of-Work dalam blockchain terhadap rekam medis. Jurnal Pekommas, 7(1), 41–52. https://doi.org/10.56873/jpkm.v7i1.4403

Yulianti, I., Ardiansyah, R., Pusadan, M. Y., Amriana, & Lamasitudju, C. (2025). Evaluasi performa Proof of Work dan Proof of Stake melalui uji stres beban tinggi blockchain. Jurnal Algoritma, 22(2), 432–443.

Downloads

Published

11-07-2026

How to Cite

Zega, D. K. J., Halawa, L. S. P. J., Lase, S., & Hutabarat, M. P. (2026). A Comparative Analysis of the Efficiency of Blockchain Consensus Algorithms: Proof of Work, Proof of Stake, Delegated Proof of Stake, and Practical Byzantine Fault Tolerance. Pascal: Journal of Computer Science and Informatics, 3(02), 69-77. https://jurnal.devitara.or.id/index.php/komputer/article/view/398

Similar Articles

11-14 of 14

You may also start an advanced similarity search for this article.