oklog/ulid
Universally Unique Lexicographically Sortable Identifier (ULID) in Go observed · 2026-08-28
Health v2 · maintenance only
84/100
- Activity 94
- Release rhythm 62
- Longevity 100
How is this computed?
round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10) — computed 2026-09-03. Adoption (stars, forks) is never an input.
- gap_med: 427
- age_days: 3557
- days_rel: 41
- days_push: 41
- n_releases_24m: 2
Adoption not part of the score
5051 stars · 192 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-29, confidence not recorded
A Go library implementing ULID (Universally Unique Lexicographically Sortable Identifier), a 128-bit identifier that is lexicographically sortable and encoded as a 26-character Crockford base32 string. It supports monotonic generation within the same millisecond and flexible entropy sources.
Use cases
- generate sortable unique ids for database primary keys
- replace uuids with lexicographically sortable identifiers
- generate monotonic ids within the same millisecond
- create url-safe case-insensitive identifiers
- generate ids compatible with uuid size but more compact
When to choose
- you need ids that sort chronologically in databases or files
- you want a compact, url-safe alternative to uuids
- you need monotonic id generation in Go
When to avoid
- you need standard uuids for interoperability with existing systems
- you are not working in Go
- you need ids with embedded randomness only and no timestamp
Facets
library · maturity stable
serialization developer-tools developer-tools databases backend go cross-platform ulid unique-identifiers sortable-ids uuid-alternative base32
1 source
- readme: https://github.com/oklog/ulid · fetched 2026-08-28 · cac811641635
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| oklog/ulid | main | 84 |
For agents
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem