Transparency log inclusion proof

Checks whether an entry belongs to a transparency log Merkle tree by the RFC 6962 rule: node = SHA-256(0x01 ‖ left ‖ right), leaf = SHA-256(0x00 ‖ data). You bring the leaf hash, the index, the tree size, the audit path hashes and the claimed root, and the tool rebuilds the root bottom-up with the even/odd node rule and compares it with the claimed one. It shows a table of steps with the left and right hash, the step count, and the computed and claimed root. SHA-256 is implemented in its own code without crypto.subtle.

Fill in the fields, run the tool and review the result. Your input is not added to a public page. Use the learning mode for calculation details.