How to create Merkle Trees for airdrops: Quiz Solution
Awais Sajid
1 min read
What kind of data structure is a Merkle Tree?
- Tree
How is each leaf node labeled in Merkle Tree?
- A cryptographic hash of the data block
How is each non-leaf node labeled in Merkle Tree?
- A cryptographic hash of its child nodes’ values
In the above image, what will be the label of parent node for C and D leaf nodes, in case of Merkle Trees?
- Hash CD
If node D is replaced with node E, what will be the label of the parent node now?
- Hash CE — it will change
Can the same data give two different hashes in a Merkle Tree?
- No
Which one of the following is not a property of a hash function?
- Can be reverse engineered
Which one of the following is not a benefit of using a Merkle Tree?
- Data is stored sequentially
Where are Merkle Trees not used?
- SQL Databases
How does a merkle proof work?
- We give the verifier the value of the node we want to check along with all other nodes which are required from the tree to hash up and form the root hash r.
0
Subscribe to my newsletter
Read articles from Awais Sajid directly inside your inbox. Subscribe to the newsletter, and don't miss out.
Written by
Awais Sajid
Awais Sajid
As a Cybersecurity student passionate about Hacking and Blockchain security, I strive to develop innovative solutions to protect against emerging threats.