https://crates.io/crates/libxid
(This is a port of [Olivier Poitrey]'s [xid] Go library)
Package xid is a globally unique id generator library, ready to be used safely directly in your server code.
Xid is using Mongo Object ID algorithm to generate globally unique ids with a different serialization (base64) to make it shorter when transported as a string:
https://docs.mongodb.org/manual/reference/object-id/
- 4-byte value representing the seconds since the Unix epoch,
- 3-byte machine identifier,
- 2-byte process id, and
- 3-byte counter, starting with a random value.
The binary representation of the id is compatible with Mongo 12 bytes Object IDs.
The string representation is using base32 hex (w/o padding) for better space efficiency
when stored in that form (20 bytes). The hex variant of base32 is used to retain the
sortable property of the id.
Xid doesn't use base64 because case sensitivity and the 2 non alphanum chars may be an
issue when transported as a string between various systems. Base36 wasn't retained either
because 1/ it's not standard 2/ the resulting size is not predictable (not bit aligned)
and 3/ it would not remain sortable. To validate a base32 `xid`, expect a 20 chars long,
all lowercase sequence of `a` to `v` letters and `0` to `9` numbers (`[0-9a-v]{20}`).
UUIDs are 16 bytes (128 bits) and 36 chars as string representation. Twitter Snowflake
ids are 8 bytes (64 bits) but require machine/data-center configuration and/or central
generator servers. xid stands in between with 12 bytes (96 bits) and a more compact
URL-safe string representation (20 chars). No configuration or central generator server
is required so it can be used directly in server's code.
| [UUID] | 16 bytes | 36 chars | configuration free, not sortable
| [shortuuid] | 16 bytes | 22 chars | configuration free, not sortable
| [Snowflake] | 8 bytes | up to 20 chars | needs machin/DC configuration, needs central server, sortable
| [MongoID] | 12 bytes | 24 chars | configuration free, sortable
| xid | 12 bytes | 20 chars | configuration free, sortable
[UUID]: https://en.wikipedia.org/wiki/Universally_unique_identifier
[shortuuid]: https://github.com/stochastic-technologies/shortuuid
[Snowflake]: https://blog.twitter.com/2010/announcing-snowflake
[MongoID]: https://docs.mongodb.org/manual/reference/object-id/
Features:
- Size: 12 bytes (96 bits), smaller than UUID, larger than snowflake
- Base32 hex encoded by default (20 chars when transported as printable string, still sortable)
- Non configured, you don't need set a unique machine and/or data center id
- K-ordered
- Embedded time with 1 second precision
- Unicity guaranteed for 16,777,216 (24 bits) unique ids per second and per host/process
- Lock-free (i.e.: unlike UUIDv1 and v2)
Notes:
- Xid is dependent on the system time, a monotonic counter and so is not cryptographically secure.
If unpredictability of IDs is important, you should NOT use xids.
It is worth noting that most of the other UUID like implementations are also not cryptographically secure.
You shoud use libraries that rely on cryptographically secure sources if you want a truly random ID generator.
References:
- https://www.slideshare.net/davegardnerisme/unique-id-generation-in-distributed-systems
- https://en.wikipedia.org/wiki/Universally_unique_identifier
- https://blog.twitter.com/2010/announcing-snowflake
## Usage
```rust
use libxid;
// initialize it once, reuse it afterwards
let mut g = libxid::new_generator();
for i in 0..10{
let id = g.new_id().unwrap();
println!(
"encoded: {:?} machine: {:?} counter: {:?} time: {:?}",
id.encode(),
id.machine(),
id.counter(),
id.time()
);
}
```
### Performance
Currently `libxid` can:
- generate 1 million unique ids in less than 0.5 seconds (without encoding)
- encode 1 million unique ids in around 1.5 seconds
- decode 1 million unique ids in less than 0.5 seconds
You can try to reproduce these numbers by yourself by running `cargo test _speed`
which will launch all speed related tests.
[Olivier Poitrey]: https://github.com/rs
[xid]: https://github.com/rs/xid