A challenging work in a distributed computing system is how to solve the Byzantine Generals’ problem and build a Byzantine Fault Tolerance system that namely has the ability to tolerate a class of Byzantine Faliures. Unfortunately, the Byzantine Generals’ Problem is a generalized version of the Two Generals’ Problem that has been proved to be unsolvable. However, if it is subjected to that at any time the number of Byzantine nodes or malicious nodes is less than 1/4 of the total compute computer, the Byzantine Generals’ Problem could be partly solved then, and the famous Paxos protocol in this case is expected to be a classical solution to this problem.A challenging work in a distributed computing syst