The question of Byzantine generals is a matter of agreement, and the generals of the Byzantine empire must decide unanimously whether to attack an enemy.The problem is that these generals are geographically separate and there are traitors among them.Traitors can act freely to achieve the following goals: to deceive certain generals into taking offensive actions;Facilitating a decision that not all generals agree on, such as facilitating an attack when the generals do not want it;Or confuse some generals so they can't make a decision.If a traitor achieves one of these ends, the outcome of any attack is doomed to failure, and only a concerted effort can achieve victory.
The Byzantine hypothesis is a model of the real world, where computers and networks can behave unpredictably due to hardware errors, network congestion or disconnection, and malicious attacks.The Byzantine fault-tolerant protocols must deal with these failures, and they must also meet the specifications of the problem to be solved.These algorithms are usually characterized by their elastic t, which represents the number of error processes that the algorithm can handle.
Many classic algorithm problems have solutions only when n is greater than or equal to 3t+1, such as the Byzantine general problem, where n is the total number of processes in the system.[1]
