Abstract: In view of the risk of votes splitted among different candidate nodes in the traditional Raft consensus algorithm of the consortium blockchain, none of the nodes has more than half of the votes in the election, which leads to election failure, this paper proposes authorize election-raft (AE-Raft). Half of the nodes in the consortium blockchain were set as authorized nodes. Candidate nodes were selected by using the heartbeat mechanism in authorized nodes that had reached the timeout period, while the remaining nodes remain as they were. A leader was chosen in the candidate nodes that received more than half of the votes. In the experiment, Golang language was used to program and implement the AE-Raft algorithm. The results show that the AE-Raft algorithm is better than the traditional Raft algorithm in terms of stability and time efficiency. The p value of the statistical T-test is less than 0.05, and the performance of the AE-Raft is significant. The algorithm