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 lay...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(4/5)-threshold approval per round through a verifiable random function(VRF)-based selection process.Our security analysis demonstrates 3RVAV provides 1−(1−s/n)^(3k) resistance to Sybil attacks with n participants and stake s,while maintaining O(kn log 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.展开更多
This paper introduces a new Byzantine fault tolerance protocol called workload-based randomization Byzantine fault tolerance protocol(WRBFT).Improvements are made to the Practical Byzantine Fault Tolerance(PBFT),which...This paper introduces a new Byzantine fault tolerance protocol called workload-based randomization Byzantine fault tolerance protocol(WRBFT).Improvements are made to the Practical Byzantine Fault Tolerance(PBFT),which has an important position in the Byzantine Fault consensus algorithm.Although PBFT has numerous ad-vantages,its primary node selection mechanism is overly fixed,the communication overhead of the consensus process is also high,and nodes cannot join and exit dynamically.To solve these problems,the WRBFT proposed in this paper combines node consensus workload and verifiable random function(VRF)to randomly select the more reliable primary node that dominates the consensus.The selection of the nodes involved in the consensus is based on the node workload,and the optimization of the agreement protocol of the PBFT is also based on this.Simulation results show that the WRBFT has higher throughput,lower consensus latency,and higher algorithmic efficiency compared to the PBFT.展开更多
文摘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(4/5)-threshold approval per round through a verifiable random function(VRF)-based selection process.Our security analysis demonstrates 3RVAV provides 1−(1−s/n)^(3k) resistance to Sybil attacks with n participants and stake s,while maintaining O(kn log 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.
基金supported by the National Natural Science Foundation of China(No.61962005)National Key Research and Development Program of China(No.2018YFB1404404).
文摘This paper introduces a new Byzantine fault tolerance protocol called workload-based randomization Byzantine fault tolerance protocol(WRBFT).Improvements are made to the Practical Byzantine Fault Tolerance(PBFT),which has an important position in the Byzantine Fault consensus algorithm.Although PBFT has numerous ad-vantages,its primary node selection mechanism is overly fixed,the communication overhead of the consensus process is also high,and nodes cannot join and exit dynamically.To solve these problems,the WRBFT proposed in this paper combines node consensus workload and verifiable random function(VRF)to randomly select the more reliable primary node that dominates the consensus.The selection of the nodes involved in the consensus is based on the node workload,and the optimization of the agreement protocol of the PBFT is also based on this.Simulation results show that the WRBFT has higher throughput,lower consensus latency,and higher algorithmic efficiency compared to the PBFT.
