rust-ksuid VS js-id

We maintain a couple of popular ksuid libraries[1][2] and use it, so we definitely like ksuid. Though one big issue with ksuid is that being 160bit means that it doesn't fit into native uuid types in databases (e.g. postgres), which means that they come with a performance penalty.

1: https://github.com/svix/rust-ksuid

I wasn't going to post it here because it feels a bit small for a show HN, but then I figured: why not. :)

It's a pure Rust implementation of Segement's KSUID, and I created this library while working on Svix[0].

I haven't written any Rust for a while, so even though I have written quite a bit of Rust code in the past (see Etebase[1]), I'm a bit rusty (no pun intended).

Anyhow, I just wanted to share, and I'm hoping to get some feedback if you have any. :)

Code and examples: https://github.com/svix/rust-ksuid/

P.S, the package is tested for compatibility against the reference Go implementation.

[0] https://www.svix.com

Code and examples: https://github.com/svix/rust-ksuid/

We have a uuidv7 implementation that we've been using with rocksdb for over a year https://github.com/matrixai/js-id

We evaluated ULID but we wanted something that is future proof for our decentralised secret sharing system. So we implemented UUIDv7 in TypeScript called `IdSortable` https://github.com/MatrixAI/js-id

It allows strict monotonic IDs when you provide it the previously generated ID. The resulting data structure is a Uint8Array making it easy to put into binary structures. Can also be used as a key inside any POJO record.

I had reviewed existing UUIDv7 implementations and many were incorrect or had subtle timing bugs.

We ended up implementing UUIDv7 in our ID generation library https://github.com/MatrixAI/js-id. And we have a number of tests ensuring that it is truly monotonic even across process restarts.

See IdSortable.