New answers tagged

0

There are two questions here. Let me start with the second: "I don't understand why the proof of the consensus impossibility doesn't work in this case?". First, I do not know what proof you are talking about. I suppose you are referring to a proof that consensus is not solvable in a t-resilient SWMR system when $0<t<N$. If $t<N-1$, the easiest ...


0

The authors' goal is to rule out protocols that work for every possible input. Hence, in their proof by contradiction, they can assume that the protocol works correctly on every input. The specification of an algorithm should include all constraints on the possible inputs. For example, binary search assumes that the input array is sorted. The specification ...


Top 50 recent answers are included