«

»

Pro
03

The problem of the two generals is the first computer communication problem that has not proven to be a solution. Three computer scientists, Lamport, Shostak and Pease, have developed an ordinal news algorithm (OM) to solve this problem. For everyone to reach a consensus, we must rely on the choice of the majority. The objective of the Byzantine margin of error is to protect against system component failures, with or without symptoms, preventing other components of the system from reaching an agreement if such an agreement is necessary for the system to function properly. The Byzantine margin of error can be reached if loyal (non-defective) generals have a majority agreement on their strategy. It is possible to indicate a default voting value for missing messages. For example, missing messages may . If the agreement is that the vots are in the majority, it is possible to use a standard pre.B strategy.[11] The proposal of a margin of error system for distributed systems is an important topic. – Previous protocols have required many message exchange cycles and are ineffective.

The concept of a reliable processor is proposed to reach an agreement, even if there are a large number of processors. Early agreement with the Settlement Protocol (EAC) requires only three rounds of message exchange; it is therefore possible to improve overall performance. Nakamoto Satoshi explained directly how Bitcoin uses PoW to solve the problem of Byzantine generals, in an email sent on November 14, 2008, you can check it out here. The Pease, Shostak and Lamport study was one of the first to consider the problem of implementing coordinated behavior between processors in a distributed system in the presence of failures [21]. Since the publication of the document, this topic has become a broad area of research. Below is a presentation of the key findings on the specific issues that will be addressed in their paper. In some cases, this entry uses the terminology currently accepted in this area and not the original terminology used by the authors. It seems that the problem can be solved simply by choosing a commander between two people, and it will be the one who will send the timetable of the attack to the other person, and that is it. But the problem is how (only by sending the message and the processing of the message received) the generals can know with certainty: “We have both agreed and we will attack at the same time. XX: YY day ZZ ” The Byzantine Margin of Error (BFT) is a system that solves the problem of the Byzantine problem of clearing. The problem of reaching a Byzantine consensus was conceived and formalized by Robert Shostak, who called it a problem of interactive coherence.

auto hájek

H&M INVEST s.r.o.

Hájek Martin
Dr. Steinera, Kladno 272 01


603 223 320

[contact-form-7 404 "Not Found"]