0
$\begingroup$

To get Byzantine Fault Tolerance in a synchronous model you can use an Oral Message Algorithm. For n > 3f+1 it gets an Byzantine agreement in f+1 rounds. Why f+1?

$\endgroup$
0
$\begingroup$

I will use $m$, not $f$ according the original paper. It gets an Byzantine agreement in $m+1$ rounds.

The paper the byzantine generals problem says:

THEOREM 1. For any m, Algorithm OM (m ) satisfies conditions IC1 and IC2
if there are more than 3m generals and at most m traitors.

Since it is a recursive algorithm, from $OM(0)$ to $OM(m)$, so it is $m+1$ rounds.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.