pith. sign in

arxiv: 1902.08505 · v2 · pith:HMEFN2YBnew · submitted 2019-02-22 · 💻 cs.DC

Revisiting hBFT: Speculative Byzantine Fault Tolerance with Minimum Cost

classification 💻 cs.DC
keywords consensushbftreplicasboundbyzantineloweronlypaxos
0
0 comments X
read the original abstract

FaB Paxos[5] sets a lower bound of 5f + 1 replicas for any two-step consensus protocols tolerating f byzantine failures. Yet, hBFT[3] promises a two-step consensus protocol with only 3f + 1 replicas. As a result, it violates safety property of a consensus protocol. In this note, we review the lower bound set by FaB Paxos and present a simple execution scenario that produces a safety violation in hBFT. To demonstrate the scenario, we require a relatively simple setup with only 4 replicas and one view-change.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.