Hash Intelligence
A hash function turns any input into a short fixed-length fingerprint. Hashes are used to store passwords, sign messages, deduplicate data and prove that content has not changed. This direction covers the full cycle: computing digests, adding a secret key with HMAC, recognising an unknown hash and finding known values behind SHA-256 digests.
SHA-256 Lookup
Find the original text for a SHA-256 hash in the HashlLab dictionaries.
Free dictionary → extended dictionaries from Basic
Hash Generator
Compute MD5, SHA-1, SHA-2, SHA-3, Keccak, BLAKE2, BLAKE3 and more for any text.
Full access on every plan
HMAC Generator
Create keyed message authentication codes with HMAC-SHA-256, SHA-384, SHA-512 or SHA-1.
Full access on every plan
Hash Identifier
Recognise the likely algorithm behind a hash from its length, alphabet and prefix.
Full access on every plan
Which tool to choose
- Hash Generator
- You have text and need its digest in one or more algorithms.
- HMAC Generator
- The digest must depend on a secret key, as in API and webhook signatures.
- Hash Identifier
- You have a hash and do not know which algorithm produced it.
- SHA-256 Lookup
- You have a SHA-256 digest and want to know whether its original value is known.
What these tools solve
- Compute digests with 14 algorithms, from legacy MD5 and CRC32 to SHA-3, BLAKE2 and BLAKE3.
- Create and check HMAC signatures, for example for webhook payloads.
- Recognise the likely algorithm of a hash found in a database dump, config file or log.
- Find whether a SHA-256 digest corresponds to a value already present in the HashlLab dictionaries.
When they are useful
- Debugging an integration that signs requests with a shared secret.
- Migrating a legacy system and needing to know how its passwords were hashed.
- Checking test vectors while implementing a hashing routine yourself.
How it works
Digests are computed in the browser with hash-wasm (WebAssembly) and verified against published test vectors. HMAC uses the Web Crypto API built into the browser. The Hash Identifier works offline on format alone: prefixes such as $2b$ or $argon2id$, the length of hex strings and Base64 encoding. SHA-256 Lookup is the only tool in this group that sends data to the HashlLab server: it sends the hash, never the original text.
Limits and good practice
- A hash cannot be mathematically reversed. Lookup only finds values that are already in the dictionaries.
- Several algorithms share the same output format, so identification gives ranked candidates rather than a single answer.
- MD5, SHA-1 and CRC32 are shown as weak: fine for checksums, unsuitable for security.
Questions about hashes
Help centerCan a hash be decrypted?
No. Hashing is one-way: there is no key and no way to compute the input from the output. SHA-256 Lookup works differently: it checks whether the hash matches a value that is already in a dictionary. If the value is not there, it cannot be found.
Which dictionaries does SHA-256 Lookup search?
Without an account and on the Free plan, the free dictionary. Paid plans also search the extended dictionaries. Results depend on what the dictionaries contain; a hash of a long random value will not be found.
What does the server learn when I use SHA-256 Lookup?
The hash you searched for and, if you are signed in, your account, which the server needs to apply your plan. It never receives the original text — you only have a hash.
SHA-256 Lookup says my subscription has expired.
Basic and Plus are valid for one month after purchase. Renew on the Pricing page; your account page shows the date the plan expired.
SHA-256 Lookup says the search limit is exceeded.
Your plan’s allowance of found results is used up. Renew the plan or choose one with a higher or unlimited allowance.
What is a hash and what is it used for?
A hash function turns input of any size into a fixed-length value. The same input always gives the same hash, and a tiny change gives a completely different one. Hashes are used to store passwords, detect changes in files, build digital signatures and index data.