spec | brain | |
---|---|---|
62 | 9 | |
8,648 | 1,530 | |
1.4% | - | |
0.0 | 7.2 | |
4 months ago | 19 days ago | |
JavaScript | ||
GNU General Public License v3.0 only | 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.
spec
-
The UX of UUIDs
Can use ULID to "fix" some issues
https://github.com/ulid/spec
- Ulid: Universally Unique Lexicographically Sortable Identifier
-
Ask HN: Is it acceptable to use a date as a primary key for a table in Postgres?
Both ULID and UUID v7 have a time code component which can be extracted.
It would be best for indexing to store the actual value in binary, though not strictly necessary as these later UUID standards (unlike conventional UUIDs) use time code prefixes (so indexing clusters.)
https://uuid7.com/
https://github.com/ulid/spec
-
Bye Sequence, Hello UUIDv7
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.
-
50 years later, is Two-Phase Locking the best we can do?
I'd love for Postgres to adopt ULID as a first class variant of the same basic 128bit wide binary optimized column type they use for UUIDs, but I don't expect they will, while its "popular" its not likely popular enough to have support for them to maintain it in the long run... Also the smart money ahead of time would have been for the ULID spec to sacrifice a few data bits to leave the version specifying sections of the bit field layout unused in the ULID binary spec (https://github.com/ulid/spec#binary-layout-and-byte-order) for the sake of future compatibility with "proper" UUIDs... Performing one big bulk bitfield modification to a PostgreSQL column would have been much less painful than re-computing appropriate UUIDv7 (or UUIDv8s for some reason) and then having to perform a primary key update on every row in the table.
- FLaNK Stack Weekly for 12 September 2023
- You Don't Need UUID
- UUID Collision
-
Type-safe, K-sortable, globally unique identifier inspired by Stripe IDs
Many people had the same idea. For example ULID https://github.com/ulid/spec is more compact and stores the time so it is lexically ordered.
- ULID: Universally Unique Lexicographically Sortable Identifier
brain
- The UX of UUIDs
-
Type-safe, K-sortable, globally unique identifier inspired by Stripe IDs
for those researching this topic, I keep a list of these UUID/GUID implementations!
https://github.com/swyxio/brain/blob/master/R%20-%20Dev%20No...
-
Things I did before app launch and what I wish I have done
here are my notes as someone who studied this stuff extensively for my book launch (just crossed $200k revenue) https://github.com/sw-yx/brain/blob/906dbc6fd6d22fa69968ebc6...
in generally for OP's stuff i would disagree on launching on product hunt first. PH is a giant pyramid scheme where people just compete for the #1 badge each day. what the most successful products do is launch everywhere else first, and then after a few months email their happy customers to support them on PH. this is why you are #20 because you didnt study the game
- Digital Gardening
- UUID list: list of unique id implementations, concepts, and resources
-
Plan B for UUIDs: double AES-128
I've been collecting all my notes on UUIDs here https://github.com/sw-yx/brain/blob/master/R%20-%20Dev%20Not... in case it is helpful to anyone
-
New UUID Formats from IETF
(poster here)
these formats are not new new, but are still pretty new.
the context is i keep a list of uuid impls and knowledge for my own reference. posted this up today simply because I got a PR from some subscribers https://github.com/sw-yx/brain/pull/36
- A second brain in the wild
-
Bottom-Up Idea Exploration
Putting together this massive effort involved pulling in notes from 18 months of covering Concurrent React by myself, in particular studying prior art from Rodrigo Pombo in cloning the API from scratch. You can check out his talk here to contrast what he did vs me.
What are some alternatives?
dynamodb-onetable - DynamoDB access and management for one table designs with NodeJS
Synaptic.js - architecture-free neural network library for node.js and the browser
uuid6-ietf-draft - Next Generation UUID Formats
natural - general natural language facilities for node
kuuid - K-sortable UUID - roughly time-sortable unique id generator
typeid - Type-safe, K-sortable, globally unique identifier inspired by Stripe IDs
python-ksuid - A pure-Python KSUID implementation
deeplearn.js
ulid-lite - Generate unique, yet sortable identifiers
ConvNetJS - Deep Learning in Javascript. Train Convolutional Neural Networks (or ordinary ones) in your browser.
shortuuid.rb - Convert UUIDs & numbers into space efficient and URL-safe Base62 strings, or any other alphabet.
typeid-go - Go implementation of TypeIDs: type-safe, K-sortable, and globally unique identifiers inspired by Stripe IDs