Authors:
Syed Badruddoja
1
;
Ram Dantu
2
;
Mark Dockendorf
2
;
Abiola Salau
2
and
Kritagya Upadhyay
3
Affiliations:
1
Dept. of Computer Science, California State University, Sacramento, 6000 J Street, Sacramento, California, 95819, U.S.A.
;
2
Dept. of Computer Science, University of North Texas, 3940 N. Elm Street, Denton, Texas, 76207, U.S.A.
;
3
Dept. of Computer Science, Middle Tennesse State University, 1301 E Main St, Murfreesboro, TN 37132, U.S.A.
Keyword(s):
Blockchain, Consensus Protocol, Deliberative Consensus, Algorithm, Artificial Intelligence.
Abstract:
Consensus algorithms require a majority of nodes in a distributed system to agree on a single value. Blockchain systems commission these consensus algorithms to ensure security and trust in decentralized applications. However, current consensus algorithms do not address the requirements of high-stake applications that demand unanimous consensus with deliberation. For instance, a trial case at a court requires unanimous consensus to decide the fate of a criminal. With limited agreement structure and no deliberation, the current consensus protocol cannot handle the consensus problem. Our research determines the requirements of a deliberative unanimous consensus model for high-stake applications. Moreover, we propose a family of consensus models that agree on the answer’s correctness and the methods used to reach it.