Algorithm Search⌘K

Theoremadvanced

Byzantine round lower bound

Also called t+1 round lower bound, Dolev-Strong lower bound.

Synchronous Byzantine agreement with t faults needs at least t+1 rounds.

Synchronous Byzantine agreement with t faults needs at least t+1 rounds.

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
  • Statement
  • one source with a locator