  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.
