PermitBFT: Exploring the Byzantine Fast-Path
Abstract
PermitBFT establishes a permissioned byzantine ledger in the partially synchronous networking model. For n replicas, PermitBFT tolerates up to f < n/3 byzantine replicas. It is the first BFT protocol to achieve a latency of just 2 message delays despite tolerating byzantine replicas throughout the “fast track”, as long as they are not the leader. The design of PermitBFT relies on two fundamental concepts. First, in PermitBFT the participating nodes do not wait for a distinguished leader to act and subsequently confirm its actions, but send permits to the next leader proactively. Second, PermitBFT achieves a separation of the decision powers that are usually concentrated on a single leader node. A leader in PermitBFT controls which transactions to include in a new block, but not where to append the block in the block graph.
People
BibTex
@article{permit-bft-abs/1906.10368,
author = {Roland Schmid and Roger Wattenhofer},
title = {PermitBFT: Exploring the Byzantine Fast-Path},
journal = {CoRR},
volume = {abs/1906.10368},
year = {2019},
url = {http://arxiv.org/abs/1906.10368},
archivePrefix = {arXiv},
eprint = {1906.10368}
}