---
title: Merkle Tree
url: "https://www.unknowngravity.com/en/glosario/arbol-de-merkle-merkle-tree"
site: Unknown Gravity
published: "2025-06-07T15:36:20+00:00"
modified: "2026-10-15T21:18:40+00:00"
language: en
description: A cryptographic structure that lets large sets of data be verified quickly. Learn how a Merkle tree works and why blockchains rely on it.
section: "Home > Glossary > Merkle Tree"
---

# Merkle Tree

la reserva con padding-top (ug-redesign.css); corre antes de que se pinte

, así que no hay CLS. */ (function () { var cur = 'en', want = cur === 'en' ? 'es' : 'en', KEY = 'ug_lang_suggest_off'; var first = String((navigator.languages && navigator.languages[0]) || navigator.language || '').toLowerCase(); if (first.slice(0, 2) !== want || /bot|crawl|spider|lighthouse/i.test(navigator.userAgent || '')) return; try { if (localStorage.getItem(KEY)) return; } catch (e) {} var alt = document.querySelector('link[rel="alternate"][hreflang^="' + want + '"]'); var nav = document.querySelector('.ugn'); if (!alt || !alt.href || !nav) return; var T = want === 'es' ? { q: '¿Prefieres la versión en español?', go: 'Ir a la versión en español', x: 'Cerrar el aviso de idioma' } : { q: 'Prefer the English version?', go: 'Go to the English version', x: 'Close the language notice' }; var bar = document.createElement('div'); bar.className = 'ugn-langbar'; bar.setAttribute('lang', want); bar.style.cssText = 'position:relative;display:flex;flex-wrap:wrap;align-items:center;justify-content:center;gap:4px 14px;' + 'padding:8px 52px 8px var(--ug-gutter);background:var(--ug-black-raise);border-bottom:1px solid var(--ug-hairline);' + 'font:500 14px/1.4 var(--ug-font-body);color:var(--ug-ink-2);text-align:center'; var p = document.createElement('p'); p.style.margin = '0'; p.textContent = T.q; var a = document.createElement('a'); a.href = alt.href; a.hreflang = want; a.textContent = T.go; a.style.cssText = 'color:var(--ug-green);font-weight:600;text-decoration:underline;text-underline-offset:3px'; var x = document.createElement('button'); x.type = 'button'; x.setAttribute('aria-label', T.x); x.textContent = '×'; x.style.cssText = 'position:absolute;right:6px;top:50%;transform:translateY(-50%);width:40px;height:40px;' + 'background:transparent;border:0;color:var(--ug-ink-2);font-size:22px;line-height:1;cursor:pointer'; /* GA4 solo con consentimiento estadístico de Orbit Consent; gtag() solo encola en el dataLayer. */ a.addEventListener('click', function () { try { var oc = window.orbitConsent; if (oc && oc.has && oc.has('statistics')) { (function () { (window.dataLayer = window.dataLayer || []).push(arguments); })('event', 'lang_suggest_click', { language_from: cur, language_to: want, page_language: cur }); } } catch (e) {} }); x.addEventListener('click', function () { try { localStorage.setItem(KEY, '1'); } catch (e) {} if (bar.parentNode) bar.parentNode.removeChild(bar); document.documentElement.classList.remove('ug-has-langbar'); }); bar.appendChild(p); bar.appendChild(a); bar.appendChild(x); nav.appendChild(bar); var root = document.documentElement; var alto = function () { root.style.setProperty('--ug-langbar-h', bar.offsetHeight + 'px'); }; alto(); root.classList.add('ug-has-langbar'); if (window.ResizeObserver) new ResizeObserver(alto).observe(bar); // la barra cambia de alto al girar o al cargar la fuente })();

GLOSSARY · BLOCKCHAIN & WEB3

What a Merkle tree is: the data structure that lets a blockchain verify any transaction with a few hashes, how it works and why light clients rely on it.

Reviewed on October 15, 2026

A Merkle tree is a data structure in the form of a hashed binary tree, widely used in distributed systems and blockchains to achieve efficient verification, data integrity and inclusion proofs. Each leaf of the tree represents the hash of a block of data, and each parent node is calculated as the combined hash of its child nodes.

## What is a Merkle tree?

A **Merkle tree** is a data structure in the form of a **hashed binary tree**, widely used in **distributed systems and blockchains** to achieve **efficient verification, data integrity and inclusion proofs**. In this structure, each **leaf** of the tree represents the hash of a block of data, and each **parent node** is calculated as the combined hash of its child nodes. This process continues until you reach a single final hash at the top, known as the **Merkle root**.

The main technical advantage of the Merkle tree is that it makes it possible to check whether a specific piece of data belongs to the set (for example, a transaction within a block) without having to verify all the elements, using a **Merkle proof**: a minimum sequence of hashes that, together with the original data, makes it possible to reconstruct the root and validate the inclusion.

In blockchains such as **Bitcoin** and **Ethereum**, the Merkle root is stored inside the header of each block. This makes it possible to validate securely and quickly whether a specific transaction is part of that block without having to download the entire history. It is an essential part of mechanisms such as **Simplified Payment Verification (SPV)**, **lightweight validation**, **rollups**, **airdrop verifications using Merkle trees** or off-chain data integrity proofs.

In addition, its efficient structure in terms of space and computing is ideal for applications that require verifying large volumes of data with minimal proofs, being key to the scalability and decentralization of blockchain systems.

Learn more: [What Is Blockchain and How Does It Work? Types, Real Examples and Limits](/en/articulos/que-es-blockchain-y-como-funciona)

## Explained simply

A **Merkle tree** is like an information tree: the leaves hold the data and the branches combine that data into blocks. The great thing is that just by looking at the “root” of the tree, you can check if the data is correct without having to review it piece by piece. This saves a lot of time and maintains security, especially in systems such as blockchain.

## Merkle Tree: key points

- It is a hashed structure that groups data in a hierarchical way.
- Each parent node is the combined hash of its children
- Allows you to verify the integrity of data without having to review all of them
- The Merkle root is used to validate block transactions
- It is the technical basis for blockchains, rollups, SPV, airdrops and more

## Merkle Tree: advantages

- **Fast and efficient verification** of data integrity and belonging
- **Technical scalability**: allows you to manage millions of data items without overloading the network
- **Saves space and resources**, since it does not require full storage
- **High cryptographic security** based on hash functions
- **Ideal for lightweight, decentralized verification**, such as SPV clients

## Merkle Tree: disadvantages

- **Technical complexity** for novice developers
- **Doesn't support efficient dynamic updates** without recalculating the structure
- **Security depends on the strength of the hash function** used
- **Requires proof management (Merkle proofs)** that must be kept accessible
- **On very large trees**, the cost of generating proofs may increase if it is not optimized

RELATED CONCEPTS

[Hash](/en/glosario/hash) [Node](/en/glosario/nodo) [Blockchain](/en/glosario/blockchain) [Token](/en/glosario/token) [Smart contract](/en/glosario/smart-contract)

KEEP LEARNING

[What Is Blockchain and How Does It Work? Types, Real Examples and Limits](/en/articulos/que-es-blockchain-y-como-funciona) [How to protect your digital assets in the cryptocurrency world](/en/articulos/como-proteger-tus-activos-digitales-criptomonedas) [How to issue a security token in Spain: steps and checklist](/en/articulos/como-emitir-security-token-espana) [Comparison of smart contracts programming languages](/en/articulos/lenguajes-programacion-smart-contracts) [Blockchain use cases in the supply chain.](/en/articulos/casos-de-uso-de-blockchain-en-la-cadena-de-suministro)

RELATED SERVICES

[Blockchain protocol development](/en/servicios/desarrollo-de-protocolos-blockchain) [Smart contract audit services](/en/servicios/blockchain-security-audits) [Asset tokenization](/en/servicios/tokenizacion-activos) [Web3 development services](/en/servicios/desarrollo-web3) [Product traceability](/en/servicios/sistema-trazabilidad-de-productos)

[Full glossary](/en/glosario)

This entry is informative. It is not legal, tax or investment advice. The rules cited change: check the current version in each country’s official gazette (for Spain and the EU, [BOE](https://www.boe.es) and [EUR-Lex](https://eur-lex.europa.eu)).