We can rewrite condition I as the condition that for every i (whether or not the ith general is loyal): 1'.Any two loyal generals use the same value of v(i)
We can rewrite condition I as the condition that for every i (whether or not the ith general is loyal): • 1'. Any two loyal generals use the same value of v(i)
Byzantine Generals Problem. A commanding general must send an order to his n-1 lieutenant generals such that IC1.All loyal lieutenants obey the same order. IC2.If the commanding general is loyal, then every loyal lieutenant obeys the order he sends
• Byzantine Generals Problem. A commanding general must send an order to his n - 1 lieutenant generals such that • IC1. All loyal lieutenants obey the same order. • IC2. If the commanding general is loyal, then every loyal lieutenant obeys the order he sends
n processes,m faulty n<=3m,impossibility n>3m m+1 rounds/intuition perceptual knowledge/examples algorithms proofs
n processes, m faulty n<=3m, impossibility n>3m m+1 rounds/intuition perceptual knowledge/examples algorithms proofs