UUID Generator

A UUID (Universally Unique Identifier) is a 128-bit identifier standardized by RFC 4122 that is guaranteed to be unique across all systems without requiring central coordination. UUIDs are ideal for database primary keys in distributed systems, session identifiers, file naming, message queue correlation IDs, and any scenario where you need guaranteed uniqueness without checking existing values. Unlike sequential auto-increment IDs, UUIDs can be generated independently by any client, making them perfect for distributed databases, microservices architectures, and offline-first applications where multiple systems need to create unique identifiers simultaneously.

UUID Version 1 is time-based and includes the generator's MAC address, making it traceable to a specific machine and time. Version 4 is entirely random (or pseudorandom), providing no traceability but requiring no system information — this is the most commonly used version. Version 5 is namespace-based deterministic, meaning the same namespace and name always produce the same UUID, making it ideal for generating consistent identifiers for known entities. Version 3 is similar to Version 5 but uses MD5 hashing. For most applications, Version 4 is the recommended choice due to its simplicity and lack of information leakage.

The probability of a UUID collision is astronomically low — for Version 4 UUIDs, you would need to generate approximately 2.71 quintillion UUIDs to have a 50% chance of a single collision. This is calculated using the birthday paradox formula. In practice, UUID collisions have never been documented in production systems. You are more likely to have a bug in your code, a hardware failure, or a cosmic ray affecting your memory than to encounter a genuine UUID collision. This makes UUIDs effectively unique for virtually all real-world applications, from small personal projects to planet-scale distributed systems.

UUIDs work well as primary keys in distributed and microservices architectures but have trade-offs compared to sequential integers. The main advantage is that UUIDs can be generated client-side without checking the database, enabling offline data creation and easy data merging across distributed databases. The downside is that UUIDs take more storage space (16 bytes vs 4 bytes for integers), are slower to index due to their size and randomness, and cause more page splits in B-tree indexes. For most modern applications these trade-offs are acceptable, but for extremely high-write throughput systems with simple single-database architecture, sequential IDs may offer better performance.

Our UUID generator uses the Web Crypto API's cryptographically secure random number generator (Crypto.getRandomValues) for Version 4 UUIDs. This provides the same quality of randomness as cryptographic key generation, making the UUIDs unpredictable and suitable for security-sensitive applications like session tokens and CSRF tokens. For Version 1 UUIDs, the timestamp and MAC address components are not random but provide uniqueness. The cryptographic quality of Version 4 UUIDs depends on the underlying browser's implementation of the Web Crypto API, which all modern browsers implement using operating system-level secure random number generators.