Byzantine fault

Can a group make a unanimous decision when not everyone agrees?

Image: photo taken by: de:User:Stahlkocher, CC BY-SA 3.0, via Wikimedia Commons

Byzantine fault

Can a group make a unanimous decision when not everyone agrees?

Imagine you're planning a surprise birthday party, but not everyone knows the guest of honor's favorite cake flavor.

You need a way to make sure the party is a hit even if some friends forget the cake preference. Byzantine fault tolerance (BFT) helps a network agree on one thing despite some nodes being unreliable or acting maliciously.

Example

If 3 out of 5 friends can't agree on the cake flavor, BFT ensures the party still goes ahead with a chosen flavor.

Remember this

BFT ensures consensus in a network even when some nodes fail or act maliciously.

Related concepts

Educational content, not financial advice.

Swipe through 100 ML concepts daily

Open Pocket Polymath