Create binding commitments to values using hash-based commitment schemes. Reveal and verify later without trust.
You enter a value and a random secret nonce; the tool returns a one-way hash of the two combined, as a hex digest. Share that digest as your commitment. When it is time to reveal, you enter the original value and nonce again and the tool recomputes the hash to confirm it matches the commitment. The binding property comes from the hash's collision resistance; the hiding property comes almost entirely from the nonce. Commit without a nonce and anyone who can guess your value can brute-force it. The tool runs entirely in the browser, so your value and nonce never leave the machine.
To commit, the tool concatenates your value with a random nonce and hashes the combined bytes, typically with SHA-256, returning a fixed-length hex digest. Publishing that digest hides the value because the nonce supplies entropy: for any guessable value there are astronomically many nonces that could have produced the same digest, so an observer cannot tell which value was committed. The digest itself reveals no structure about its input.
Revealing means publishing the original value and nonce. Anyone can then recompute the hash and compare it against the stored commitment; an exact match proves that this value and nonce pair are the ones that were committed. Finding a different pair that hashes to the same digest would require breaking the hash's collision resistance, which is infeasible for SHA-256, so the committer cannot later swap in a different value.
Not if the commitment includes a random nonce that stays secret: the digest is one-way, and with enough nonce entropy brute-forcing is infeasible. But if the value is guessable and you committed without a nonce, they can simply try guesses. Also note the scheme cannot protect you from being pressured to reveal later; that is outside what a commitment does.
No. There is no key, database, or backdoor; the hash is one-way by design, so the original input cannot be recovered from the digest, and verification needs the exact bytes you committed. Even one changed character or a different encoding produces a different hash. Save the value, nonce, and commitment together before you share anything.
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.