5/10/2023 0 Comments This One Problem by M.C. Pease![]() ![]() However, digital signatures, as used here, are a metaphor. ![]() It was my work on digital signatures (see ) that led me to think in that direction. My contribution to the work in this paper was the solution using digital signatures, which is based on the algorithm in. The 4-processor solution presented in this paper and the general impossibility result were obtained by Shostak Pease invented the 3n+1-processor solution. (I don’t know if that was earlier than or concurrent with its discovery at SRI.) However, the people at SRI had a much simpler and more elegant statement of the problem than was present in. I had already discovered the problem of Byzantine faults and written. The problem was formulated by people working on SIFT (see ) before I arrived at SRI. I am often unfairly credited with inventing the Byzantine agreement problem. I think it also contains the first precise statement of the consensus problem. This paper introduced the problem of handling Byzantine faults. However, if digital signatures are used, 2n+1 processors are enough. ) In general, 3n+1 processors are needed to tolerate n faults. ![]() ![]() This paper shows that “Byzantine” faults, in which a faulty processor sends inconsistent information to the other processors, can defeat any traditional three-processor algorithm. Before this paper, it was generally assumed that a three-processor system could tolerate one faulty processor. ![]()
0 Comments
Leave a Reply. |