ulid
ksuid
Our great sponsors
ulid | ksuid | |
---|---|---|
11 | 38 | |
4,061 | 4,628 | |
1.8% | 2.6% | |
4.3 | 3.1 | |
15 days ago | 6 months ago | |
Go | Go | |
Apache License 2.0 | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
ulid
-
Type-safe, K-sortable, globally unique identifier inspired by Stripe IDs
There is no "tests".
There is just a single test. Which only tests the decoding of a single known value. No encoding test.
Go has infrastructure for benchmarking and fuzzing. Use it!
Also, you took code from https://github.com/oklog/ulid/blob/main/ulid.go which has "Copyright 2016 The Oklog Authors" but this is not mentionned in your base32.go.
-
cmackenzie1/go-uuid: library for generating version 4 (random) and version 7 (time-ordered) UUIDs
maybe because of dependencies: https://github.com/oklog/ulid/blob/main/go.mod ??
You can also have look at https://github.com/oklog/ulid for time ordering generated id purpose
- The most helpful Go Packages
-
UUIDs Are Bad for Database Index Performance, enter UUID7!
Universally Unique Lexicographically Sortable Identifier
-
Is it bad to use short (20 chars) random strings as primary keys?
I'm not concerned too much about the performance or the storage size at this stage. I've checked ulids before posting (more specifically https://github.com/oklog/ulid) but the only difference than a random string (especially if you use them with math.rand) is the timestamp prefix which makes them sortable, but I don't need that (users could use the internal SQLite rowid if they needed to sort by a primary key).
- UUIDs Are Popular, but Bad for Performance
-
Golang Base Project - A simple web app with user authentication
why are you using https://github.com/oklog/ulid to generate a cookie secret?
-
What are your favorite packages to use?
oklog/ulid to generate IDs. coreos/go-oidc for validating JWTs I get from auth. google/go-cmp for comparing structs in tests (unless the project is already using Testify). spf13/pflag because life's too short for Go's flag handling. getkin/kin-openapi for validating reqests/responses against my OpenAPI spec (in tests).
ksuid
-
Zero Downtime Postgres Upgrades
OP here - we avoid sequences in all but one part of our application due to a dependency. We use [KSUIDs][1] and UUID v4 in various places. This one "gotcha" applies to any sequence, so it's worth calling out as general advice when running a migration like this.
-
Bye Sequence, Hello UUIDv7
Feels like a spiritual successor to the ksuid [1] lib which I first heard of used in conjunction with DynamoD.
[1]: https://github.com/segmentio/ksuid which has very similar use cases.
UUID v4 isn't large enough to prevent collisions, that is why segment.io created https://github.com/segmentio/ksuid which is 160bit vs the 128bit of a UUIDv4.
UUIDv7 is a nice idea, and should probably be what people use by default instead of UUIDv4.
For the curious:
* UUIDv4 are 128 bits long, 122 bits of which are random, with 6 bits used for the version. Traditionally displayed as 32 hex characters with 4 dashes, so 36 alphanumeric characters, and compatible with anything that expects a UUID.
* UUIDv7 are 128 bits long, 48 bits encode a unix timestamp with millisecond precision, 6 bits are for the version, and 74 bits are random. You're expected to display them the same as other UUIDs, and should be compatible with basically anything that expects a UUID. (Would be a very odd system that parses a UUID and throws an error because it doesn't recognise v7, but I guess it could happen, in theory?)
* ULIDs (https://github.com/ulid/spec) are 128 bits long, 48 bits encode a unix timestamp with millisecond precision, 80 bits are random. You're expected to display them in Crockford's base32, so 26 alphanumeric characters. Compatible with almost everything that expects a UUID (since they're the right length). Spec has some dumb quirks if followed literally but thankfully they mostly don't hurt things.
* KSUIDs (https://github.com/segmentio/ksuid) are 160 bits long, 32 bits encode a timestamp with second precision and a custom epoch of May 13th, 2014, and 128 bits are random. You're expected to display them in base62, so 27 alphanumeric characters. Since they're a different length, they're not compatible with UUIDs.
I quite like KSUIDs; I think base62 is a smart choice. And while the timestamp portion is a trickier question, KSUIDs use 32 bits which, with second precision (more than good enough), means they won't overflow for well over a century. Whereas UUIDv7s use 48 bits, so even with millisecond precision (not needed) they won't overflow for something like 8000 years. We can argue whether 100 years us future proof enough (I'd argue it probably is), but 8000 years is just silly. Nobody will ever generate a compliant UUIDv7 with any of the first several bits aren't 0. The only downside to KSUIDs is the length isn't UUID compatible (and arguably, that they don't devote 6 bits to a compliant UUID version).
Still feels like there's room for improvement, but for now I think I'd always pick UUIDv7 over UUIDv4 unless there's an very specific reason not to.
- You Don't Need UUID
-
Type-safe, K-sortable, globally unique identifier inspired by Stripe IDs
Assuming you don't need to use UUIDv7 (or any UUID's) then https://github.com/segmentio/ksuid provides a much bigger keyspace. You could just append a string prefix if you wanted to namespace, but the chance of collisions of a KSUID is many times smaller than a UUID of any version.
Why use this instead of appending a string to https://github.com/segmentio/ksuid which has a much larger keyspace?
-
Unexpected downsides of UUID keys in PostgreSQL
If size isn't an issue it seems so. I know of one implementation that uses wall clock to get a "close enough" sorting https://github.com/segmentio/ksuid
KSUID's are have temporal-lexicographical order plus 128 bits of entropy, which is more than UUIDv4.
-
What Happened to UUIDv2?
Interesting in more history of UUIDs? Twilio Segment's blog has an amazing history lesson about how they came to be.
What are some alternatives?
nanoid - A tiny and fast Go unique string generator
ulid - Universally Unique Lexicographically Sortable Identifier (ULID) in Python 3
pg-ulid - ULID Functions for PostgreSQL
nanoid - A tiny (124 bytes), secure, URL-friendly, unique string ID generator for JavaScript
xid - xid is a globally unique id generator thought for the web
ulid-mssql - Implementation of ULID generator For Microsoft SQL Server
python-ksuid - A pure-Python KSUID implementation
uuid7 - UUID version 7, which are time-sortable (following the Peabody RFC4122 draft)
cuid - Collision-resistant ids optimized for horizontal scaling and performance.
Hasura - Blazing fast, instant realtime GraphQL APIs on your DB with fine grained access control, also trigger webhooks on database events.
sonyflake-rs - 🃏 A distributed unique ID generator inspired by Twitter's Snowflake.
gouid - Fast, dependable universally unique ids