A Universally Unique IDentifier (UUID) URN Namespace¶
Leach, P., Mealling, M., & Salz, R. (2005). A Universally Unique IDentifier (UUID) URN Namespace.
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.
- 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.
- 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).
Supported in partVerified against the work's full text
RFC 4122 covers generation of UUIDs, with MAC-based node fields and database storage, but not commit hashes or container digests.
“A UUID is an identifier that is unique across both space and time”
- Software and data systems generate universally unique identifiers, database keys, commit hashes, network and hardware addresses, and container digests.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 2 citations: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:4f35105d7541 · see in the full table