Skip to content

Merkle Trees Explained

How AirChain uses Merkle trees for data integrity.

What is a Merkle Tree?

A binary tree where each leaf is a data hash, and each parent node is the hash of its children.

Example

        Root (d5e3a1b8...)
          /            \
    (8a4f2b9c...)  (c9d1e2f3...)
      /     \         /      \
   R1      R2       R3        R4

R1-R4 = Individual sensor readings

Verification

To verify R1: - Provide R1's hash - Provide sibling hashes (R2, (R3+R4)) - Recompute root - Compare with on-chain root

See implementation →