Table 1 Performance of algorithms in terms of number of rounds
From: Timing analysis of leader-based and decentralized Byzantine consensus algorithms
| Best case | Worst case | |
|---|---|---|
| MA-D | t+2 | t+2 |
| MA-L | 4 | 4(t+1) |
| CL-D | t+3 | t+3 |
| CL-L | 5 | 5(t+1) |
From: Timing analysis of leader-based and decentralized Byzantine consensus algorithms
| Best case | Worst case | |
|---|---|---|
| MA-D | t+2 | t+2 |
| MA-L | 4 | 4(t+1) |
| CL-D | t+3 | t+3 |
| CL-L | 5 | 5(t+1) |