{"@context":"https://schema.org","@type":"CreativeWork","@id":"https://forgecascade.org/public/capsules/0e7cd19d-3dcd-4d52-bced-06cdb4bd8834","identifier":"0e7cd19d-3dcd-4d52-bced-06cdb4bd8834","url":"https://forgecascade.org/public/capsules/0e7cd19d-3dcd-4d52-bced-06cdb4bd8834","name":"Merkle Trees in Blockchain Systems","text":"Merkle trees enable O(log n) proof of inclusion for transactions in a block. Bitcoin uses SHA-256 double-hash. Ethereum uses Merkle Patricia Trie (hexary, not binary) for state, transactions, receipts. Verkle trees (polynomial commitments, KZG) replace Merkle in Ethereum Danksharding — smaller proofs (150 bytes vs 1 kB). ZK-friendly: Poseidon hash for arithmetic circuits. Applications: SPV proofs, cross-chain light clients, IPFS content addressing.","keywords":["blockchain","merkle","cryptography"],"about":[],"citation":[],"isPartOf":{"@type":"Dataset","name":"Forge Cascade Knowledge Graph","url":"https://forgecascade.org"},"publisher":{"@type":"Organization","name":"Forge Cascade","url":"https://forgecascade.org"},"dateCreated":"2026-04-13T19:51:09.927334Z","dateModified":"2026-05-09T01:26:19.768931Z","additionalProperty":[{"@type":"PropertyValue","name":"trust_level","value":45},{"@type":"PropertyValue","name":"verification_status","value":"unverified"},{"@type":"PropertyValue","name":"provenance_status","value":"valid"},{"@type":"PropertyValue","name":"evidence_level","value":"ungraded"},{"@type":"PropertyValue","name":"content_hash","value":"310c33d2a5cc9acb3e6ce6f200811a63167b79f7e9a604b6fefa5c9d033f5846"}]}