Gracy, M., Jeyavadhanam, Rebecca and Raj, Albert Antony (2023) Enhancing transaction verification through pruned merkle tree in blockchain. Journal of Theoretical and Applied Information Technology, 101 (20). pp. 6421-6433.
|
Text
17Vol101No20.pdf - Published Version Available under License Creative Commons Attribution Non-commercial No Derivatives. | Preview |
Abstract
A Merkle tree is a data structure employed within Blockchain technology to securely verify information or transactions within a vast data collection. This paper proposes a new and improved verification method, Pruned Merkle Tree (PMT), for hash nodes marching to the Merkle Root in a Minimal duration. PMT is a unique mechanism for verifying unpaired transactions in a block. The future influence of cryptocurrency will be immense, and PMT showcases its effectiveness in terms of transaction speed and node repetition. Our method allows any block to validate the full availability of transactions without repeating hash nodes and focuses on improving the transaction process through the Pruned Merkle Tree and achieving remarkable results. To assess the performance of the proposed system, we used Hyperledger Caliper, a benchmarking tool specifically designed for measuring the performance of Hyperledger-based blockchain solutions. The evaluation results show a significant improvement in throughput, with a value of 30450kbps recorded. The processing time has also increased noticeably, reaching 1660ms. Security measures have also been strengthened, yielding an impressive 99.60%. The energy consumption factor plays a crucial role, and the PMT exhibits the lowest value at 235 joules.
Keywords: Blockchain, Merkle Tree, Pruned Merkle Tree, Security, Transaction Verification
| Item Type: | Article |
|---|---|
| Status: | Published |
| School/Department: | London Campus |
| URI: | https://ray.yorksj.ac.uk/id/eprint/9065 |
University Staff: Request a correction | RaY Editors: Update this record
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)
