You don't have permission to do that.
Hashgraph vs Practical Byzantine Fault Tolerance (PBFT)
I have read the Hashgraph whitepaper and it got me wondering how Hashgraph compares to the Practical Byzantine Fault Tolerance (PBFT) algorithm. Do these two compete for the same use cases? What are Hashgraph's advantages and disadvantages with respect to fault tolerance and performance? Which one is more scalable in terms of number of transactions and nodes?