@article{Al-Humaimeedy2025, 
author = {Abeer S. Al-Humaimeedy},
title = {3RVAV: A Three-Round Voting and Proof-of-Stake Consensus Protocol with Provable Byzantine Fault Tolerance},
year = {2025},
journal = {Computers, Materials & Continua},
volume = {85},
number = {3},
pages = {5207-5236},
keywords = {Byzantine fault tolerant, proof-of-stake, verifiable random function, Sybil attack resistance, Nash equilibrium, committee voting},
url = {https://www.sciopen.com/article/10.32604/cmc.2025.068273},
doi = {10.32604/cmc.2025.068273},
abstract = {This paper presents 3RVAV (Three-Round Voting with Advanced Validation), a novel Byzantine Fault Tolerant consensus protocol combining Proof-of-Stake with a multi-phase voting mechanism. The protocol introduces three layers of randomized committee voting with distinct participant roles (Validators, Delegators, and Users), achieving  (45)-threshold approval per round through a verifiable random function (VRF)-based selection process. Our security analysis demonstrates 3RVAV provides  1−(1−sn)3k resistance to Sybil attacks with  n participants and stake  s, while maintaining  O(knlog⁡n) communication complexity. Experimental simulations show 3247 TPS throughput with 4-s finality, representing a 5.8× improvement over Algorand’s committee-based approach. The proposed protocol achieves approximately 4.2-s finality, demonstrating low latency while maintaining strong consistency and resilience. The protocol introduces a novel punishment matrix incorporating both stake slashing and probabilistic blacklisting, proving a Nash equilibrium for honest participation under rational actor assumptions.}
}