A Randomize Protocol for Consensus
n - total number of processes.
f - total number of faulty processes.
This algorithm solves a more complex problem
where the failure model is Byzantine, i.e. the
failed processes can send arbitrary messages
to arbitrary processes (may lie),