默克尔树
默克尔树
Cryptography
8 个参考
一棵哈希树,将许多项汇总为一个根哈希。它可以实现高效的包含证明:节点可以证明交易位于区块中,而无需透露所有交易。
出现在 8 个白皮书章节中
Reclaiming Disk Space
...facilitate this without breaking the block's hash, transactions are hashed in a Merkle Tree [^7] [^2] [^5], with only the root included in the block's hash. Old blocks can...
Simplified Payment Verification
... │ │ ┌───────────────────┐ │
│ │ Merkle Root │ │ │ │ Merkle Root │ │ │ ...
Merkle Trees
... blocks to enable efficient and secure verification of transaction inclusion. A Merkle tree is a binary tree of hashes where the leaf nodes contain hashes of individual tr...
Decentralized File Storage
...s: the contract randomly selects portions of files and asks providers to supply Merkle tree proofs demonstrating they possess that data. Providers who fail challenges or g...
Proof of Reserves
...alance is included in the audited totals, the Tether system proposes the use of Merkle tree proofs. This technique, borrowed from Bitcoin's own block structure, works as f...
Challenges and Risks
...ent in building on a transparent public blockchain. While the proof of reserves Merkle tree approach is designed to allow individual verification without exposing other us...
Conclusion
...the blockchain with periodic independent audits of fiat reserves, and proposing Merkle tree proofs for individual balance verification, the system provides users with subs...