The Byzantine Generals

That's the way how the Hashgraph find out which content is the correct one

• Explains at an example

Components in computer systems can be lying
What happens if a faulty component sends conflicting data to others?

The fall of Constantinople

Abstraction of the problem on the generals

• Each unit has its own general
• The generals can only communicate via messengers
• They must agree on a common plan
• There can be traitors

Guarantee of success

A: All loyal generals come to the same decision
B: A small number of traitors can Guarantee of success?

For a victory, the generals need an algorithm that guarantees

• Regardless of the behavior of the traitors
  loyal generals did not lead to a false
  bring divorce
• Procedure: everyone observes and communicates to others what he sees

Requirements

Each general can communicate directly with each other
Lieutenants follow a standard command if they receive no (valid)

Majority of members must act honestly= m

• Solution the Byzantine General problem for 3members + 1General or more generals with maximum m traitors.
• Gilt für alle nichtnegativen m.
• Be given a function majority that implements the majority vote

Algorithm

(1) Commander sends his command to each lieutenant

(2) Each lieutenant notes the command he has received, and then acts as commander himself by applying his command to all other lieutenants

(3) Each lieutenant notes all the orders he has received and then uses the majority