Algorithm Search⌘K

Algorithmadvanced

PBFT

Also called Practical Byzantine Fault Tolerance, Castro-Liskov.

Practical BFT replication protocol with three-phase agreement and view changes, tolerating f faults with 3f+1 replicas.

Practical BFT replication protocol with three-phase agreement and view changes, tolerating f faults with 3f+1 replicas.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • the section The problem
  • pseudocode in The algorithm
  • complexity claims in the front matter
  • one source with a locator