ulid {ulid}R Documentation

Generate Universally Unique Lexicographically Sortable Identifiers

Description

(grifted from https://github.com/ulid/spec)

Details

UUID can be suboptimal for many uses-cases because:

Instead, herein is proposed ULID:

ulid() // 01ARZ3NDEKTSV4RRFFQ69G5FAV
01AN4Z07BY      79KA1307SR9X4MV3

|----------|    |----------------|
  Timestamp          Randomness
   48bits              80bits

Components

Timestamp

Randomness

Sorting

The left-most character must be sorted first, and the right-most character sorted last (lexical order). The default ASCII character set must be used. Within the same millisecond, sort order is not guaranteed.

Author(s)

Bob Rudis (bob@rud.is)


[Package ulid version 0.3.0 Index]