CSE1001 Study Guide - Merkle Tree, Ethereum, Cryptocurrency

16 views1 pages

Document Summary

Merkle trees are a type of data structure commonly used in computer science that are used to encrypt blockchain data more effectively and securely in cryptocurrencies such as bitcoin and. A merkle root is a simple mathematical method for confirming the facts on a merkle tree. They are used in cryptocurrency to ensure that data blocks sent through a peer-to- peer network are whole, undamaged, and unaltered. Merkle roots play a crucial role in the computation required to keep cryptocurrencies like bitcoin and ethereum running. A merkle tree totals all transactions in a block and generates a digital fingerprint of the entire set of operations, allowing the user to verify whether a transaction is included in the block. Merkle trees are made by hashing pairs of nodes repeatedly until only one hash remains. They are built from the bottom using transaction ids, which are hashes of individual transactions. Each non-leaf node is a hash of its previous hash.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers

Related Documents

Related Questions