Inputs

Generate up to 100 at a time.

UUIDs at a glance

A UUID (Universally Unique Identifier) is a 128-bit value formatted as 32 hex digits with dashes: xxxxxxxx-xxxx-Mxxx-Nxxx-xxxxxxxxxxxx, where M is the version (1-7) and N indicates the variant. The probability of generating duplicate UUIDs is functionally zero โ€” you'd need to generate billions per second for years to expect a collision.

The versions you might actually use

VersionHow it's generatedUse case
v1MAC address + timestampLargely obsolete (leaks MAC)
v3MD5 hash of name + namespaceDeterministic IDs from names
v4122 random bitsGeneral-purpose IDs (most common)
v5SHA-1 hash of name + namespaceLike v3 but more secure
v6Reordered v1 โ€” sortableNewer; database-friendly
v7Unix timestamp ms + randomRecommended for new systems; time-sortable

Why v7 is becoming preferred

v4 UUIDs are perfectly random, which is bad for databases โ€” inserts go into random pages of the B-tree, fragmenting the index. v7 UUIDs start with a 48-bit Unix millisecond timestamp, so they sort by creation time. New rows insert at the end of the index, like an auto-increment integer, with the global-uniqueness of a UUID. Best of both.