Build and visualize Merkle trees from data blocks. Demonstrate proof verification and tamper detection visually.
Starting with separate data blocks, the visualizer maps each block to a leaf digest, combines neighboring digests into parent nodes, and continues until one root remains. It also shows an inclusion proof as the sibling hashes needed to recompute that root, then makes tampering visible when a changed block no longer agrees with the original path. The common surprise is that a Merkle root summarizes both content and tree construction: identical visible text can produce a different root if encoding, leaf framing, pair order, odd-node handling, or the hash function differs.
Each entered block begins at a leaf. The displayed parent above two children represents an ordered combination of those child digests, and repeating that reduction yields the single root. Order matters: swapping two blocks normally changes the ancestors above their positions and therefore the root, even though the collection of block values has not changed.
An inclusion proof contains the sibling digest needed at each level of one leaf's route to the root, together with the side on which each sibling belongs. Verification starts from the target block, combines each sibling in order, and hashes upward. Matching the expected root demonstrates inclusion under the same tree rules without disclosing every other block.
Only if every construction rule matches: text-to-byte encoding, leaf treatment, hash function, child order, odd-leaf policy, and proof representation. A proof made under one convention can fail under another even when the original block text is unchanged. Confirm the receiving system's Merkle specification before treating the shown proof values as interoperable.
No. Successful verification shows that the block, interpreted under the same rules, is consistent with a particular root. It does not prove who created the root, whether the block is factually correct, or whether the complete data set is legitimate. The expected root must come from a source you independently trust.
The behavioral notes were checked against the browser implementation. Standards and primary references below define the relevant format, formula, or platform behavior.
Generate strong, random passwords with customizable length, character sets, and complexity requirements.
Analyze password strength with entropy scoring, crack-time estimates, and improvement suggestions.
Create cryptographically random strings for API keys, tokens, salts, and unique identifiers.
Create QR codes for URLs, text, Wi-Fi credentials, vCards, and more with customizable size and colors.
Scan and decode QR codes from uploaded images or your device camera to extract embedded data.
Compute MD5, SHA-1, SHA-256, and SHA-512 checksums to verify file integrity and detect tampering.