A Comparative Analysis of Proof-of-Authority Consensus Algorithms: Aura vs Clique

Md Mainul Islam; Mpyana Mwamba Merlec; Hoh Peter In

doi:10.1109/SCC55611.2022.00054

A Comparative Analysis of Proof-of-Authority Consensus Algorithms: Aura vs Clique

Md Mainul Islam
, Mpyana Mwamba Merlec
, Hoh Peter In

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

32 Citations (Scopus)

Abstract

Proof-of-authority (PoA) has become a popular consensus algorithm for permissioned blockchains, in which a group of trusted entities governs the networks. This algorithm provides fast consensus while requiring less computational resources and energy. Aura and Clique are two major implementations of PoA, which have their own set of advantages and disadvantages. In this paper, we evaluate the performance of both algorithms in terms of consistency, availability, partition tolerance, security, block time, and transaction throughput. The algorithms were implemented in Python, and experiments were conducted by connecting six consensus nodes having different computing power. The experimental results were comprehensively analyzed. It was observed that Clique provides higher availability and transaction throughput but lower security and consistency than Aura. The blockchains in the Aura network are immediately consistent while the blockchains stored by individual Clique authorities become eventually consistent. Permissioned blockchain practitioners will find this paper useful in choosing the most appropriate PoA implementation based on their requirements.

Original language	English
Title of host publication	Proceedings - 2022 IEEE International Conference on Services Computing, SCC 2022
Editors	Claudio Agostino Ardagna, Hongyi Bian, Carl K. Chang, Rong N. Chang, Ernesto Damiani, Schahram Dustdar, Jordi Marco, Munindar Singh, Ernest Teniente, Robert Ward, Zhongjie Wang, Fatos Xhafa, Jia Zhang
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	327-332
Number of pages	6
ISBN (Electronic)	9781665481465
DOIs	https://doi.org/10.1109/SCC55611.2022.00054
Publication status	Published - 2022
Event	2022 IEEE International Conference on Services Computing, SCC 2022 - Barcelona, Spain Duration: 2022 Jul 10 → 2022 Jul 16

Publication series

Name	Proceedings - 2022 IEEE International Conference on Services Computing, SCC 2022

Conference

Conference	2022 IEEE International Conference on Services Computing, SCC 2022
Country/Territory	Spain
City	Barcelona
Period	22/7/10 → 22/7/16

Bibliographical note

Publisher Copyright:
© 2022 IEEE.

Keywords

Aura consensus
Aura vs Clique
Blockchain
Clique consensus
consensus algorithm
proof-of-authority

ASJC Scopus subject areas

Information Systems and Management
Control and Optimization
Artificial Intelligence
Computer Networks and Communications
Computer Science Applications
Information Systems

Access to Document

10.1109/SCC55611.2022.00054

Cite this

Islam, M. M., Merlec, M. M., & In, H. P. (2022). A Comparative Analysis of Proof-of-Authority Consensus Algorithms: Aura vs Clique. In C. A. Ardagna, H. Bian, C. K. Chang, R. N. Chang, E. Damiani, S. Dustdar, J. Marco, M. Singh, E. Teniente, R. Ward, Z. Wang, F. Xhafa, & J. Zhang (Eds.), Proceedings - 2022 IEEE International Conference on Services Computing, SCC 2022 (pp. 327-332). (Proceedings - 2022 IEEE International Conference on Services Computing, SCC 2022). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SCC55611.2022.00054

