Let us. consider a set of processes, of size at least 3f +1, executing WTS algorithm. Every correct proposer decides in at most 2f + 5 message delays.
Appears in 3 contracts
Sources: Byzantine Generalized Lattice Agreement, Byzantine Generalized Lattice Agreement, Byzantine Generalized Lattice Agreement