These tools generate and inspect all three. The validator explains version and variant bits rather than only saying “invalid”, and the decoder pulls the timestamp out of v1, v6 and v7 UUIDs and ULIDs.
UUID & ULID
UUIDs answer a simple need: an identifier that can be created anywhere without coordinating with a central sequence. Version 4 is pure randomness; version 7 adds a timestamp prefix so identifiers sort roughly by creation time, which is much friendlier to database indexes. ULID solves the same problem with a shorter, case-insensitive alphabet.
What people use these for
- Generate stable-looking public IDs that do not leak sequential row counts.
- Choose between v4 and v7 before designing a primary key.
- Validate an identifier pasted from a log or a customer ticket.
- Recover the creation time from a v7 UUID or ULID.
Tools in this family
7 interactiveUUID Generator
Generate UUID v4, time-ordered UUID v7 and ULIDs in the browser. Batch up to 100 identifiers, copy with one click, and decode timestamps.
UUID v4
Generate RFC 4122 version 4 UUIDs with 122 random bits. Copy a single ID or a batch, and understand the version and variant bits.
UUID v7
Generate UUID v7 identifiers with a 48-bit millisecond timestamp and 74 random bits. Sortable, database-friendly, and RFC 9562 compliant.
ULID Generator
Generate ULIDs: 26-character, Crockford base32 identifiers with a 48-bit millisecond timestamp and 80 random bits. Shorter and sortable.
Bulk UUID Generator
Generate batches of UUID v4, v7 or ULIDs and copy them as a list. Up to 100 per batch, one per line, ready for fixtures or seed data.
UUID Validator
Validate UUID strings, detect the version and variant, and catch common formatting mistakes like missing hyphens or invalid hex characters.
Decode UUID
Decode a UUID to see its version, variant and embedded timestamp. Works for v1 (100-ns intervals since 1582) and v7 (Unix milliseconds).
Guides and reference
1 pagesv4 versus v7
A v4 UUID uses 122 random bits, so collision odds are negligible and the value reveals nothing. A v7 UUID uses 48 bits for a Unix millisecond timestamp and 74 bits for randomness. The tradeoff is deliberate: v7 sorts chronologically and improves B-tree locality, but it leaks the approximate creation time and, within one millisecond, still depends on randomness for uniqueness.
ULID is not a UUID
A ULID is 26 characters of Crockford base32: 10 characters of millisecond time followed by 16 characters of randomness. It is shorter than a UUID and sorts lexicographically, but it is not the same wire format and many systems expect the hyphenated UUID shape. Choose based on the consumer, not on which generator looks neater.
Frequently asked questions
Are UUIDs guessable?
v4 and v7 identifiers are not sequentially guessable in the way auto-increment IDs are, but v7 leaks creation time. Do not treat an unguessable ID as an authorization check.
Can two v7 UUIDs collide?
Within the same millisecond, collision probability is governed by the 74 random bits. Across milliseconds the timestamp differs, so collisions require both a clock repeat and a random collision.
Should I use UUIDs as database keys?
They are convenient but larger than bigint keys. v7 and ULID reduce index fragmentation compared with v4; measure before switching a large table.