42 Lamport - Shostak - Pease Algorithm (cont'd) The algorithm has O(n m ) message complexity, with m + 1 rounds of message exchange, where n  (3m + 1) –See the examples on page 186 - 187 in the book, where, with 4 nodes, m can only be 1 and the OM(1) and OM(0) rounds must be exchanged –The algorithm meets the Byzantine conditions: A single value is agreed upon by healthy processors That single value is the initiators value if the initiator is non-faulty
{}