Interactive PBFT — four nodes with one primary and three backups, tolerating one Byzantine (lying) node. Pre-Prepare, Prepare, Commit, Reply, plus view change when the primary misbehaves.

n = 4 · f = 1 · quorum = 2f+1 = 3 primary prepared committed byzantine
n=4 tolerates f=1 liar quorum 2f+1 = 3 client waits f+1 = 2 matching replies
view
0
1 · Request
2 · Pre-Prepare
3 · Prepare
4 · Commit
5 · Reply
Matching messages
0 / 4
Step 0 / 0

Ready. N0 is primary, N1–N3 are backups. Press Next to send a client request.

Scenario timeline—
←→space
phase
—
view
0
prepared
0 / 4
committed
0 / 4
Message loglast 2 messages