#base32 #identifier #codec #values #numeric #decoding


Provides Crockford Base32 encoding for identifiers (e.g. u64 values).

11 releases (7 stable)

1.2.1 Nov 18, 2023
1.1.2 May 8, 2023
1.1.0 Feb 1, 2021
1.0.1 Jan 6, 2018
0.1.0 May 24, 2017

#260 in Encoding

Download history 117/week @ 2023-12-15 6/week @ 2023-12-22 59/week @ 2023-12-29 127/week @ 2024-01-05 237/week @ 2024-01-12 121/week @ 2024-01-19 86/week @ 2024-01-26 42/week @ 2024-02-02 100/week @ 2024-02-09 93/week @ 2024-02-16 128/week @ 2024-02-23 168/week @ 2024-03-01 186/week @ 2024-03-08 134/week @ 2024-03-15 75/week @ 2024-03-22 104/week @ 2024-03-29

527 downloads per month
Used in 3 crates


266 lines


Base32 encoding for 64-bit values.

Crockford Base32 Encoding is most commonly used to make numeric identifiers slightly more user-resistant. Similar to Hashids, the purpose here is to make the identifiers shorter and less confusing. Unlike Hashids, Crockford Base32 does nothing to conceal the real value of the number (beyond the actual encoding, anyway) and the fact that they are sequential is still pretty obvious when you see consecutive identifiers side by side.

This library does not support encoding and decoding of arbitrary data; there is another library for that. Additionally, the spec supports the idea of check digits, but this library currently does not.

The primary purpose of this library is to provide high performance, user-resistant encoding of numeric identifiers. To that end, both encoding and decoding are, in fact, pretty darn fast. How fast? According to my testing, crockford decodes fifty times faster and encodes twenty-seven times faster than harsh.



Encoding is a one-step process.

let x = crockford::encode(5111);
assert_eq!("4ZQ", &*x);

If you want lowercase, then... Well, tough. However, we do now support encoding to a buffer of your choice rather than a new one created in the function. Read on to learn about plan B...

Plan B (faster encoding)

Because this is Rust, particular focus is given to runtime efficiency--or, at least, allowing the user to achieve runtime efficiency. As a result, we provide a second, more complicated encoding option.

// The longest possible representation of u64 is 13 digits.
let mut buf = Vec::with_capacity(13);
crockford::encode_into(5111, &mut buf);

let result = std::str::from_utf8(&buf)?;
assert_eq!("4ZQ", result);

This encode_into method also accepts &mut String, if you prefer.


Decoding is a two-step process. This is because you can feed any string to the decoder, and the decoder will return an error if you try to convince it that "Hello, world!" is a number. (Hint: it isn't.)

let x = crockford::decode("4zq");
let y = crockford::decode("4ZQ");

assert_eq!(5111, x?);
assert_eq!(5111, y?);

So, step one is to call the decode function. Step two is to match/verify/unwrap/throw away the output.


Licensed under either of

at your option.


Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

No runtime deps