PBFT Normal-Case Protocol
Castro and Liskov's practical BFT: a primary assigns a sequence number in pre-prepare, replicas broadcast prepare and collect 2f+1 matching prepares to fix the order within the view, then broadcast commit and collect 2f+1 commits to make the decision survive view changes. Two all-to-all rounds give O(n²) message complexity per request.
This Concept is waiting for its first lesson!
Castro and Liskov's practical BFT: a primary assigns a sequence number in pre-prepare, replicas broadcast prepare and collect 2f+1 matching prepares to fix the order within the view, then broadcast commit and collect 2f+1 commits to make the decision survive view changes. Two all-to-all rounds give O(n²) message complexity per request.
Are you a teacher? Sign in to start contributing.
Sign In