Proofs, sealed
A SHA-256 commitment sits below, the root of a small Merkle tree. Some of its leaves are phrases, known only to the person each one is meant for. Paste yours. The check happens entirely in this tab: no fetch, no server, no record of what you typed.
No phrase yet? The public demo phrase is: "the room after this one"
Committed root
e8b34ba2bab3f612d93bffb34433325af88675a1760735aac59b583aad80711e
Leaves in this tree (4)
How it works: your phrase is hashed with SHA-256. That hash is the leaf. The leaf is paired with its sibling and hashed again, and again, until one hash remains, the root shown above. If your climb ends at the same root, your leaf is really in the tree. The same hash that proves membership is also, byte for byte, the AES-GCM key that decrypts the paragraph sealed to that leaf. One phrase, one proof, one key.