-- Practice Midterm Mar 14 2022
Team: Michael Nguyen, Sneh Kothari
(Question 10)
For all 16 processors, we can compute the thresholds L = 11, H = 13, and G = 14. The faulty processors’ job is to foil all good processor thresholds so that they can never reach an agreement.
Suppose all 8 good processors vote yes. The 8 faulty processors can always do the opposite of the good processors and vote no. The point is that the good processors never reach a threshold and default to voting no. In the next round, the faulty processors can then vote yes against the good processors, where they will be stuck in a loop never reaching a threshold. The good processors will keep re-voting no and the faulty ones will keep re-voting yes.
(
Edited: 2022-03-14)
Team: Michael Nguyen, Sneh Kothari
(Question 10)
For all 16 processors, we can compute the thresholds L = 11, H = 13, and G = 14. The faulty processors’ job is to foil all good processor thresholds so that they can never reach an agreement.
Suppose all 8 good processors vote yes. The 8 faulty processors can always do the opposite of the good processors and vote no. The point is that the good processors never reach a threshold and default to voting no. In the next round, the faulty processors can then vote yes against the good processors, where they will be stuck in a loop never reaching a threshold. The good processors will keep re-voting no and the faulty ones will keep re-voting yes.