A Merkle tree is an information construction that is used in Blockchain to verify data or transactions in a large content pool in a safe manner. The role of the Merkle tree is crucial in Bitcoin and other cryptocurrencies in a Blockchain network. In this paper, we propose a bright and enhanced verification method, Merkle Trim Tree-based Blockchain Authentication (MTTBA) for the hash node traversal to reach the Merkle Root in a minimum time. MTTBA is a unique mechanism for verifying the Merkle Tree's accumulated transactions specifically for an odd number of transactions. The future impact of cryptocurrency is going to be massive and MTTBA proves its efficacy in transaction speed and eliminating node duplication. Our method enables any block to validate transactions' full availability without duplicating hash nodes. Performance has been evaluated in different parameters and the results show marked improvement in throughput(1680ms), processing time(29700kbps), memory usage(140MB), and security(99.30%). The energy consumption factor is crucial in the scenario, and MTTBA has achieved the lowest of 240 joules.
翻译:Merkle树是一种信息构造, 用于在链链中以安全的方式对数据或交易进行大量内容库进行核查。 Merkle树的作用在Bitcoin 和块链网络中的其他加密中至关重要。 在本文中, 我们提出一个亮度和强化的核查方法, Merkle Trim Tream 块链认证( MTTBA ), 供散列节点在最短的时间内到达 Merkle Root 。 MTBA 是一个独特的机制, 用于核实Merkle 树累积的交易, 具体针对奇数的交易。 加密货币的未来影响将是巨大的, MTTBA 证明了其在交易速度上的有效性并消除了节点重复。 我们的方法使得任何块可以在不重复的情况下验证交易的完全可用性。 绩效已经按照不同的参数进行了评估, 并且结果显示通过量( 180 ) 、 处理时间 ( 29700 kbps ) 、 记忆使用 ( 140MB) 和安全 (99. 30% ) 。 的能源消耗系数在设想中至关重要, MTTTBA 已经达到了240 最低 。