Merkle proof
E466595
A Merkle proof is a compact cryptographic proof that verifies a specific piece of data is included in a larger dataset by revealing only a minimal set of hash values from a Merkle tree.
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
cryptographic proof
ⓘ
data inclusion proof ⓘ membership proof ⓘ |
| alternativeTo | full data inclusion proof ⓘ |
| consistsOf |
Merkle root
ⓘ
leaf value ⓘ sibling hashes ⓘ |
| enables |
lightweight clients
ⓘ
stateless verification ⓘ verification without full dataset ⓘ |
| hasAdvantage |
low verification cost
ⓘ
privacy of unrelated data ⓘ small proof size ⓘ |
| hasComplexity | logarithmic in the number of leaves ⓘ |
| hasComponent | authentication path ⓘ |
| hasProperty |
compact
ⓘ
efficient ⓘ non-interactive ⓘ publicly verifiable ⓘ |
| proofSize | O(log n) ⓘ |
| protects |
against data tampering
ⓘ
integrity of data ⓘ |
| relatedTo |
Merkle leaf
ⓘ
Merkle path NERFINISHED ⓘ Merkle root ⓘ Merkle tree NERFINISHED ⓘ |
| reliesOn |
collision resistance
ⓘ
cryptographic hash function ⓘ preimage resistance ⓘ second preimage resistance ⓘ |
| requires |
Merkle root commitment
ⓘ
known hash function ⓘ ordered list of sibling hashes ⓘ |
| usedIn |
Bitcoin
NERFINISHED
ⓘ
Ethereum NERFINISHED ⓘ P2P networks ⓘ SPV wallets ⓘ blockchain systems ⓘ certificate transparency ⓘ commitment schemes ⓘ content-addressable storage ⓘ data availability schemes ⓘ distributed systems ⓘ file integrity verification ⓘ light clients ⓘ verifiable logs ⓘ |
| usesStructure | Merkle tree NERFINISHED ⓘ |
| verificationTime | O(log n) ⓘ |
| verifies |
data inclusion in a Merkle tree
ⓘ
that a leaf is part of a Merkle tree ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.