System Design
05Design patternsUnique ID generation

05 · Reusable pattern

Unique ID generation

Compare UUIDs, database sequences, range allocation, and Snowflake-style sortable IDs.
8 minConcept guideReference-informed · independently authored
01

Lesson spine

What you need to understand.

An ID strategy balances independence, order, index locality, exposure, and the failure modes of clocks or coordination.

01

Database sequences

Simple and ordered but tied to a coordination point; range allocation can amortize that dependency.

02

UUID v4

Generate independently with negligible collision risk, at the cost of 128 bits and poor B-tree locality.

03

Snowflake-style IDs

Pack time, worker identity, and a per-millisecond sequence into sortable 64-bit values with clock and lease dependencies.

04

ULID and UUID v7

Keep UUID-sized identifiers while adding time order for friendlier indexes and debugging.

05

Clock rollback

Pause, use a logical timestamp, or fail the worker rather than generating an ID in an already-used time range.

06

Hash-based IDs

Use a content digest for deduplication or integrity, but plan collision checks and mutable-content semantics.

02

Before the boxes

Frame the decision.

Outcome

What must work

Compare UUIDs, database sequences, range allocation, and Snowflake-style sortable IDs.

Scale

What changes the design

IDs/s · lifetime count · bit allocation · clocks · workers · collision budget

Boundary

What owns the truth

Identify the component that commits authoritative state, then separate synchronous confirmation from derived work.

Non-goal

What stays simple

Do not add global coordination, multi-region writes, or a specialized store until a requirement earns the complexity.

03

Architecture map

Trace ownership, not just traffic.

Unique ID generation · concept mechanism

Walk one representative request across every arrow. Say whether the handoff is synchronous or asynchronous, what identity makes a retry safe, and which step changes authoritative state.

  1. 01

    Caller — Requests or generates ID Define the output contract before moving to the next owner.

  2. 02

    Generator — Combines time, node, sequence Define the output contract before moving to the next owner.

  3. 03

    Lease service — Allocates ranges Define the output contract before moving to the next owner.

  4. 04

    Clock guard — Handles rollback Define the output contract before moving to the next owner.

  5. 05

    Encoder — Controls exposure Define the output contract before moving to the next owner.

  6. 06

    Storage — Uses key for locality Confirm the result and emit the evidence needed to reconcile it.

04

Decision table

Make the trade-offs explicit.

DecisionDefensible positionCost to acknowledge
Primary mechanismUUIDs maximize independence; Snowflake-style IDs add order with clock and worker dependencies.The stronger guarantee usually adds coordination, latency, state, or operational work.
Sync vs. asyncKeep only correctness-critical confirmation synchronous. Move derived views, notifications, analytics, and cleanup behind a durable boundary.Async work needs idempotency, lag monitoring, replay, and a product definition for partial completion.
Simple vs. scaledBegin with one logical owner and a clear API. Partition or replicate only the resource proven to be the first bottleneck.Migration requires stable identities, versioned contracts, backfill, and a rollback path.
05

Failure review

Design the recovery path.

DetectBoundRetry safelyReconcileLearn

Topic-specific risk

Clock rollback or duplicate worker IDs silently violates uniqueness.

Response

Persist enough identity and state to distinguish retry, resume, compensation, and operator repair.

Dependency timeout

A timeout is ambiguous: the remote side may have failed, succeeded, or still be running.

Response

Use deadlines, bounded backoff with jitter, idempotency keys, and a status or reconciliation path.

Overload or skew

Average capacity can look healthy while a tenant, key, partition, region, or expensive request saturates one owner.

Response

Expose queue depth and hot-key share, apply backpressure, isolate tenants, and degrade optional work before correctness.

06

Evidence + level bar

Prove the design can be operated.

Core signals

Health of the promise

Measure user-visible latency or freshness, correctness drift, saturation, retry volume, and time to recover. Alert on the failed promise—not only CPU.

Mid-level

Complete and clear

Finish the happy path, identify the state owner, choose reasonable building blocks, and explain one scale mechanism.

Senior

Trade-offs and failure

Separate read and write paths, define consistency, explain partitioning, and make duplicate or partial failure safe.

Staff+

Evolution and operations

Discuss multi-region boundaries, migration, tenant isolation, capacity, observability, and how the architecture changes over time.

07

Interview language

Open the deep dive with a claim.

“For Unique ID generation, the decision I want to make explicit is this: UUIDs maximize independence; Snowflake-style IDs add order with clock and worker dependencies. I’ll trace the state-changing path first, show where the result becomes durable, then test the design against the highest-risk failure and our target scale.”

08 · Retrieval check

Can you defend it without the page?

  1. For Unique ID generation, where is the correctness boundary and which failure would you test first?
  2. Which component owns committed truth, and what event or response proves the commit?
  3. Where is the first scaling or coordination bottleneck under the stated envelope?
  4. What happens after an ambiguous timeout or duplicate operation?
  5. Which complexity would you remove at one hundredth of the scale?