Almost Sortable Unique IDs

Similar idea to the ksuid, but uses a larger timestamp for millisecond resolution. Copy-paste friendly, 35 chars long, and lexicographical sorting of the ids will sort them by time, but if multiple asuids are generated in the same millisecond (or using the same timestamp) then the random bytes will prevent ordering them in perfect generated order (hence, almost sortable).

Format

| 56 bit timestamp | 120 bit id |

The 56 bit timestamp allows for values in the range [-8640000000000000, 8640000000000000] with millisecond precision. This allows any valid JS date to become a valid asuid, including dates in the past (for assigning ids to older records).

Installation

pnpm add @labyrinthos/asuid

Usage

import asuid from "@labyrinthos/asuid"

//  generate fully random asuid
asuid()

//  generate random id for a timestamp (or date)
asuid(timeStamp)
asuid(new Date(timeStamp))
asuid(BigInt(timeStamp))

//  generate asuid for current time with set id bytes
asuid(null, uint8Array)
asuid(null, idString)

//  regenerate id from parts
asuid(timeStamp, uint8Array)
asuid(timeStamp, idString)

Parsing

import asuid from "@labyrinthos/asuid"

const parsed = asuid.parse(id)
{
    // timestamp for the asuid
    time
    // date object from the timestamp
    date
    // the id string (last 15 bytes/24 characters)
    id
    // the asuid that was parsed
    source
}