Any system of agreement in a distributed computer network must be error-tolerant: it must produce consistent results despite errors such as slow communication connections, non-responsive nodes and poorly ordered messages. A Byzantine arrangement system is also tolerant of “Byzantine” errors: knots that give false information, whether because of an error or in a deliberate attempt to undermine the system or gain an advantage.1 Consider the owner of a crypto coin who must decide whether he buys a delicious Gelato from Bob or if he pays Carol to pay a debt. Alice could have it both ways by fraudulently paying Bob and Carol the same coin. To do so, she must convince Bob`s computer that the play was never paid to Carol, and she must convince Carol`s computer that the play was never paid to Bob. A Byzantine unification system can make this virtually impossible with a form of majority rule called quorum. A knot in such a network refuses to fix on a specific version of the story until it sees that there are enough of its peers – a quorum – ready to engage. Once that happens, they created a voting block large enough to force the remaining nodes in the network to accept their decision. Alice might be able to leave a few knots in her name, but if the network is big enough, her attempt will be overwhelmed by the voices of honest knots. Although there are many federal votes on statements on many different ballots, far fewer actual journalist messages are exchanged, each containing a number of ballots. A single message advances the state of many federal voices at once, for example.B. “I accept that the ballots be up to .” The values on which SCP seeks consensus may be Stellar Ledger or noon orders or whatever, but it is important to note that these are not the values on which CPS voting rounds vote or accept or confirm.
Instead, there is a federal vote on the declarations on these values. A ballot is a couple: , the counter being an entire number from 1 and the value is a candidate from the nomination phase. It may be the node candidate or the peer candidate that the knot accepts. Basically, the vote makes repeated attempts to get the network to get a consensus on a candidate in certain votes, with potentially many federated votes on the explanations of vote. Counters in ballots follow attempts made and ballots with higher counters have priority over ballots with lower counters. If the election seems to be blocked, a new vote begins, which is now on the ballot paper . The Stellar Consensus Protocol uses unifying votes in a way that guarantees safety and vitality.4 The idea is to cast several unifying votes on several values until you manage to get through the various voting phases of the CPS, as described below. Similar problems often arise in distributed computer networks.
All participants or nodes must agree on a decision, for example. B on the task of updating a shared file or recovering a task from a queue. In a network of cryptocurrencies, nodes must always decide the complete evolution of the freed ledger, from several possible versions that are sometimes in conflict.