Message Complexity. The Byzantine Reliable broadcast used at Line 9 costs (n2) messages [14], this cost dominates the other algorithm operations: in the 2f + 5 delays needed to reach the decision at most O(f · n) messages are generated. if Decided Accepted set state = proposing r = r 39: DECIDE(Accepted set) 40: Decided = Accepted set 41: state = newround 42: function SAFE(m)
Appears in 3 contracts
Sources: Byzantine Generalized Lattice Agreement, Byzantine Generalized Lattice Agreement, Byzantine Generalized Lattice Agreement