Two Generals Problem is related to Byzantine’s General Problem, but yet it’s not the same. Byzantine’s General Problem is a generalized version of Two Generals Problem, and often discussed within the context of distributed systems, fault tolerance, and blockchain.
Two Generals
Two generals are positioned on the opposite side of each other and between them is a castle. They need to successfully communicate with each other to plan a synchronized attack, as this is their only chance to win.
Through the distance and one-directional messaging it is next to impossible to achieve consensus, as each message communicates in return would be expected to be confirmed by the opposite general. This creates an untrusted communication channel and an inconsistent state between the two generals.
The solution to the unsolvable problem relies upon realizing and accepting that some messages will be missed and creating a mitigating solution in those events where it does happen. In return, this will produce variations of trust and achieve a consensus between the two generals.
Variation of those acceptance and mitigation protocols would be consisting anything in between conformation of received messages to creating a time buffer between communication channels.
Follow us on Instagram ► https://instagram.com/protocolvalue
Follow us on Twitter ► https://twitter.com/protocolvalue