-Show a scenario that does not work with only f rounds.
-Prove that the previous algorithm is correct.
- No process decides before the f+1 round.
- The values of the local vectors are identical at all the processes that make it to the f+1 round ( why?) .
- Suppose that n=5, and at most one process may crash or lie (say whatever it wants, and maybe different things to different members). Construct the simplest algorithm that solves the consensus problem in this case.
Validity in this case: If a correct process decides on a value, there was a correct process that started with that value.
Submission: Wednesday , October 4 at the beginning of the lecture.