pub fn quorum_verifies(n: u32) -> u32
Peers’ shares a replica of n must verify for a quorum: 2f with uBFT’s f = (n − 1) / 2 (ubft_machines.cpp waits for 2f + 1 shares, its own included).
n
2f
f = (n − 1) / 2
ubft_machines.cpp
2f + 1