The Byzantine generals problem

The blockchain's distributed ledger is based on majority vote, the most-supported version of the ledger should win

Voting in a decentralized system is complex with bad actors

• Bad actors can lie about their votes and disrupt or distort communications

Example

Imagine a group of Byzantine armies planning to attack a city. If all the armies attack together, they will be victorious. However, if some armies choose not to attack or intentionally disrupt the plan, they will lose. The problem is how to ensure that all the armies agree on when to attack or retreat, despite the presence of potential traitors.

Similarly, in a blockchain network, consensus algorithms are used to determine the most supported version of the digital ledger. However, achieving consensus becomes complex when there are bad actors who may create fake accounts, lie about their votes, or disrupt communication. The Byzantine Generals Problem highlights the need for a solution that ensures everyone agrees on a course of action, even in the presence of bad actors.