No Login Data Private Local Save

Hashid Encoder/Decoder - Online Short Unique IDs from Numbers

24
0
0
0

Hashid Encoder / Decoder

Generate short, unique, non-sequential IDs from numbers, or decode them back.

Please enter a positive integer or comma‑separated integers.
A secret string used to shuffle the output. Keep it private.
Minimum length of the generated hashid (0 = no minimum).
At least 16 unique characters; duplicates are automatically removed.
Please enter the hashid string.
Must match the salt used during encoding, otherwise decoding may fail.
Must match the encoding alphabet exactly.
Frequently Asked Questions
What is Hashid?

Hashid is a small library that generates short, unique, non-sequential IDs from positive integers. It’s often used to hide real database IDs in URLs or for creating friendly public identifiers.

Is it secure or cryptographically safe?

No, Hashids is not encryption. It’s an obfuscation technique. Anyone with the salt (and alphabet) can decode the IDs. Do not use it as a security measure.

Can I decode a hashid if I don’t know the salt?

No. Without the exact salt and alphabet used during encoding, decoding will either fail or return wrong numbers. Always store your salt securely.

Why does my encoded hashid change when I alter the salt or minimum length?

The salt shuffles the character mapping, and minimum length pads the output. Even a tiny change in either parameter produces a completely different hashid.

What numbers can I encode?

Only positive integers (0, 1, 2, …) and arrays of positive integers. Negative numbers and floats are not supported.

🔧 Related Tools