Byzantine Generals’ Problem
By CoinGecko | Updated on Mar 03, 2020
A term used to describe the situation a single strategy which requires consensus from all members within a group who cannot be trusted or verified. An example of the Byzantine general problem can be found as follows:
Imagine a city besieged and surrounded by the Byzantine army led by 5 different generals. All 5 generals surrounding the city have to formulate an attack plan and in its simplest form, it is merely between attacking and retreating. The generals are far apart from one another, and the only means of communication is via messengers (who may be spies, or be killed/replaced by enemy messengers). To further complicate matters, some generals may be malicious and can tamper with the votes.
Suppose the generals now cast votes to decide whether to attack or retreat and thus also informing the rest of their decision at the same time. This however presents a problem – if any of the generals are malicious/messenger gets replaced, some generals may be tricked into attacking. So, how can the Byzantine Generals ensure that their votes cannot be tampered with?
This problem is analogous to that of a decentralized peer-to-peer system – the challenge is to ensure that all nodes (generals) are looking at information (votes) that are valid and not tampered with.
Related Terms
HODL
A crypto slang of saying holding the assets rather than selling it.
A crypto slang encouraging investors to hold on to their assets rather than selling it.
Unspent Transaction Output
(abbv. "UTXO") Coins that are unspent in the wallet. UTXO virtually represents the cryptocurrency one own in the wallet.
Leverage
It is an investment strategy to gain potential return of the investment by borrowing the money
Hybrid PoW/PoS
It is the allowance for both Proof-of-Stake and Proof-of-Work distribution consensus to work on the same network.
Hungry for more knowledge?
Back to Glossary or Subscribe to our newsletter.