Fault Thresholds & Quorums
0 questions
The arithmetic behind every BFT protocol: 3f+1 replicas to survive f Byzantine ones, quorums of 2f+1 so that any two quorums share an honest node. Interviewers want that intersection argument, because it is what stops two conflicting values both being committed.
questions
no questions here yet
this part of the tree is still being written
>
0 questions in this topic or below it