A Comparative Analysis of Proof-of-Authority Consensus Algorithms: Aura vs Clique. / Islam, Md Mainul; Merlec, Mpyana Mwamba; In, Hoh Peter.
Proceedings - 2022 IEEE International Conference on Services Computing, SCC 2022. ed. / Claudio Agostino Ardagna; Hongyi Bian; Carl K. Chang; Rong N. Chang; Ernesto Damiani; Schahram Dustdar; Jordi Marco; Munindar Singh; Ernest Teniente; Robert Ward; Zhongjie Wang; Fatos Xhafa; Jia Zhang. Institute of Electrical and Electronics Engineers Inc., 2022. p. 327-332 (Proceedings - 2022 IEEE International Conference on Services Computing, SCC 2022).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Islam, MM, Merlec, MM & In, HP 2022, A Comparative Analysis of Proof-of-Authority Consensus Algorithms: Aura vs Clique. in CA Ardagna, H Bian, CK Chang, RN Chang, E Damiani, S Dustdar, J Marco, M Singh, E Teniente, R Ward, Z Wang, F Xhafa & J Zhang (eds), Proceedings - 2022 IEEE International Conference on Services Computing, SCC 2022. Proceedings - 2022 IEEE International Conference on Services Computing, SCC 2022, Institute of Electrical and Electronics Engineers Inc., pp. 327-332, 2022 IEEE International Conference on Services Computing, SCC 2022, Barcelona, Spain, 22/7/10. https://doi.org/10.1109/SCC55611.2022.00054

Islam MM, Merlec MM, In HP. A Comparative Analysis of Proof-of-Authority Consensus Algorithms: Aura vs Clique. In Ardagna CA, Bian H, Chang CK, Chang RN, Damiani E, Dustdar S, Marco J, Singh M, Teniente E, Ward R, Wang Z, Xhafa F, Zhang J, editors, Proceedings - 2022 IEEE International Conference on Services Computing, SCC 2022. Institute of Electrical and Electronics Engineers Inc. 2022. p. 327-332. (Proceedings - 2022 IEEE International Conference on Services Computing, SCC 2022). doi: 10.1109/SCC55611.2022.00054

Islam, Md Mainul ; Merlec, Mpyana Mwamba ; In, Hoh Peter. / A Comparative Analysis of Proof-of-Authority Consensus Algorithms : Aura vs Clique. Proceedings - 2022 IEEE International Conference on Services Computing, SCC 2022. editor / Claudio Agostino Ardagna ; Hongyi Bian ; Carl K. Chang ; Rong N. Chang ; Ernesto Damiani ; Schahram Dustdar ; Jordi Marco ; Munindar Singh ; Ernest Teniente ; Robert Ward ; Zhongjie Wang ; Fatos Xhafa ; Jia Zhang. Institute of Electrical and Electronics Engineers Inc., 2022. pp. 327-332 (Proceedings - 2022 IEEE International Conference on Services Computing, SCC 2022).

@inproceedings{2a977852b17f4f108c227bec1d482ca2,

title = "A Comparative Analysis of Proof-of-Authority Consensus Algorithms: Aura vs Clique",

abstract = "Proof-of-authority (PoA) has become a popular consensus algorithm for permissioned blockchains, in which a group of trusted entities governs the networks. This algorithm provides fast consensus while requiring less computational resources and energy. Aura and Clique are two major implementations of PoA, which have their own set of advantages and disadvantages. In this paper, we evaluate the performance of both algorithms in terms of consistency, availability, partition tolerance, security, block time, and transaction throughput. The algorithms were implemented in Python, and experiments were conducted by connecting six consensus nodes having different computing power. The experimental results were comprehensively analyzed. It was observed that Clique provides higher availability and transaction throughput but lower security and consistency than Aura. The blockchains in the Aura network are immediately consistent while the blockchains stored by individual Clique authorities become eventually consistent. Permissioned blockchain practitioners will find this paper useful in choosing the most appropriate PoA implementation based on their requirements.",

keywords = "Aura consensus, Aura vs Clique, Blockchain, Clique consensus, consensus algorithm, proof-of-authority",

author = "Islam, \{Md Mainul\} and Merlec, \{Mpyana Mwamba\} and In, \{Hoh Peter\}",

note = "Publisher Copyright: {\textcopyright} 2022 IEEE.; 2022 IEEE International Conference on Services Computing, SCC 2022 ; Conference date: 10-07-2022 Through 16-07-2022",

year = "2022",

doi = "10.1109/SCC55611.2022.00054",

language = "English",

series = "Proceedings - 2022 IEEE International Conference on Services Computing, SCC 2022",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "327--332",

editor = "Ardagna, \{Claudio Agostino\} and Hongyi Bian and Chang, \{Carl K.\} and Chang, \{Rong N.\} and Ernesto Damiani and Schahram Dustdar and Jordi Marco and Munindar Singh and Ernest Teniente and Robert Ward and Zhongjie Wang and Fatos Xhafa and Jia Zhang",

booktitle = "Proceedings - 2022 IEEE International Conference on Services Computing, SCC 2022",

}

