Title: Streamlining classical consensus

Authors: Kyle Butt; Derek Sorensen

Addresses: Pyrofex Corporation, 4692 North 300 West, Suite 100, Provo, Utah 84604, USA ' Pyrofex Corporation, 4692 North 300 West, Suite 100, Provo, Utah 84604, USA

Abstract: Classical consensus protocols, generally based on rounds of voting, tend to be unscalable because of sheer message volume. Blockchain-style consensus has emerged to solve this problem, but there is still a gaping need for faster, more scalable, and reliably safe consensus protocols. We show that many classical consensus protocols give rise naturally to a directed acyclic graph (DAG), which we call the message DAG. We restructure two classical consensus protocols via the message DAG, consolidating message rounds with new messages, to achieve manifestly improved scalability. The second protocol lends itself to a scalable blockchain consensus protocol with strong safety and liveness guarantees. We also present a technique to generalise other message-based, classical consensus protocols.

Keywords: consensus protocol; directed acyclic graph; DAG; pre-Nakamoto consensus; classical consensus; Byzantine fault tolerant.

DOI: 10.1504/IJBC.2020.112508

International Journal of Blockchains and Cryptocurrencies, 2020 Vol.1 No.4, pp.313 - 328

Received: 14 Feb 2019
Accepted: 24 Nov 2019

Published online: 07 Jan 2021 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article