Application Of Byzantine Fault-tolerant Algorithm With Active Recovery In Blockchain

Bitcoin brought us blockchain.With the popularity of Bitcoin around the world,its underlying technology,the blockchain technology has gained more and more attention from governments,businesses and initiative communities.The blockchain technology,with its de-centralization,irreversibility,distributed super book characteristics,has a broad application prospect in banking,logistics,management of energy etc.However,current blockchain technology faces challenge from high performance,security and availability.Based on Proof-of-Work,Bitcoin' TPS is merely 7,and the average confirming time per transaction is up to 12 minutes,which is very inefficient and energy consuming;The traditional distributed consistency algorithms like PAXOS,Raft do not consider the case of Byzantine fault;The PBFT algorithm considers the Byzantine fault-tolerant problem,but its complex view change process make blockchain systems vulnerable.Based on study of the above consensus algorithm,this thesis presents a proactive recovery mechanism,and applies it to PBFT,and improves the PBFT to be robust which is suitable for blockchain systems.Compared to PBFT,the proposed Robust Byzantine Fault Tolerant(RBFT)algorithm has the following advantages:1)Security,provides transaction information security in consortium blockchain.2)Failure detection,quickly finds out lacking-data nodes.3)Block data recovery,provides specific and resource-saving data recovery of nodes and consensus information recovery,helps nodes involve in consensus seamlessly..Finally,we test the blockchain system based on RBFT.The experimental results show that the new algorithm has more robustness when node failure happens,which also improves the overall throughput and efficiency.