pub fn quorum(n: u32) -> Option<u32>
Assuming that n = 3f + 1, compute the minimum size of q such that q >= 2f + 1.
n = 3f + 1
q
q >= 2f + 1
If the value of n is too small to tolerate any faults, this function returns None.
n
None