Message Complexity. The asymptotical complexity of our algorithm is the same of WTS once the cost of the Byzantine Reliable Broadcast has been removed, that is O(f · n).
Appears in 3 contracts
Sources: Byzantine Generalized Lattice Agreement, Byzantine Generalized Lattice Agreement, Byzantine Generalized Lattice Agreement