Problem description(distributed consensus) Consider a set of n isolated processors,of which it is known t that no more than m are faulty.It is not known,however,which processors are faulty.Suppose that the processors can commumcate only by means of two-party messages.The communication medium is presumed to be fail-safe and of negligible delay.The sender of a message,moreover,is always identifiable by the receiver.Suppose also that each processor p has some private value of information Vp(such as its clock value or its reading of some sensor). The question is whether for given m,n>0,it is possible to devise an algorithm based on an exchange of messages that will allow each nonfaulty processor)to compute a vector of values with an element for each of the n processors,such thatProblem description(distributed consensus) Consider a set of n isolated processors, of which it is known that no more than m are faulty. It is not known, however, which processors are faulty. Suppose that the processors can commumcate only by means of two-party messages. The communication medium is presumed to be fail-safe and of negligible delay. The sender of a message, moreover, is always identifiable by the receiver. Suppose also that each processor p has some private value of information Vp (such as its clock value or its reading of some sensor). The question is whether for given m, n > 0, it is possible to devise an algorithm based on an exchange of messages that will allow each nonfaulty processor) to compute a vector of values with an element for each of the n processors, such that