Improved A-RAFT Consensus Algorithm Based on SHA256 Encryption Algorithm

The RAFT algorithm is one of the core technologies of blockchain. However, the strong leader strategy adopted by the RAFT algorithm can bring a fatal blow to the whole system when the leader node engages in malicious behavior, and its performance gradually decreases as the scale of the system continues to expand. In order to solve these problems, this paper adds a storage node to the original three nodes on the basis of the RAFT algorithm, reducing the choice of leader nodes, and the storage node is responsible for storing data, while other nodes only need to store data hashes, greatly improving the efficiency of the algorithm. And to solve the Byzantine problem of RAFT algorithm, a searchable encryption scheme based on SHA256 algorithm is used to ensure that when the leader node makes a mistake, the system can conduct a new leader node election in time, so that the A-RAFT algorithm can improve the efficiency of the system operation and ensure that the system can operate properly.