First: The Byzantine Generals Problem, the capital of the ancient Eastern Roman Empire, was at war with the enemy in 1982(Istanbul, Turkey today). <br>There were ten armies, and each army general had to decide to attack or withdraw at the time of the war.<br>This decision determined that change stoking would not be possible and that a decision message would be conveyed to other armies, but the vastness of the Roman Empire had led to difficult messaging of scattered armies.<br>In 1982, Leslie Lamport, an American computer scientist, used mathematical algorithms to develop a system of error tolerance distributions when the army was no more than a third of the traitors.<br>This algorithm mechanism is effective, but when the army traitor sits more than 1/3, it causes the information to mix and fail to reach a consensus, and the algorithm mechanism fails.
đang được dịch, vui lòng đợi..