Vernacular explanation, the question of General Byzantium

This article introduces the relevant knowledge of "vernacular explanation, Byzantine General problem". In the operation of actual cases, many people will encounter such a dilemma. Next, let the editor lead you to learn how to deal with these situations. I hope you can read it carefully and be able to achieve something!

As a server developer, you may have heard of distributed consistency algorithms such as Paxos and Raft, and used ZooKeeper, etcd and other tools to solve consistency problems at work. But you may not know that these algorithms and tools do not solve the most difficult problem of consistency, which can be traced back to Leslie Lamport's famous 1982 paper, the Byzantine General problem (The Byzantine Generals Problem).

To sum up, we can draw a conclusion: when there is a traitor among the three generals of Byzantium, and the traitor can falsify information at will, as long as the traitor is clear-headed, he can never be found. it can even cause a crisis of trust in the whole system.

According to this conclusion, a more general conclusion can be drawn: if there are m traitor generals, then when the total number of generals is less than or equal to 3m (n