Probabilistic BFT Achieves Optimal Latency with Sub-Quadratic Message Complexity
By relaxing to a probabilistic security model, ProBFT delivers optimal three-step latency and $O(nsqrt{n})$ message complexity, enabling practical BFT scalability.
