A Universally Unique IDentifier (UUID) URN Namespace

Leach, P., Mealling, M., & Salz, R. (2005). A Universally Unique IDentifier (UUID) URN Namespace.

Type

Report

Intellectual base

Grey literature

Year

2005

DOI

10.17487/rfc4122

Link

https://www.rfc-editor.org/rfc/rfc4122

Cited from

history_historiography, mathematics

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Birthday Problem
  • Hashing and probabilistic data structures — load-factor analysis for hash tables and Bloom filters, where collisions become non-trivial around √K insertions into K buckets, governing table sizing and rehash thresholds. Distributed systems — random-ID collision analysis (UUIDs), where the chance of any two of N generators clashing in a 2^k namespace becomes worth modeling around N ≈ √(2^k), motivating 128-bit identifiers.

    This sourceSpecifies 128-bit UUIDs and the random (version 4) variant whose collision probability stays negligible only while the number of generated identifiers is far below √(2^128) = 2^64, the square-root-of-namespace threshold.

• Identifier Assignment
  • Software and data systems generate universally unique identifiers, database keys, commit hashes, network and hardware addresses, and container digests.

    This sourceSpecifies UUID generation guaranteeing uniqueness within a namespace without a central registry — the opaque-handle minting authority for software and data systems (analogous to a DB sequence/UUID source).

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Links previously used in the corpus

Before the registry existed this work was also linked 1 other way.

• https://doi.org/10.17487/RFC4122 ×1

Registry ID ref:4f35105d7541 · see in the full table