How to use it 01 Pick a kind: UUID v4, UUID v7, UUID v1 or ULID. 02 Set how many to mint (1–500) and generate; copy them all or one at a time. 03 Paste any identifier into the parse box to see what it encodes — the panel accepts UUIDs with or without hyphens and urn:uuid: prefixes. 04 Use the comparison table to choose between the four kinds for a new field.
Worked readouts
Input
Kind
Timestamp recovered
Random bits
Sortable
550e8400-e29b-41d4-a716-446655440000
UUID v4
none
122
no
f81d4fae-7dec-11d0-a765-00a0c91e6bf6
UUID v1
1997-02-03T17:43:12.216Z
62
no
018bcfe5-6800-7243-bd0c-de1cee9250a0
UUID v7
2023-11-14T22:13:20.000Z
74
yes
01HF7YAT00NS2M9656TYVRKCYD
ULID
2023-11-14T22:13:20.000Z
80
yes
All four report the RFC 9562 variant (or Crockford Base32 for the ULID) and a canonical form; the panel also shows the 32-hex-digit payload. Minting a v7 at the 2026-10-07 midnight epoch produces a value beginning 01a113a8 ; the equivalent ULID begins 01M49THV00 . Input that is neither a UUID nor a ULID gets a clear refusal rather than a guess: "Not a UUID (32 hex digits) nor a ULID (26 Crockford Base32 characters)".
What the bits mean A UUID is 128 bits, and the version nibble decides what they hold. v4 spends 122 bits on randomness and carries no timestamp at all. v1 packs a 60-bit timestamp (in 100-nanosecond units since 1582) with a node field; browsers cannot see a MAC address, so the generator invents a random node and sets the multicast bit to announce that fact. v7 puts a 48-bit Unix millisecond count first, followed by 74 random bits, so lexicographic order equals time order. ULID does the same in a different alphabet: 48-bit milliseconds plus 80 random bits written as 26 characters of Crockford Base32, which omits I, L, O and U to avoid transcription errors. Parsing simply reverses the layout — decode the time field, count the random bits, and check whether sorting by string sorts by time.
Limits and honest assumptions
Same-millisecond ties. v7 and ULID values minted in the same millisecond share a timestamp and differ only in their random bits, so string order within that millisecond is arbitrary; strict monotonicity needs a counter that this generator does not add.
v1 is legacy. It embeds a timestamp and, historically, a real MAC address; the panel's random node avoids the leak but keeps the timestamp exposure.
Randomness source. Values come from crypto.getRandomValues; if the platform cannot provide it, the panel refuses to generate rather than falling back to a predictable source.
What it does not do. It does not verify signatures or checksums (UUIDs have none), migrate a database, or generate name-based v3/v5 identifiers.
Sorting a v4 column is meaningless v4 IDs are random by design, so ordering by them groups nothing and correlates with nothing; if a key must sort by creation time, generate v7 or ULID instead. The reverse mistake is assuming a sortable ID guarantees ordering: two v7 values from the same millisecond still need a tiebreaker, and clocks that jump backwards — time synchronisation, VM snapshots — can mint an ID that sorts earlier than one created before it. Finally, treat every ID as opaque in application code: its internal layout is useful for debugging and indexing, but code that parses version bits out of an ID to make business decisions is coupled to a format that is allowed to change.
Where it is used Choosing a primary key Pick v7 or ULID when new rows should sort with insertion order and the index should stay dense; pick v4 when opacity and simplicity matter more than ordering.
Debugging an ID from a log Paste it into the parse box: a recovered timestamp tells you roughly when the record was created and whether a clock-skew complaint is plausible.
Privacy Generation uses the browser's random source and parsing is local; identifiers you paste are never uploaded or stored.
References
IETF, RFC 9562: Universally Unique IDentifiers (UUIDs) , rfc-editor.org (访问日期:2026-10-07)— current layouts, including v7, and the multicast-bit node convention.
IETF, RFC 4122: A UUID URN Namespace , rfc-editor.org (访问日期:2026-10-07)— the historical v1/v3/v4/v5 definitions.
ULID authors, ULID specification , github.com (访问日期:2026-10-07)— timestamp-first layout and Crockford Base32.
Wikipedia, Universally unique identifier , en.wikipedia.org (访问日期:2026-10-07)— versions, variants and collision probability.
Calculators in this hub
Hand-picked tools, one click away. The mini versions compute live and carry your values into the full calculator.
Sources & review
Reviewed by CalcX Editorial Team
Updated 2026-10-07