UUID Generator produces v4, v7, and v8 UUIDs with monotonic sequence mode for sortable batches. Decode mode parses any UUID version and extracts embedded timestamps and clock sequences. Collision Analyzer calculates birthday-problem probability for any dataset size. Database Migration Helper outputs ready-to-paste DDL for PostgreSQL, MySQL, CockroachDB, DynamoDB, and SQLite.
UUID v7/v8 Generator
Generate, decode, and analyze UUIDs with collision analysis and DDL
How to use
- Choose mode — generate (produce UUIDs), decode (parse a UUID), or analyze-collisions (calculate probability + DDL).
- Pick version — v4 (random), v7 (time-ordered, recommended for DB PKs), or v8 (custom namespace).
- Set count — How many UUIDs to generate (1-100). Combined with sequenceMode for strict monotonic ordering.
- Enable annotation (optional) — Annotate decodes each generated v7 UUID back to its embedded timestamp.
- Decode or analyze — Decode mode accepts any UUID. Collision mode accepts existing UUIDs and target scale for probability + DDL.
MCP / API
Call uuid_generator directly from any MCP-compatible agent:
// MCP TypeScript SDK
const result = await client.callTool({
name: "uuid_generator",
arguments: {
"mode": "generate"
}
});
// curl
curl -X POST https://obfus.link/mcp \
-H "Authorization: Bearer <SPT>" \
-H "Content-Type: application/json" \
-d '{"method":"tools/call","params":{"name":"uuid_generator","arguments":{"mode":"generate"}}}'Related tools
FAQ
Why use v7 instead of v4?
v7 UUIDs embed a timestamp in the high bits, making them naturally sortable by creation time. This dramatically improves database insert performance on B-tree indexes (no random seeks) and enables time-range queries on the PK directly. v4 is purely random and causes index fragmentation in append-heavy workloads.
What does Decode return for a v1 UUID?
For v1 (and v6, v7): version, variant, embedded timestamp (with ms precision and ISO time), clock sequence, and node ID. Plus byte-level malformation checks. For v3, v4, v5, v8: only version, variant, and structural validation are returned.
How does the birthday-problem collision probability work?
For a random 122-bit UUID and N rows, the probability of at least one collision is approximately N^2 / (2 * 2^122). The analyzer computes this for your target scale and returns a human-readable form ("1 in 2.71 × 10^18"). For v7 the math is similar but the time-ordering reduces effective entropy slightly.
What is monotonic sequence mode?
When sequenceMode is true and you generate multiple UUIDs in the same call, the sequence bits increment within the same millisecond — guaranteeing strict sort order across the batch. Critical for databases that depend on UUID v7 sort order for query performance.
Can I use this tool via the MCP API?
Yes. The tool is registered on the obfus.link MCP server at https://obfus.link/mcp. Call it from any MCP-compatible agent with a Shared Payment Token. The MCP tool name matches the snake_case slug shown in the integration snippet.