ULID Generator

Generate ULIDs — unique IDs that sort by creation time. Choose how many you need, from one to ten thousand, and get 26-character, URL-safe identifiers that stay in order even when made in the same millisecond. Copy or download them, or paste a ULID to see when it was created. It's free, uses your browser's secure random generator, and nothing is sent anywhere.

ULID layout

PartBitsCharacters
Timestamp (ms)4810
Randomness8016
Total12826

When to use it

  1. Create primary keys that keep a database index ordered.
  2. Generate sortable IDs for log entries or events.
  3. Seed test data with realistic, time-ordered IDs.
  4. Find out when a ULID in your data was created.

How to Use

  1. Set how many ULIDs you need.
  2. Choose lowercase if you prefer.
  3. Copy or download them.
  4. Paste a ULID in the decoder to read its time.

Features

  1. Up to 10,000 at once
  2. Monotonic ordering within a millisecond
  3. Cryptographic randomness
  4. Timestamp decoding
  5. Copy and download
  6. 100% client-side

FAQs

What is a ULID?

A Universally Unique Lexicographically Sortable Identifier: 26 characters, a millisecond timestamp followed by 80 random bits, sortable as text.

ULID or UUID?

ULIDs sort by time and are shorter in text form. UUID v7 offers the same ordering in standard UUID format — choose whichever your tools support.

Are ULIDs generated in the same millisecond in order?

Yes. In monotonic mode each one increments the last, so a batch is strictly sorted.

Can someone tell when a ULID was made?

Yes, the timestamp is readable — don't use ULIDs where creation time should stay private.

Is anything uploaded?

No. IDs are generated in your browser.

Technical Details

A ULID packs a 48-bit Unix timestamp in milliseconds and 80 bits of randomness into 26 characters of Crockford Base32, an alphabet that leaves out I, L, O and U so IDs can't be misread and are case-insensitive. Because the timestamp comes first, ULIDs sort in creation order as plain strings — which matters for database indexes, where random UUIDs scatter inserts across the index. When several are made within the same millisecond, sorting needs more than the timestamp, so the generator uses the specification's monotonic mode: instead of drawing fresh randomness, it increments the previous random component by one. A bulk run of thousands is therefore strictly ordered. Randomness comes from crypto.getRandomValues. The decoder reads a ULID back to its creation time, folding the characters Crockford treats as look-alikes (I and L to 1, O to 0) and rejecting a first character above 7, which would overflow 48 bits.

Developer Tools

Developer Tools

  • SemVer Compare
  • Bitwise Calculator
  • MIME Type Lookup
  • Luhn Validator
  • IBAN, ISBN & Barcode Validator
  • SSL Certificate Decoder
  • HAR File Viewer
  • OpenAPI & Swagger Viewer