What is Byzantine Generals Problem

The Byzantine Generals Problem is a term used to describe a challenge faced by computer systems when one or more parts fail. These failures can lead to wrong information being sent within the system, affecting its performance. The name comes from a 1982 research paper that compared the issue to a historical military scenario.

Imagine several divisions of an army surrounding an enemy city. Each division has a general, and they can only communicate through messengers. The generals must agree on a plan that meets two requirements: 1) all trustworthy generals follow the same plan, and 2) a few bad actors can't make the good ones follow a harmful plan.

The main challenge is for the generals to share information securely and reach an agreement. If they can't agree, their attack might fail. It's also a problem if a deceitful general purposely gives false information, leading others into danger.

In a distributed computer network like a blockchain, each participant (node) is like a general. For the system to work properly, most nodes must agree on and follow the same instructions. If some nodes fail or become malicious, it's called a Byzantine fault. A system that can still work well despite these faults is said to have Byzantine fault tolerance (BFT).

Bitcoin solves this problem using a method called proof-of-work. When each "general" (node) decides on a plan, they have their computer work on a challenging problem. It's expected to take 10 minutes for one of them to find a solution. When a solution is found, that node shares it with the others, along with their plan. Everyone else then follows this new plan.

By checking the proof-of-work chain, every node can see how much computing power was used and that most of the computers agreed on the plan. So, they can trust and follow the plan with the longest proof-of-work chain, knowing that the majority supported it.