When considering the algorithm described in Fig. 19.1, is it possible to weaken the TMS assumption (used in its proof) as follows: there are are two distinct rounds r1 and r2 such that during round r1...

When considering the algorithm described in Fig. 19.1, is it possible to weaken the TMS assumption (used in its proof) as follows: there are are two distinct rounds r1 and r2 such that

during round r1 (resp. r2), all correct processes receive their first (n − t) messages from the

same set Q1 (resp. Q2) of (n − t) correct processes.