PROOF ORCHARDOne record. A trail of trust.

A PLAYABLE MERKLE TREE

A whole orchard,
proven one branch at a time.

Prove that a specimen belongs to a sealed inventory without sending every record. Pair its fingerprint with the correct sibling at each level, then decide whether the final seal matches.

Learn the trail in 20 seconds
  1. Find the sibling: the adjacent block sharing your pair. Records 1 and 2 are siblings; blocks 1–2 and 3–4 are siblings.
  2. Choose whether that sibling goes to the left or right of your current block.
  3. Combine upward until you reach the root. Accept a matching seal; reject a mismatch.

TRUSTED ROOT

Your proof trail

    The computation behind the trail

    Every leaf is SHA-256 of a specimen record. Every parent is SHA-256 of its ordered child hashes. A membership witness contains one sibling per level, so an inventory of 16 records needs just four sibling hashes. This uses the pinned MerkleTree engine's actual construction and proof verification.

    A trusted root must come from somewhere you trust. This learning game supplies it; a matching proof alone does not make a real-world claim truthful. Fingerprints shown are shortened for readability, but all comparisons use complete 256-bit hashes.

    Source: merkletreejs/merkletreejs · MIT · 1,244 stars observed 30 October 2026. Original challenges and GPT specimen art. License