QuotableSatoshi on Nostr: Once the latest transaction in a coin is buried under enough blocks, the spent ...
Once the latest transaction in a coin is buried under enough blocks, the spent transactions before it can be discarded to save disk space. To facilitate this without breaking the block's hash, transactions are hashed in a Merkle Tree, with only the root included in the block's hash. Old blocks can then be compacted by stubbing off branches of the tree. The interior hashes do not need to be stored.
Published at
2024-12-23 00:21:02Event JSON
{
"id": "e4cfb048cbbc152712f87da60c5476bfd75306ae5aa0646cb2345781677a7dab",
"pubkey": "87570647ca3b7549e66cb6c4bb8d197f5bc91de73b58eb1ade78c8ddd5fec7eb",
"created_at": 1734913262,
"kind": 1,
"tags": [],
"content": "Once the latest transaction in a coin is buried under enough blocks, the spent transactions before it can be discarded to save disk space. To facilitate this without breaking the block's hash, transactions are hashed in a Merkle Tree, with only the root included in the block's hash. Old blocks can then be compacted by stubbing off branches of the tree. The interior hashes do not need to be stored.",
"sig": "01aa991efc515a2b35628eb819bf9f8798a570921ed0883ff2a5de670c01080028bf491ef137c64bfcbcd2e9c5bb781c81bfdda78e3f946b24b7135b7bd3d76f"
}
