Byzantine Fault Tolerance

  • Relevant to distributed computing and blockchain
  • Two generals problem: loyal and traitor generals each command an army
  • The only communications they have are through messages that have latency and failure
  • Two choices: Attack or stay put
  • How do you create an algorithm, such that loyal generals follow it, while traitors do not, such that the imperfect group can complete the mission?
  • Strong majority (2/3) of honest generals needed
  • The analogous algorithm in blockchain: Proof of work

Like this post? Subscribe for more.

Kevin Chow
Kevin Chow
Fledging Computer Scientist