ulid
simpleflake
Our great sponsors
| ulid | simpleflake | |
|---|---|---|
| 4 | 1 | |
| 644 | 178 | |
| - | 0.0% | |
| 0.0 | 0.0 | |
| about 1 year ago | over 4 years ago | |
| Python | Python | |
| Apache License 2.0 | GNU General Public License v3.0 or later |
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
simpleflake
-
Sortable Collision-Free UUIDs
I've used something very similar in the past, called SimpleFlake[0], which is essentially a 64 bit version with the same principles. I've used it in Lisp, C, C++, Clojure, Python, and Rust. It's conceptually simple, and fits in a 64bit int, which is natively available in a lot of databases.
[0] SimpleFlake - https://github.com/SawdustSoftware/simpleflake/blob/f2b51f76...
What are some alternatives?
ksuid - K-Sortable Globally Unique IDs
uuid - Generate RFC-compliant UUIDs in JavaScript
python-ulid - ULID implementation for Python
tsid-creator - A Java library for generating Time-Sorted Unique Identifiers (TSID).
UUID - :snowflake: A PHP library for generating universally unique identifiers (UUIDs).
ksuid - Java implementation of K-Sortable Globally Unique IDs
EXREX - Irregular methods on regular expressions
spec - The canonical spec for ulid
xeger - Library to generate random strings from regular expressions.
spec - The Score Specification provides a developer-centric and platform-agnostic Workload specification to improve developer productivity and experience. It eliminates configuration inconsistencies between environments.