If you're interested, here's some other interesting reading in this area: * Castro and Liskov, "Practical Byzantine Fault Tolerance", http://www.pmg.lcs.mit.ed

If you're interested, here's some other interesting reading in this area: * Castro and Liskov, "Practical Byzantine Fault Tolerance", http://www.pmg.lcs.mit.edu/papers/osdi99.pdf http://www.pmg.lcs.mit.edu/papers/osdi99.pdf As the title says, this paper describes a practical consensus algorithm that tolerates Byzantine failures. In some ways it is provably optimal. * Lamport, "Leaderless Byzantine Paxos", http://research.microsoft.com/en-us/um/people/lamport/pubs/disc-leaderless-web.pdf http://research.microsoft.com/en-us/um/people/lamport/pubs/d... Interesting follow-on from Castro and Liskov, removing the role of the leader. * Driscoll, "Murphy was an Optimist", http://www.rvs.uni-bielefeld.de/publications/DriscollMurphyv19.pdf http://www.rvs.uni-bielefeld.de/publications/DriscollMurphyv... These things really happen in practice. * van Renesse et al, "Byzantine Chain Replication", http://www.cs.cornell.edu/home/rvr/newpapers/opodis2012.pdf http://www.cs.cornell.edu/home/rvr/newpapers/opodis2012.pdf Very fast replication in a model that allows Byzantine failures.