Notification
Go to Home All Tools Compare Glossary Blog Contact

UUID Generator

Generate RFC-compliant UUIDs (v1, v4, v5, v7) instantly, with bulk generation, custom formatting, and export to TXT, CSV, or JSON.

100% Secure Local Execution
Notice
All UUID generation and validations are computed locally on your device. Your seed inputs, namespaces, and generated identifiers are never transmitted to external APIs or servers.

Generation Parameters

Formatting Options

Generated Output

0 UUIDs
Export Downloads
Knowledge Hub

Deep Dive: Understanding UUID Specifications

What is a UUID?

A Universally Unique Identifier (UUID) is a 36-character hexadecimal string representing a 128-bit integer. The format consists of five groups separated by hyphens (8-4-4-4-12) to ensure readable representation. Due to their scale and design, systems can generate UUIDs independently with virtually zero risk of collision, making them the standard choice for decentralized identifiers.

Comparing UUID Versions

v1 MAC & Timestamp

Generates identifiers based on the combination of a 60-bit timestamp and a unique host node address (usually the network MAC address). Useful when spatial tracking or sequence verification is key.

v4 Random Generation

Purely random generation using cryptographically secure pseudorandom numbers. Recommended for standard session tokens, API request tracing, and generic object key identifiers.

v5 Deterministic Hashing

Deterministic UUIDs generated by applying SHA-1 hashing to namespaces combined with custom string payloads. The same namespace and name combination will always return the exact same UUID.

v7 Time-Ordered (New Standard)

The newest standard. Incorporates a 48-bit Unix timestamp in milliseconds as the leading sequence, followed by random bits. Highly recommended for relational database index keys.

Database & Distributed Architectures

Using standard auto-incrementing integer keys creates security exploits (allowing data enumeration attacks) and blocks horizontal scaling across multiple databases due to synchronization requirements. UUIDs remove this bottleneck.

While UUID v4 has been historical, it creates high B-tree page fragmentation on writes because of its random nature. **UUID v7** completely solves this by using timestamp prefixes, offering the index insertion efficiency of auto-incrementing keys alongside global decentralized uniqueness.

UUID Generation Best Practices

  • Index Layouts: Use UUID v7 for primary keys to optimize index structures in MySQL, PostgreSQL, and SQLite.
  • Case Sensitivity: Treat UUIDs as case-insensitive strings. However, standard convention recommends lowercase representation.
  • Storage Optimization: Databases can store UUIDs as native 16-byte binary chunks (`BINARY(16)` or `UUID` type) instead of 36-character strings to reduce indexing disk footprints by 50%.

Alternative Distributed Identifiers

ULID Lexicographically Sortable

ULIDs are 128-bit compatible with UUIDs but use Crockford's Base32 encoding for a shorter 26-character case-insensitive string representation. They are lexicographically sortable by default due to a 48-bit timestamp prefix.

Snowflake ID 64-Bit Time-Sortable Integers

A 64-bit sortable identifier containing a timestamp, worker node ID, and sequence number. Highly efficient for indexing in relational databases due to its small footprint, but requires active coordination for worker nodes.

Education

Comparing UUID Versions and Their Uses

01

What a UUID Actually Is

A Universally Unique Identifier (UUID) is a 128-bit value almost always written as 32 hexadecimal characters split into five groups (8-4-4-4-12), such as 6ba7b810-9dad-11d1-80b4-00c04fd430c8. Because the identifier space is so large, independent systems can generate UUIDs without any central coordination and the chance of two colliding is negligible, which is why they are the standard choice for distributed primary keys and correlation IDs.

02

Why Version 4 and Version 7 Differ

Version 4 fills every bit with cryptographically secure random data using the crypto.getRandomValues API, aside from a few fixed version and variant bits, making it fully unpredictable but random in sort order. Version 7, generated the same way in this tool, instead places a millisecond-precision timestamp in the leading bits followed by random data, so UUIDs generated later always sort after ones generated earlier, which keeps database indexes far more efficient on insert.

03

When Version 1 or Version 5 Makes Sense

Version 1 combines a timestamp with a unique node identifier, giving every generated value a traceable time and machine origin, while Version 5 hashes a namespace UUID together with a name string using SHA-1, so the same namespace and name combination always produces the identical UUID every time it is generated. Version 5 is useful for deriving a stable, repeatable ID for a resource such as a domain name or file path, using presets like the DNS namespace 6ba7b810-9dad-11d1-80b4-00c04fd430c8 shown in the validator.

04

Validating and Exporting Generated IDs

The validator checks a pasted string against the standard 8-4-4-4-12 hyphenated pattern, reporting its version number and RFC 4122 variant if it matches. Generated batches can be copied or exported as plain text, CSV, or a JSON array for direct use in seed data or test fixtures. Pair this tool with the Password Generator when a project needs both unique identifiers and strong random secrets.

Good to know

Questions, answered

Quick answers about how this tool works.

A Universally Unique Identifier (UUID) is a 128-bit label used to uniquely identify resources in computer systems. Standardized by the Open Software Foundation (OSF) and RFC 4122, they are designed to have an infinitesimal probability of duplication.

UUID v1 is based on the host's MAC address and a timestamp. UUID v4 is generated using cryptographically secure random numbers. UUID v5 is generated using SHA-1 hashing of a namespace and a name. UUID v7 is a newer time-ordered format containing a millisecond-precision Unix timestamp in the most significant bits, making it highly optimal for database primary keys.

Traditional random UUIDs (v4) cause high index fragmentation in databases (like B-Trees) because of their random sorting. UUID v7 is chronologically sorted (lexicographically ordered), which preserves insertion order and dramatically improves write performance while remaining globally unique.

Yes. All generation, validation, and transformations occur locally inside your browser using standard cryptographic APIs (like crypto.getRandomValues). No generated IDs or inputs are ever transmitted to any external server.

You can generate up to 5,000 UUIDs at a time. The generation is optimized using fast loops to prevent interface locking.

Popular Tools on EasyToolio

Swipe

What do you need to work out next?

Search 190+ free tools by name, or pick a category below. Every one runs instantly in your browser — no signup, nothing to install.

More Utility Tools