A binary tree where each leaf node is a hash of data and each internal node is the hash of its two children. The root hash (Merkle root) uniquely represents all underlying data. Merkle trees enable efficient proof of inclusion—proving a specific element exists requires only O(log n) hashes. Used in blockchains for transaction verification and state storage.
Empieza por la explicación más corta y útil antes de profundizar.
A binary tree where each leaf node is a hash of data and each internal node is the hash of its two children. The root hash (Merkle root) uniquely represents all underlying data. Merkle trees enable efficient proof of inclusion—proving a specific element exists requires only O(log n) hashes. Used in blockchains for transaction verification and state storage.
Usa primero la analogía corta para razonar mejor sobre el término cuando aparezca en código, docs o prompts.
Piensa en esto como un bloque de construcción que conecta una definición aislada con el sistema mayor donde vive.
Ubica el término dentro de la capa de Solana en la que vive para razonar mejor sobre él.
Conceptos compartidos de cripto que dan marco al ecosistema más amplio.
Convierte el término de vocabulario en algo operacional para producto e ingeniería.
Este término desbloquea conceptos adyacentes rápido, así que funciona mejor cuando lo tratas como un punto de conexión y no como una definición aislada.
Usa este bloque compacto cuando quieras dar contexto sólido a un agente o asistente sin volcar toda la página.
Merkle Tree (merkle-tree-general) Categoría: Blockchain General Definición: A binary tree where each leaf node is a hash of data and each internal node is the hash of its two children. The root hash (Merkle root) uniquely represents all underlying data. Merkle trees enable efficient proof of inclusion—proving a specific element exists requires only O(log n) hashes. Used in blockchains for transaction verification and state storage. Aliases: Hash Tree Relacionados: Hash Function (Cryptographic), Merkle Proof
Usa contexto del glosario, relaciones entre términos, modelos mentales y builder paths para recibir respuestas estructuradas en vez de output genérico.
Opcional: pega código Anchor, Solana o Rust para que el Copilot mapee primitivas de vuelta al glosario.
El Copilot responderá usando el término actual, conceptos relacionados, modelos mentales y el grafo alrededor del glosario.
Estas ramas muestran qué conceptos toca este término directamente y qué existe una capa más allá de ellos.
A one-way mathematical function that maps arbitrary-length input to a fixed-size output (digest). Properties: deterministic, fast to compute, infeasible to reverse, collision-resistant. SHA-256 (used in Bitcoin, Solana PoH) produces 256-bit hashes. Keccak-256 is used in Ethereum. Hashes are used for block linking, Merkle trees, and data integrity.
A Merkle proof is the minimal set of sibling node hashes (the proof path) along the branch from a specific leaf to the tree root, allowing anyone to independently verify that a given leaf is part of a Merkle tree by recomputing the root from the leaf hash and the sibling hashes without needing any other tree data. In Solana's state compression, every compressed account or compressed NFT interaction requires the caller to supply a valid Merkle proof; the on-chain program hashes the proof against the current root stored in the Concurrent Merkle Tree account to confirm inclusion before executing the state change. Proof size scales linearly with tree depth (e.g., a depth-20 tree requires up to 20 sibling hashes, each 32 bytes), so the canopy is used to pre-store upper-level nodes on-chain to reduce the proof data that must be passed in transactions.
Estos son los siguientes conceptos que vale la pena abrir si quieres que este término tenga más sentido dentro de un workflow real de Solana.
Estas entradas son fáciles de mezclar cuando lees rápido, haces prompting a un LLM o estás entrando en una nueva capa de Solana.
A one-way mathematical function that maps arbitrary-length input to a fixed-size output (digest). Properties: deterministic, fast to compute, infeasible to reverse, collision-resistant. SHA-256 (used in Bitcoin, Solana PoH) produces 256-bit hashes. Keccak-256 is used in Ethereum. Hashes are used for block linking, Merkle trees, and data integrity.
Las entradas del glosario se vuelven útiles cuando están conectadas. Estos enlaces son el camino más corto hacia ideas adyacentes.
A one-way mathematical function that maps arbitrary-length input to a fixed-size output (digest). Properties: deterministic, fast to compute, infeasible to reverse, collision-resistant. SHA-256 (used in Bitcoin, Solana PoH) produces 256-bit hashes. Keccak-256 is used in Ethereum. Hashes are used for block linking, Merkle trees, and data integrity.
A Merkle proof is the minimal set of sibling node hashes (the proof path) along the branch from a specific leaf to the tree root, allowing anyone to independently verify that a given leaf is part of a Merkle tree by recomputing the root from the leaf hash and the sibling hashes without needing any other tree data. In Solana's state compression, every compressed account or compressed NFT interaction requires the caller to supply a valid Merkle proof; the on-chain program hashes the proof against the current root stored in the Concurrent Merkle Tree account to confirm inclusion before executing the state change. Proof size scales linearly with tree depth (e.g., a depth-20 tree requires up to 20 sibling hashes, each 32 bytes), so the canopy is used to pre-store upper-level nodes on-chain to reduce the proof data that must be passed in transactions.
Estas entradas viven junto al término actual y ayudan a que la página se sienta parte de un grafo de conocimiento más amplio en lugar de un callejón sin salida.
A distributed, append-only ledger that records transactions in cryptographically linked blocks. Each block contains a hash of the previous block, forming an immutable chain. Nodes in the network maintain copies of the ledger and reach agreement through consensus mechanisms. Blockchains enable trustless, decentralized record-keeping without a central authority.
The protocol by which nodes in a distributed network agree on the current state of the ledger. Common mechanisms include Proof of Work (Bitcoin), Proof of Stake (Ethereum, Solana), and BFT variants. Consensus ensures all honest nodes converge on the same transaction history despite potential network delays or malicious actors.
A consensus mechanism where validators are selected to produce blocks based on the amount of cryptocurrency they have staked (locked) as collateral. PoS is energy-efficient compared to Proof of Work. Misbehaving validators risk losing their stake (slashing). Solana, Ethereum (post-Merge), Cosmos, and Cardano use PoS variants.
A consensus mechanism where miners compete to solve computationally expensive puzzles to produce blocks and earn rewards. PoW provides strong security (51% attack resistance) but is energy-intensive. Bitcoin and pre-Merge Ethereum use PoW. The difficulty adjusts to maintain target block times regardless of total network hash power.