文档介绍：: .
小型微型计算
法可以有效解决区块链的安全性、扩展性、能耗代价和性能效率等问题。本文选取 Raft 共识算法作为研究
对象，针对 Raft 算法领导者选举中由于投票分裂而造成选举延时问题，提出了一种基于 PoW 的高效率共
识算法-- RPFT 共识算法。该算法首先利用 PoW 共识算法成功选取出高效率的副领导者节点；其次为每一
个节点赋予一个等待时间，并根据节点行为调整等待时间；最后，引入等待时间选举模型，结合 PoW 共识
算法优化 Raft 算法投票选举,快速选举出高效的领导者节点。实验结果表明，新提出的 RPFT 算法对比 Raft
算法在选举速度上提高了 75%左右；在共识效率方面，RPFT 算法共识效率提高了 40%。
关键字：Raft；投票分裂；PoW；RPFT；等待时间选举模型
中图分类号：TP302 文献标识码：A
RPFT: An Efficient Consensus Algorithm Based on PoW
QIAN Hui1，ZHENG Zhao-hui1,2，RONG Bao-jun1，WANG Jian-xiang1
1（School of Computer Science & Technology, Soochow University,Suzhou 215006,China）
2（Jiangsu Cyberspace Security Engineering Laboratory, Soochow University,Suzhou 215006,China）
Abstract:With the development of blockchain technology, consensus algorithm, as its core technology, has also
become a research hotspot of many scholars. A good consensus algorithm can effectively solve the problems of
blockchain, such as security, scalability, energy cost and performance paper selects Raft consensus
algorithm as the research object. Aiming at the election delay caused by split voting in Raft algorithm leader
election, an efficient consensus algorithm based on PoW - RPFT consensus algorithm is , the PoW
consensus algorithm is used to successfully select the efficient deputy leade