Streamlining classical consensus
by Kyle Butt; Derek Sorensen
International Journal of Blockchains and Cryptocurrencies (IJBC), Vol. 1, No. 4, 2020

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.

Online publication date: Tue, 19-Jan-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Blockchains and Cryptocurrencies (IJBC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com