Asynchronous Byzantine Agreement. Algorithm 11.21 Asynchronous Byzantine Agreement (Ben-Or, for f < n/10) ∈ { } 1: xu 0, 1 a input bit 2: r = 1 a round 3: decided = false 4: Broadcast propose(xx,x) 5: repeat −
Appears in 1 contract
Samples: Byzantine Agreement
Asynchronous Byzantine Agreement. Algorithm 11.21 3.21 Asynchronous Byzantine Agreement (Ben-Or, for f < n/10n/9) ∈ { } 1: xu xi 0, 1 a input bit 2: r = 1 a round 3: decided = false 4: Broadcast propose(xxpropose(xi,xr) 5: repeat −repeat
Appears in 1 contract
Samples: Byzantine Agreement
Asynchronous Byzantine Agreement. Algorithm 11.21 17.21 Asynchronous Byzantine Agreement (Ben-Or, for f < n/10n/9) ∈ { } 1: xu xi 0, 1 a input bit 2: r = 1 a round 3: decided = false 4: Broadcast propose(xxpropose(xi,xr) 5: repeat −repeat
Appears in 1 contract
Samples: Byzantine Agreement
Asynchronous Byzantine Agreement. Algorithm 11.21 3.21 Asynchronous Byzantine Agreement (Ben-Or, for f < n/10) ∈ { } 1: xu xi 0, 1 a input bit 2: r = 1 a round 3: decided = false 4: Broadcast propose(xxpropose(xi,xr) 5: repeat −
Appears in 1 contract
Samples: Byzantine Agreement