Hash & UUID Generator
Compute SHA-1, SHA-256, SHA-384, or SHA-512 hashes of any text, or generate random UUID v4 identifiers, using your browser's built-in Web Crypto API. Nothing is sent to a server.
Reviewed by Vincenzo Manto, Founder & Lead Developer · Last updated September 27, 2026
How it works
- 1
Switch to the Hash tab, type or paste your text, and pick SHA-1, SHA-256, SHA-384, or SHA-512.
- 2
The hex digest updates instantly as you type.
- 3
Or switch to the UUID tab and click Generate to get a random UUID v4.
- 4
Copy the hash or UUID with one click.
Quick hashes and UUIDs without installing anything
Developers reach for a hash or a UUID constantly - verifying a file's checksum, generating a unique key for a database row, or checking that two payloads are byte-identical. This tool covers both needs in one place, computing results instantly with the same cryptographic APIs your browser already ships.
Backed by the Web Crypto API, not a custom implementation
Rather than reimplementing SHA algorithms in JavaScript, this tool calls the browser's native, audited SubtleCrypto interface, so the digests match exactly what any standard library (OpenSSL, Node's crypto module, Python's hashlib) would produce for the same input.
Frequently asked questions
Is the hashing done in my browser or on a server?
Entirely in your browser, using the Web Crypto API's built-in SubtleCrypto.digest() function, the same cryptographic primitive Chrome, Firefox, and Safari expose natively, so no text you hash is ever transmitted.
Which hash algorithm should I use?
SHA-256 is the standard choice for most modern use cases (checksums, integrity verification). SHA-1 is included for compatibility with legacy systems but is not considered cryptographically secure anymore; SHA-384/512 offer a larger digest for higher-assurance needs.
Are the generated UUIDs cryptographically random?
Yes. UUID v4 generation uses the browser's crypto.getRandomValues(), a cryptographically secure random number generator, not Math.random(), so the values are suitable for use as unique identifiers.
Can two different pieces of text produce the same hash?
In theory a collision is possible for any hash function, but for SHA-256 and above it's computationally infeasible to find one deliberately, which is why these algorithms are trusted for integrity checks.
Can I use this to hash passwords for storage?
Not for password storage. Raw SHA hashes compute fast, which makes them unsuitable for that purpose. Passwords should use a slow, salted algorithm like bcrypt or Argon2, designed to resist brute-force attacks.