Generate RFC 4122 UUIDs, time-sortable ULIDs, and secure random tokens. Calculate and verify SHA-256, SHA-512, and MD5 checksums with zero server transmission.
CSPRNG · 100% Client-Side
GENERATED OUTPUT (0)UUIDV4
Generated 0 UUID v4 identifier.
THE DETAILS
RFC 9562 UUIDs, Crockford Base32 ULIDs, and FIPS 180-4 message digests.
1. Step-by-Step Workflow
In the Unique ID Generator tab, choose your identifier type (UUID v4, ULID, or Random Token), select a batch size (1 to 50), and customize uppercase, hyphen, and quote-wrapping options. Switch to Cryptographic Hashes to compute live Hex/Base64 digests and verify expected checksums.
2. RFC 9562 / RFC 4122 UUID v4 vs. ULID
A UUID v4 sets the 4-bit version nibble to 0100 and the 2-bit variant to 10, leaving 122 bits of CSPRNG entropy. A ULID encodes a 48-bit millisecond timestamp plus 80 bits of randomness into a 26-character Crockford Base32 string (excluding I, L, O, and U to prevent visual ambiguity).
3. FIPS 180-4 & Web Crypto Digest Engine
SHA-1 (160-bit), SHA-256 (256-bit), SHA-384 (384-bit), and SHA-512 (512-bit) digests are computed via hardware-accelerated window.crypto.subtle.digest, paired with a pure-TypeScript RFC 1321 MD5 implementation for legacy checksum compatibility.
4. Zero-Egress Security & Related Tools
Generated API tokens and hashed secrets never leave your device memory. Need keyed HMAC signatures, AES-256-GCM encryption, or JWT claim inspection? Visit the Web Crypto playground, JWT decoder, and Base64 & URL converter.
Identifier & Hash Specification Matrix
Algorithm / ID
Bit Length / Encoding
Time-Sortable
Terminal / CLI Equivalent
UUID v4 (RFC 9562)
128-bit (36-char hex)
No (122 random bits)
uuidgen | tr '[:upper:]' '[:lower:]'
ULID
128-bit (26-char Base32)
Yes (48-bit ms prefix)
npx ulid
SHA-256 (FIPS 180-4)
256-bit (64 hex chars)
Deterministic digest
printf "%s" "text" | shasum -a 256
SHA-512 (FIPS 180-4)
512-bit (128 hex chars)
Deterministic digest
printf "%s" "text" | shasum -a 512
Common Cryptographic & ID Pitfalls
Math.random() Is Not Cryptographically Secure
Never generate session tokens or UUIDs with Math.random(), whose internal PRNG state can be reconstructed from a handful of observed outputs. Always use crypto.getRandomValues() or crypto.randomUUID().
Terminal echo Newline Discrepancies
The SHA-256 of hello world (11 bytes) is b94d27b9..., whereas echo "hello world" | sha256sum hashes 12 bytes (including \n). Always use printf or echo -n when comparing CLI digests.
Raw Unsalted Hashes for Passwords
Fast message digests like SHA-256 and MD5 can be brute-forced at billions of guesses per second on modern GPUs. Use key-stretching KDFs such as PBKDF2, scrypt, or Argon2id for passwords.
Case Sensitivity in Hex vs. Base64 Checksums
Hexadecimal digests are case-insensitive (b94d27 equals B94D27), whereas Base64 digests are strictly case-sensitive.
Frequently Asked Questions
How are UUIDs and ULIDs generated without a backend server?
All identifiers are generated directly in your browser using the W3C Web Crypto API (window.crypto.getRandomValues), which draws entropy from your operating system’s cryptographically secure pseudo-random number generator (CSPRNG).
Why should I use ULID instead of UUID v4 for database primary keys?
UUID v4 is completely random across all 122 entropy bits, causing random B-tree page splits and index fragmentation on high-write SQL tables. ULID prefixes 48 bits of millisecond Unix time before 80 bits of randomness, so new records insert sequentially in lexicographical order.
Why does my SHA-256 hash differ from running echo in the terminal?
In bash/zsh, echo "hello" appends a trailing newline byte (0x0A) before piping to shasum, hashing "hello\n" instead of "hello". Use printf "hello" | shasum -a 256 or echo -n "hello" | shasum -a 256 to match exact string digests.
Is MD5 or SHA-1 safe to use for security or password hashing?
No. Both MD5 and SHA-1 are vulnerable to practical collision attacks and are far too fast for password storage. Use MD5 only for legacy non-cryptographic file checksums, SHA-256/SHA-512 for integrity verification, and Argon2id, bcrypt, or PBKDF2 for passwords.
Can I verify an expected checksum directly in the tool?
Yes. Switch to the Cryptographic Hashes tab, paste your payload into the source box, select the digest algorithm, and paste the expected checksum into the Compare & Verify Hash Checksum field for a case-insensitive constant-time comparison.