Paper 2018/1153 Original: eprint.iacr.org/2018/1153 ↗
Dfinity Consensus, Explored
Abstract
We explore a Byzantine Consensus protocol called Dfinity Consensus, recently published in a technical report. Dfinity Consensus solves synchronous state machine replication among $n = 2f + 1$ replicas with up to $f$ Byzantine faults. We provide a succinct explanation of the core mechanism of Dfinity Consensus to the best of our understanding. We prove the safety and liveness of the protocol specification we provide. Our complexity analysis of the protocol reveals the follows. The protocol achieves expected $O(f \times \Delta)$ latency against an adaptive adversary, (where \Delta is the synchronous bound on message delay), and expected $O(\Delta)$ latency against a mildly adaptive adversary. In either case, the communication complexity is unbounded. We then explain how the protocol can be modified to reduce the communication complexity to $O(n^3)$ in the former case, and to $O(n^2)$ in the latter.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2018-12-03: last updated
- 2018-12-03: published
- Short URL
- https://ia.cr/2018/1153
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2018/1153,
author = {Ittai Abraham and Dahlia Malkhi and Kartik Nayak and Ling Ren},
title = {Dfinity Consensus, Explored},
howpublished = {Cryptology {ePrint} Archive, Paper 2018/1153},
year = {2018},
url = {https://eprint.iacr.org/2018/1153}
}