Algorithm based on Byzantine agreement among decentralized agents (BADA)

• Published in: ETRI journal Vol. 42; no. 6; pp. 872 - 885
• Main Authors: Oh, Jintae, Park, Joonyoung, Kim, Youngchang, Kim, Kiyoung
• Format: Journal Article
• Language: Korean
• Published: 한국전자통신연구원 31.12.2020; ETRI
• Subjects: O(N); distributed consensus algorithm; decentralization; proof of nonce
• ISSN: 1225-6463; 2233-7326

Distributed consensus requires the consent of more than half of the congress to produce irreversible results, and the performance of the consensus algorithm deteriorates with the increase in the number of nodes. This problem can be addressed by delegating the agreement to a few selected nodes. Since the selected nodes must comply with the Byzantine node ratio criteria required by the algorithm, the result selected by any decentralized node cannot be trusted. However, some trusted nodes monopolize the consensus node selection process, thereby breaking decentralization and causing a trilemma. Therefore, a consensus node selection algorithm is required that can construct a congress that can withstand Byzantine faults with the decentralized method. In this paper, an algorithm based on the Byzantine agreement among decentralized agents to facilitate agreement between decentralization nodes is proposed. It selects a group of random consensus nodes per block by applying the proposed proof of nonce algorithm. By controlling the percentage of Byzantine included in the selected nodes, it solves the trilemma when an arbitrary node selects the consensus nodes.