# Tutorial 32: Merkle Leafs {% hint style="info" %} [**Book an audit with Zokyo**](https://www.zokyo.io/) {% endhint %} Merkle trees are widely used in blockchain technology and cryptographic applications to prove the inclusion of an item in a set without revealing the entire set. This efficient proof system is leveraged in various decentralized applications to validate specific data, such as token IDs, transaction information, or other criteria. A typical Merkle tree consists of **leaf nodes** (which hold the original data) and **intermediate nodes** (which are combinations of two child nodes' hashes). The root node, or the **Merkle root**, is a single hash that represents the entire tree. While Merkle trees are efficient and secure for data validation, vulnerabilities can arise if the distinction between leaf nodes and intermediate nodes is not properly enforced in the validation process. When the system mistakenly treats intermediate nodes (non-leaf nodes) as valid data, attackers can exploit this weakness to manipulate the system, leading to unexpected outcomes, including data corruption, incorrect validation, and potential loss of value. --- # Agent Instructions: Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://zokyo-auditing-tutorials.gitbook.io/zokyo-tutorials/tutorial-32-merkle-leafs.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.