Event streams and logs
Assign ULIDs to events so you can sort or page through activity across shards without rebuilding ordered indexes.
Generate lexicographically sortable ULIDs.
ULID
Run the tool to see the result here
Overview
ULID Forge creates ULIDs that combine millisecond timestamps with Crockford Base32 entropy. The result stays sortable by creation time while retaining enough randomness for distributed workloads.
Use Cases
Queue or job identifiers
Use ULIDs for background job IDs to combine chronological ordering with uniqueness, simplifying deduplication and monitoring dashboards.
Edge storage keys
Generate ULIDs for KV or object storage keys to maintain natural ordering at the edge, reducing cold-start scans when syncing data.
How to Use
Request a new ULID
Hit “Generate” to produce a fresh ULID. Each identifier encodes the current timestamp and a 80-bit random component.
Copy to clipboard
Copy the result directly into scripts, queue payloads, or API requests. The Crockford alphabet avoids ambiguous characters for easier manual sharing.
Repeat for additional IDs
Run the generator again whenever you need more ULIDs. Consecutive runs are still globally unique even when executed within the same millisecond.
Frequently Asked Questions
How do ULIDs differ from UUIDs?
ULIDs remain lexicographically sortable because the timestamp lives in the most significant bits, whereas typical UUIDs (v4) are entirely random.
Will ULIDs collide under heavy load?
The chance is extremely low thanks to the 80 bits of randomness. If you mint multiple IDs in the same millisecond, implementations usually increment the random portion to preserve order.
Are ULIDs URL-safe?
Yes. They use Crockford Base32, which avoids punctuation and ambiguous characters, making them safe for URLs and filenames.