https://github.com/ulid/spec
ulid() // 01ARZ3NDEKTSV4RRFFQ69G5FAV
- 128-bit compatibility with UUID 1.21e+24 unique ULIDs per millisecond Lexicographically sortable!
- Canonically encoded as a 26 character string, as opposed to the 36 character UUID
- Uses Crockford's base32 for better efficiency and readability (5 bits per character)
- Case insensitive No special characters (URL safe)
- Monotonic sort order (correctly detects and handles the same millisecond)
https://github.com/ulid/spec
ulid() // 01ARZ3NDEKTSV4RRFFQ69G5FAV
- 128-bit compatibility with UUID 1.21e+24 unique ULIDs per millisecond Lexicographically sortable!
- Canonically encoded as a 26 character string, as opposed to the 36 character UUID
- Uses Crockford's base32 for better efficiency and readability (5 bits per character)
- Case insensitive No special characters (URL safe)
- Monotonic sort order (correctly detects and handles the same millisecond)