Common use of Algorithm Clause in Contracts

Algorithm. We now describe an algorithm that solves Byzantine agree- ment in the basic partially synchronous model when ℓ > n+3t . Our algorithm is based on the algorithm given by Xxxxx, Xxxxx and Xxxxxxxxxx [9] for the classical case where n = ℓ, with several novel features. Generalizing the algo- rithm is not straightforward. Some of the difficulty stems from the following scenario. Suppose two correct processes share an identifier and follow the traditional algorithm of [9]. They could send very different messages (for example, if they have different input values), but recipients of those messages would have no way of telling apart the messages of the two correct senders, so it could appear to the recipients as if a single Byzantine process was sending out contradictory information. Thus, the algorithm has to guard against in- consistent information coming from correct homonym pro- cesses as well as malicious messages sent by the Byzantine processes.