DREP-PBFT: A Delegated Reputation and Efficiency Prioritized PBFT Consensus Algorithm

To address the scalability, security, and incentive shortcomings of the Practical Byzantine Fault Tolerance (PBFT) algorithm in consortium blockchain networks, this paper proposes DREP-PBFT, a hybrid consensus mechanism that integrates Delegated Proof of Stake (DPoS) principles with PBFT. The proposed method incorporates a Comprehensive Weighted Voting Election Strategy (CWVES) to elect a subset of high-reputation, high-performance nodes for consensus participation, thereby reducing communication complexity from O( N ² ) to O( M ² ) and improving system efficiency. Additionally, a dual-layer reputation-based incentive and penalty mechanism is introduced to enhance node activeness and network trustworthiness, dynamically updating nodes' status based on online time, consensus efficiency, and behavioral history. Furthermore, a Verifiable Random Function (VRF)-driven leader election strategy is implemented to ensure randomness and unpredictability in primary node selection, enhancing security against targeted attacks. Experimental results demonstrate that DREP-PBFT outperforms baseline PBFT, APBFT, and QTPBFT in terms of consensus latency, throughput, and resilience to malicious behavior. The proposed approach offers a robust and scalable consensus framework for high-reliability blockchain applications.