Byzantine
Before we get to know synchronization, let's take a look at the Byzantine algorithms that are crucial to synchronization.
The Byzantine Generals Problem is a distributed peer-to-peer network communication fault-tolerant problem proposed by Leslie Lambert and others in their paper 《The Byzantine Generals or equal to f, the loyal generals can achieve consistent commands, that is, the number of traitors is less than half of the number of loyal generals.
The algorithm complexity is O (n ^ (f+1)).The fault-tolerant algorithm for the Byzantine general problem solves the problem of consistency when the network communication is reliable but the node may fail.Therefore, this algorithm can hardly be applied in actual distributed systems.
Byzantine fault-tolerant algorithm is a system attribute that can resist a series of faults caused by the Byzantine General problem. In other words, the Byzantine fault-tolerant system can continue to operate even if some nodes fail to communicate or have malicious behavior.There are many ways to create a Byzantine fault-tolerant blockchain, which relates to different types of consensus algorithms.
The Application of Byzantine
In transformers chain, according to the set time interval of one round and the callback calculation of the height synchronized from other nodes, the overall network height (the height with the highest proportion) is compared with its own height.
If it is lower than the height of the whole network, synchronization will start. First, multiple staked nodes are obtained, and then their node block header hashes are retrieved. After verification,the actual block data is requested, and a randomly selected block is added to its own chain. When the difference in height is below a certain level, the block needs to be verified.
That's all for now, stay tunned
Join us:
OS: https://www.tfsc.io/
X (Twitter): https://twitter.com/TFSCChain
Discord: https://discord.com/invite/transfomerschain
Telegram: https://t.me/transformerschain
