ulid
prototypes
| ulid | prototypes | |
|---|---|---|
| 4 | 2 | |
| 644 | 45 | |
| - | - | |
| 0.0 | 6.0 | |
| about 1 year ago | 6 months ago | |
| Python | Python | |
| Apache License 2.0 | - |
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
-
Plan B for UUIDs: double AES-128
I really like ULID for this problem (e.g: https://github.com/ahawker/ulid)
- same number of bytes as UUID
- start with a date, so has great locality. Plus you get extra information in the uid that you can extract.
- can be created from an existing date or uuid, and exported to a uuid, so there is a migration path
-
New UUID Formats from IETF
As the author of a popular ULID implementation in python[1], the spec has no stewardship anymore. The specification repo[2] has plenty of open issues and no real guidance or communication beyond language implementation authors discussing corner cases. The monotonic functionality is ambiguous (at best) and is implemented differently per-languages [3].
Functionality, UUIDv7 might be the _same_ but the hope would be for a more rigid specification for interoperability.
[1]: https://github.com/ahawker/ulid
[2]: https://github.com/ulid/spec
[3]: https://github.com/ulid/spec/issues/11
-
Sortable Collision-Free UUIDs
Looks similar to ULID[0] (I am the author of a popular python implementation[1]).
It appears to have a similar constraint that two ID's generated within the same timestamp (ms, ns) have no strong guarantee of ordering. That might not be a deal breaker depending on your use case but something to consider.
* https://github.com/ulid/spec
* https://github.com/ahawker/ulid
- Usando ULIDs para criar ordem em dados não ordenados
prototypes
-
New UUID Formats from IETF
Nice to see another implementation which takes a bit different approach. Just for your information, there's now Draft 03 which changes the format a little bit. I kinda liked the arbitrary precision of Draft 02, but the newer one just requires millisecond precision and then basically leaves it up to the implementation how to handle the generation of multiple UUIDs within the same millisecond.
https://github.com/uuid6/prototypes/issues/21
What are some alternatives?
ksuid - K-Sortable Globally Unique IDs
Hashids.java - Hashids algorithm v1.0.0 implementation in Java
python-ulid - ULID implementation for Python
dart-uuid - Generate RFC4122(v1,v4,v5,v6,v7,v8) UUIDs
uuid - Generate RFC-compliant UUIDs in JavaScript
uuid7 - UUID version 7, which are time-sortable (following the Peabody RFC4122 draft)
UUID - :snowflake: A PHP library for generating universally unique identifiers (UUIDs).
vanity-uuid - Create "readable" UUIDs such as "5eedbed5-f05e-b055-ada0-d15ab11171e5" for all your UUID needs!
EXREX - Irregular methods on regular expressions
brain - Swyx's second brain!
xeger - Library to generate random strings from regular expressions.
uuid6-python - New time-based UUID formats which are suited for use as a database key