Timeline for Is PBFT a consensus algorithm?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 3, 2021 at 12:12 | comment | added | Questioner | PBFT, in practice, scales for how many nodes? (Compared to Paxos and Raft. For example, HERE it's mentioned that Paxos does not scale for more than a dozen nodes. How about PBFT? ) Thanks. | |
| Sep 20, 2018 at 18:41 | comment | added | Dan Anderson | Yes, in Big O notation O(n^2) is the same as (n * (n - 1)). In other words, it is exponential to the power of 2. The "- 1" makes little difference in the end. | |
| Sep 20, 2018 at 15:24 | comment | added | Questioner |
Thankk you, so it's n(n_1) messages, however, in your answer you have mentioned n power 2 (n^2), that's right? Thanks
|
|
| Sep 20, 2018 at 15:16 | comment | added | Dan Anderson | It is a number of messages complexity, because every node must send messages to every other node. With 2 nodes, there are two messages, 3 nodes has 6 messages, 4 nodes have 12 messages, 5 nodes has 20 messages, 6 nodes has 30 messages, n nodes has n(n-1) messages. | |
| Sep 20, 2018 at 9:07 | comment | added | Questioner |
What do you mean by n^2 messages ? Is it time complexity? and "message" means "transactions" ? Thanks
|
|
| Sep 19, 2018 at 14:50 | history | answered | Dan Anderson | CC BY-SA 4.0 |