TY - GEN

T1 - A Comparative Analysis of Proof-of-Authority Consensus Algorithms

T2 - 2022 IEEE International Conference on Services Computing, SCC 2022

AU - Islam, Md Mainul

AU - Merlec, Mpyana Mwamba

AU - In, Hoh Peter

PY - 2022

Y1 - 2022

N2 - Proof-of-authority (PoA) has become a popular consensus algorithm for permissioned blockchains, in which a group of trusted entities governs the networks. This algorithm provides fast consensus while requiring less computational resources and energy. Aura and Clique are two major implementations of PoA, which have their own set of advantages and disadvantages. In this paper, we evaluate the performance of both algorithms in terms of consistency, availability, partition tolerance, security, block time, and transaction throughput. The algorithms were implemented in Python, and experiments were conducted by connecting six consensus nodes having different computing power. The experimental results were comprehensively analyzed. It was observed that Clique provides higher availability and transaction throughput but lower security and consistency than Aura. The blockchains in the Aura network are immediately consistent while the blockchains stored by individual Clique authorities become eventually consistent. Permissioned blockchain practitioners will find this paper useful in choosing the most appropriate PoA implementation based on their requirements.

AB - Proof-of-authority (PoA) has become a popular consensus algorithm for permissioned blockchains, in which a group of trusted entities governs the networks. This algorithm provides fast consensus while requiring less computational resources and energy. Aura and Clique are two major implementations of PoA, which have their own set of advantages and disadvantages. In this paper, we evaluate the performance of both algorithms in terms of consistency, availability, partition tolerance, security, block time, and transaction throughput. The algorithms were implemented in Python, and experiments were conducted by connecting six consensus nodes having different computing power. The experimental results were comprehensively analyzed. It was observed that Clique provides higher availability and transaction throughput but lower security and consistency than Aura. The blockchains in the Aura network are immediately consistent while the blockchains stored by individual Clique authorities become eventually consistent. Permissioned blockchain practitioners will find this paper useful in choosing the most appropriate PoA implementation based on their requirements.

KW - Aura consensus

KW - Aura vs Clique

KW - Blockchain

KW - Clique consensus

KW - consensus algorithm

KW - proof-of-authority

UR - https://www.scopus.com/pages/publications/85138078405

U2 - 10.1109/SCC55611.2022.00054

DO - 10.1109/SCC55611.2022.00054

M3 - Conference contribution

AN - SCOPUS:85138078405

T3 - Proceedings - 2022 IEEE International Conference on Services Computing, SCC 2022

SP - 327

EP - 332

BT - Proceedings - 2022 IEEE International Conference on Services Computing, SCC 2022

A2 - Ardagna, Claudio Agostino

A2 - Bian, Hongyi

A2 - Chang, Carl K.

A2 - Chang, Rong N.

A2 - Damiani, Ernesto

A2 - Dustdar, Schahram

A2 - Marco, Jordi

A2 - Singh, Munindar

A2 - Teniente, Ernest

A2 - Ward, Robert

A2 - Wang, Zhongjie

A2 - Xhafa, Fatos

A2 - Zhang, Jia

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 10 July 2022 through 16 July 2022

ER -

A Comparative Analysis of Proof-of-Authority Consensus Algorithms: Aura vs Clique

Abstract

Publication series

Conference

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this