You may be interested in the following: Practical BFT: http://pmg.csail.mit.edu/papers/osdi99.pdf http://pmg.csail.mit.edu/papers/osdi99.pdf The Night Watch: h

You may be interested in the following: Practical BFT: http://pmg.csail.mit.edu/papers/osdi99.pdf http://pmg.csail.mit.edu/papers/osdi99.pdf The Night Watch: https://www.usenix.org/system/files/1311_05-08_mickens.pdf https://www.usenix.org/system/files/1311_05-08_mickens.pdf Generally the idea is to assume that there will be fewer than k failures out of the n nodes you have.