DM-PBFT:Double Layers and Multi Copies-Enabled Secure and Efficient Practical Byzantine Fault Tolerance Consensus Algorithm
简介：Practical byzantine fault tolerance(PBFT)can reduce energy consumption and achieve high throughput compared with the traditional PoW algo-rithm,which is more suitable for a strongly consistent consortium blockchain.However,due to the frequent communication among nodes,PBFT cannot realize scalability in large-scale networks.Existing PBFT-based algorithms still ignore performance and secu-rity.Therefore,we propose a secure and efficient prac-tical byzantine fault tolerance based on double layers and multi copies(DM-PBFT).We design a reputa-tion evaluation and node scheduling method for DM-PBFT.And then we propose an adaptive node schedul-ing strategy based on the derived threshold values after analyzing the system communication complexity and security.Combining the above research,a node dy-namic adjustment mechanism is proposed to freeze or adjust the node operation status according to the sys-tem environment.Simulation experiments show that the proposed mechanism can improve efficiency and increase the system's throughput.展开
学者：ChaiZeGaoZhipengYangLinYijingLIHuangqiRuiLanlan
关键词：blockchainconsensusPBFTreputation
在线出版日期：2026-03-17 （网站首发日期）
