TELKOMNIKA Telecommunication, Computing, Electronics and Control
Fair and trustworthy: Lock-free enhanced tendermint blockchain algorithm
Dublin Core
Title
TELKOMNIKA Telecommunication, Computing, Electronics and Control
Fair and trustworthy: Lock-free enhanced tendermint blockchain algorithm
Fair and trustworthy: Lock-free enhanced tendermint blockchain algorithm
Subject
Blockchain protocol, Consensus protocols, Correctness, Cryptocurrency, Fairness, Lock-free, Smart contracts
Description
Blockchain Technology is exclusively used to make online transactions secure by maintaining a distributed and decentralized ledger of records across multiple computers. Tendermint is a general-purpose blockchain engine that is composed of two parts; Tendermint Core and the blockchain application interface. The application interface makes Tendermint suitable for a wide range of applications. In this paper, we
analyze and improve Practical Byzantine Fault Tolerant (PBFT), a consensus-based Tendermint blockchain algorithm. In order to avoid negative issues of locks, we first propose a lock-free algorithm for blockchain in which the proposal and voting phases are concurrent whereas the commit phase is sequential. This consideration in the algorithm allows parallelism. Secondly, a new methodology is used to decide the size of the voter set which is a subset of blockchain nodes, further investigating the block sensitivity and trustworthiness of nodes. Thirdly, to fairly select the voter set nodes, we employ the random walk algorithm. Fourthly, we imply the wait-freedom property by using a timeout due to which all blocks are eventually committed or aborted. In
addition, we have discussed voting conflicts and consensuses issues that are used as a correctness property, and provide some supportive techniques.
analyze and improve Practical Byzantine Fault Tolerant (PBFT), a consensus-based Tendermint blockchain algorithm. In order to avoid negative issues of locks, we first propose a lock-free algorithm for blockchain in which the proposal and voting phases are concurrent whereas the commit phase is sequential. This consideration in the algorithm allows parallelism. Secondly, a new methodology is used to decide the size of the voter set which is a subset of blockchain nodes, further investigating the block sensitivity and trustworthiness of nodes. Thirdly, to fairly select the voter set nodes, we employ the random walk algorithm. Fourthly, we imply the wait-freedom property by using a timeout due to which all blocks are eventually committed or aborted. In
addition, we have discussed voting conflicts and consensuses issues that are used as a correctness property, and provide some supportive techniques.
Creator
Basem Assiri, Wazir Zada Khan
Source
DOI: 10.12928/TELKOMNIKA.v18i4.15701
Publisher
Universitas Ahmad Dahlan
Date
August 2020
Contributor
Sri Wahyuni
Rights
ISSN: 1693-6930
Relation
http://journal.uad.ac.id/index.php/TELKOMNIKA
Language
English
Coverage
TELKOMNIKA Telecommunication, Computing, Electronics and Control
Files
Collection
Citation
Basem Assiri, Wazir Zada Khan, “TELKOMNIKA Telecommunication, Computing, Electronics and Control
Fair and trustworthy: Lock-free enhanced tendermint blockchain algorithm,” Repository Horizon University Indonesia, accessed April 28, 2025, https://repository.horizon.ac.id/items/show/4019.
Fair and trustworthy: Lock-free enhanced tendermint blockchain algorithm,” Repository Horizon University Indonesia, accessed April 28, 2025, https://repository.horizon.ac.id/items/show/4019.