There are a number of solutions to the Byzantine Memorandum of Understanding. Unfortunately, the fundamental impossibility of [FLP85] shows that there is no deterministic algorithm to reach agreement in asynchronous setting even against benign errors. One solution to overcome this problem, first introduced by Rabin [Rab83] and Ben-Or [Ben83], is the application of randomization. Hadzilacos V, Halpern JY: Optimal new protocols for Byzantine agreements. (1990) The solution is to allow a two-round communication procedure. In the first round, each voter tells each voter after his election, and note different decisions. In the second round, they tell each other if their grades have reached a result: if not, they are perplexed and give up their choice or choose the default candidate (for example. B the candidate last year), if so, they remain confident and satisfied and keep their choice as the final result. That`s all! They speak only once in the first round of the long name and can finally agree on the restrictions and harassment of malicious voters. Feldman P, Micali S: Byzantine agreement in time to erer expected constantly (and do not trust anyone). Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science pp 267-276, 1985 This paper proposed a two-cycle mechanism and made a concise and concise demonstration to extend the value-added binary Byzantine agreement. The evidence inferred the accuracy of the mechanism, which requires minimal requirements and local configurations on the part of the participants.

The cost of extending a binary Byzantine arrangement algorithm to added value is too expensive if transmission costs are very high. The larger the value domain, the higher the cost. (Z.B. Emission value in range 0 to 3 doubles the cost of transmitting zone 0-1) Amdur, E.S., Weber, S.M. – Hadzilacos, V. On the complexity of the message of the binary Byzantine arrangement in case of crash error. Distrib Comput 5, 175-186 (1992). Pease M, Shostak R, Lamport L: an agreement in the presence of errors.

J ACM 27 (2):228-234 (1980) Coan B, Welch J: A Byzantine agreement protocol with optimal message bit complexity. Minutes from the 27th Allerton Conference on Communication. Control and Computer Science p. 1062-1071, 1989 The aim is to automate the analysis of the ABBA protocol with the methodology established in our old journal [KNS01a] on the basis of [MQS00]. In [KNS01a], we used Cadence SMV and probabilistic model tester PRISM to test the simpler randomised MOU for Aspnes and Herlihy [AH90] which only tolerates benign shutdown errors. We achieved this through a combination of mechanical inductive proofs (for all n for non-probabilistic properties) and tests (on finished configurations with probabilistic properties) and high-quality manual proof. However, the ABBA protocol presented us with a number of difficulties that were not encountered earlier: we are examining the randomized Byzantine mousino agreement ABBA (Asynchronous Binary Byzantine Agreement) of Cachin, Kursawe and Shoup [CKS00], which is placed in a totally asynchronous environment, allowing the maximum number of corrupted parts and using cryptography and randomization.