sparkid
Fast, monotonic, time-sortable, 22-char Base58 unique ID generator. Only dependency is rand.
1ocmpHE1bFnygEBAPTzMK4
1ocmpHE1bFnygFv4Wp4dL2
1ocmpHE1bFnygGoUXUL7Xo
Install
Usage
use SparkId;
let id = new;
// => "1ocmpHE1bFnygEBAPTzMK4"
println!; // Display, no heap allocation
let s: &str = &id; // Deref to &str, zero-cost
let owned: String = id.into; // Into<String> when needed
Properties
| Property | Value |
|---|---|
| Length | 22 characters, fixed |
| Alphabet | Base58 (no 0, O, I, l) |
| Sortable | Lexicographically, by creation time |
| Monotonic | Strictly increasing within each thread |
| URL-safe | Yes |
| Collision resistance | ~5814 (~1.8 x 1024) combinations per millisecond |
| Randomness | Cryptographically secure (rand / ChaCha12, seeded from OS) |
| Thread-safe | Yes (via thread_local!) |
How it works
Each ID is composed of two parts:
[8-char timestamp][14-char suffix]
- Timestamp (8 chars): Current time in milliseconds, Base58-encoded. IDs generated in a later millisecond always sort after earlier ones.
- Suffix (14 chars): Seeded from a cryptographically secure PRNG (rejection-sampled, no modulo bias) at the start of each millisecond, then monotonically incremented for each subsequent ID within that millisecond. This guarantees strict ordering even when multiple IDs share a timestamp.
SparkId type
SparkId is a stack-allocated, Copy type — no heap allocation on creation. It implements Deref<Target = str>, Display, Ord, Hash, and Into<String>, so it works anywhere a string is expected.
use SparkId;
let a = new;
let b = new;
assert!; // Ord — monotonically increasing
println!; // Display — no allocation
let set: HashSet = .into; // Hash
Ordering guarantees
IDs from a single IdGenerator instance (or a single thread using SparkId::new()) are strictly monotonically increasing — every ID is lexicographically greater than the one before it.
Across threads, IDs are unique but not ordered relative to each other. Each thread gets its own generator via thread_local!, so there is no cross-thread coordination.
If you need process-wide monotonic ordering across threads, wrap a single IdGenerator in a Mutex:
use ;
use IdGenerator;
static GEN: =
new;
Advanced usage
For manual control, use the IdGenerator struct directly:
use IdGenerator;
let mut gen = new;
let id = gen.next_id;
IdGenerator also implements Iterator<Item = SparkId>:
let mut gen = new;
let ids: = gen.take.collect;
Performance
~27 million IDs/sec with SparkId::new() (~37 ns/call, zero-allocation):
License
MIT