Generate 128-bit unique identifiers for various specifications. In particular: - ULID - Monotonic ULID - UUID 1 (Variant 1 Version 1) - UUID 4 (Variant 1 Version 4) - UUID 6 (Variant 1 Version 6) - Nil UUID (Variant 0 Version 0) - Uuid (Unknown Variant and Version)
const {
Ulid,
UlidMonotonic,
Uuid,
Uuid1,
Uuid4,
Uuid6,
UuidNil,
idCompare,
idEqual,
} = require('id128');
// Id factories
[
Ulid,
UlidMonotonic,
Uuid1,
Uuid4,
Uuid6,
UuidNil,
].forEach((IdType) => {
// Identify the factory
console.log(IdType.name);
// Generate a new id
const id = IdType.generate();
// Get the smallest valid id
const min = IdType.MIN();
// Get the largest valid id
const max = IdType.MAX();
// Type-check the id
console.log(id instanceof IdType.type)
// Compare ids
console.log(id.equal(id));
console.log(! id.equal(min));
console.log(! id.equal(max));
console.log(id.compare(min) === 1);
console.log(id.compare(id) === 0);
console.log(id.compare(max) === -1);
// Encode the id in its canonical form
const canonical = id.toCanonical();
console.log(canonical);
// Encode the id for efficient db storage
const raw = id.toRaw();
console.log(raw);
// Verify a canonically formatted id
console.log(IdType.isCanonical(canonical));
// Decode a valid canonically formatted id
console.log(id.equal(IdType.fromCanonical(canonical)));
// Decode a canonically formatted id, skipping validation
console.log(id.equal(IdType.fromCanonicalTrusted(canonical)));
// Verify a raw formatted id
console.log(IdType.isRaw(raw));
// Decode a valid raw formatted id
console.log(id.equal(IdType.fromRaw(raw)));
// Decode a raw formatted id, skipping validation
console.log(id.equal(IdType.fromRawTrusted(raw)));
});
// Uuid Factory
[0, 1, 4, 6].forEach((version) => {
// Generate a new id
const id = Uuid.generate({ version });
// Get the smallest valid id
const min = Uuid.MIN({ version });
// Get the largest valid id
const max = Uuid.MAX({ version });
// Type-check the id
console.log(id instanceof Uuid.type)
// Encode the id in its canonical form
const canonical = id.toCanonical();
console.log(canonical);
// Encode the id for efficient db storage
const raw = id.toRaw();
console.log(raw);
// Decode a valid canonically formatted id
console.log(id.equal(Uuid.fromCanonical(canonical)));
// Decode a canonically formatted id, skipping validation
console.log(id.equal(Uuid.fromCanonicalTrusted(canonical)));
// Decode a valid raw formatted id
console.log(id.equal(Uuid.fromRaw(raw)));
// Decode a raw formatted id, skipping validation
console.log(id.equal(Uuid.fromRawTrusted(raw)));
});
// Static Utilities
// Equate arbitrary ids
console.log(idEqual(Ulid.generate(), Uuid4.generate()))
// Compare arbitrary ids
console.log(idCompare(Ulid.generate(), Uuid4.generate()))
Return the name of the generated id type.
Return the type of the generated id instances for type-checking
with the instanceof operator.
Return a new id instance without validating the bytes.
Return a new id instance.
Return the id instance with the smallest valid value.
Return the id instance with the largest valid value.
Decode an id from its canonical representation.
Throw InvalidEncoding if the string is undecodable.
Decode an id from its canonical representation. Skip validation and assume the input is decodable.
Decode an id from its raw representation.
Throw InvalidEncoding if the string is undecodable.
Decode an id from its raw representation. Skip validation and assume the input is decodable.
Encode the given id in the canonical form.
Throw InvalidBytes if the id is not 128-bit conformant.
Encode the given id in the raw form.
Throw InvalidBytes if the id is not 128-bit conformant.
Verify if a string is a valid canonical encoding.
Verify if a string is a valid raw encoding.
Return the actual byte array representing the id.
Return a new instance of the id with the same bit signature.
Determine how this id is ordered against another.
Determine if this id has the same bytes as another.
Encode this id in its canonical form.
Encode this id in its raw form.
Determine if the left id is less than | equal to | greater than
the right id using lexicographical byte order.
Determine if 2 ids have the same byte value.
const { Ulid } = require('id128');
Ulid, as specified, has some nice properties: - collision resistant: 80-bits of randomness - k-ordered: prefixed with millisecond precision timestamp - database friendly: fits within a uuid and generally appends to the index - human friendly: canonically encodes as a case-insensitive Crockford 32 number
It is useful when you need a distributed domain unique id.
Return a Date object for the epoch milliseconds encoded in the id.
Return a new id instance. Set any argument to null or undefined to trigger
its default behavior.
time defaults to the current time. It can be given either as a Date object
or epoch milliseconds (milliseconds since January 1st, 1970).
Throw InvalidEpoch for times before the epoch or after approximately August 2nd, 10889.
This is provided mostly for unit tests.
Format tttt tttt tttt rrrr rrrr rrrr rrrr rrrr where:
- t is 4 bits of time
- r is 4 bits of random
const { UlidMonotonic } = require('id128');
UlidMonotonic is inspired by the specification: - collision resistant: 15-bits of random seeded clock sequence plus 64-bits of randomness - total ordered: prefixed with millisecond precision timestamp plus 15-bit clock sequence - database friendly: fits within a uuid and generally appends to the index - human friendly: canonically encodes as a case-insensitive Crockford 32 number
It is useful when you need to guarantee a process unique id.
Return a Date object for the epoch milliseconds encoded in the id.
Return a new id instance. Set any argument to null or undefined to trigger
its default behavior.
time defaults to the current time. It can be given either as a Date object
or epoch milliseconds (milliseconds since January 1st, 1970). Extra caution is
required since setting a future time and subsequently calling generate
guarantees usage of the clock sequence.
Throw InvalidEpoch for times before the epoch or after approximately August 2nd, 10889.
Throw ClockSequenceOverflow when the clock sequence is exhausted.
This is provided mostly for unit tests.
Return the clock sequence to its starting position. This is provided mostly for unit tests.
Format tttt tttt tttt cccc rrrr rrrr rrrr rrrr where:
- t is 4 bits of time
- c is 4 bits of random-seeded clock sequence
- r is 4 bits of random
More specifically, the clock sequence is a counter. When the first id for a new timestamp is generated, the clock sequence is seeded with random bits and the left-most clock sequence bit is set to 0, reserving 2^15 clock ticks. Whenever a time from the past seeds the generator, the previous id's time and clock sequence are used instead, with the clock sequence incremented by 1. This guarantees strict local monotonicity and preserves lexical ordering and general randomness.
Without a seeded time, UlidMonotonic is unlikely to exceed the clock sequence (the clock sequence supports generating a new id every 31 nanoseconds). However, in the unlikely event of an overflow, id generation is aborted.
const { Uuid1 } = require('id128');
Uuid1 implements the RFC 4122 time specification: - time-based: encodes the current millisecond timestamp - location-based: encodes the mac address of the machine
While this mostly adheres to the spec, there are a few nuances in the handling of time. Instead of encoding time as 100-nanoseconds since the Gregorian epoch, 48 bits encode milliseconds since the Gregorian epoch time and 12 bits count past time collisions, resetting whenever given a new future time. There are a few benefits: - high precision time is unreliable in the browser so this ensures better precision - the max supported date is now around the year 10502 instead of around 5236 - generating 4096 ids/ms (~4,000,000 ids/s) is wildly unlikely in real world uses - in the rare hi-res overflow, the count simply spills over to the clock sequence
Return the clock sequence encoded in the id.
Return the number of prior ids generated while time stood still.
Return the MAC address encoded in the id.
Return a Date object for the epoch milliseconds encoded in the id.
Return the variant as encoded in the id. Should be 1.
Return the version as encoded in the id. Should be 1.
Return a new id instance. Set any argument to null or undefined to trigger
its default behavior.
time defaults to the current time. It can be given either as a Date object
or Gregorian milliseconds (milliseconds since October 15th, 1582). Extra caution
is required since setting a future time and subsequently calling generate
guarantees usage of the hi-res counter and clock sequence.
Throw InvalidEpoch for times before the Gregorian epoch or after approximately May 17, 10502.
This is provided mostly for unit tests.
node defaults to the MAC address, or a random multicast address when the MAC
address is unavailable. It can be given as an array of 6 bytes.
Return the hi-res counter to its starting position and generate a new random clock sequence seed. This is provided mostly for unit tests.
Format llll lnnn mmmm vhhh tccc aaaa aaaa aaaa where:
- l is 4 bits of low millisecond time
- n is 4 bits of hi-res time
- m is 4 bits of mid millisecond time
- v is 4 bits of the version
- h is 4 bits of high millisecond time
- t is 2 bits of the variant followed by 2 bits of the clock sequence
- c is 4 bits of the clock sequence
- a is 4 bits of the machine address
const { Uuid4 } = require('id128');
Uuid4 implements the RFC 4122 random uuid specification:
It is useful when you need a well-supported globally unique id.
Return the variant as encoded in the id. Should be 1.
Return the version as encoded in the id. Should be 4.
Format rrrr rrrr rrrr vrrr trrr rrrr rrrr rrrr where:
- r is 4 bits of random
- v is 4 bits of the version
- t is 2 bits of the variant followed by 2 bits of random
const { Uuid6 } = require('id128');
Uuid6 implements this controversial blog post: - time-based: encodes the current millisecond timestamp - location-based: encodes the mac address of the machine
This is essentially the same implementation as Uuid1, however the time bits are arranged in lexicographical order. If you're looking for a spacial UUID that is optimized for clustered indices, consider Uuid6 as a viable option.
Return the clock sequence encoded in the id.
Return the number of prior ids generated while time stood still.
Return the MAC address encoded in the id.
Return a Date object for the epoch milliseconds encoded in the id.
Return the variant as encoded in the id. Should be 1.
Return the version as encoded in the id. Should be 6.
Return a new id instance. Set any argument to null or undefined to trigger
its default behavior.
time defaults to the current time. It can be given either as a Date object
or Gregorian milliseconds (milliseconds since October 15th, 1582). Extra caution
is required since setting a future time and subsequently calling generate
guarantees usage of the hi-res counter and clock sequence.
Throw InvalidEpoch for times before the Gregorian epoch or after approximately May 17, 10502.
This is provided mostly for unit tests.
node defaults to the MAC address, or a random multicast address when the MAC
address is unavailable. It can be given as an array of 6 bytes.
Return the hi-res counter to its starting position and generate a new random clock sequence seed. This is provided mostly for unit tests.
Format mmmm mmmm mmmm vnnn tccc aaaa aaaa aaaa where:
- m is 4 bits of millisecond time
- v is 4 bits of the
$ claude mcp add id128 \
-- python -m otcore.mcp_server <graph>