shortid

This is a perfect example of what NOT to do. They reimplemented a seeded linear congruential generator for their random number generator: https://github.com/dylang/shortid/blob/master/lib/random/ran... But since LCGs are easy to solve, after seeing a few values you can solve for the seed and generate all past and future values. But you don't even need to do anything fancy for that. Since their implementation of LCG only has a state size of 233280 different values, you can just brute force it. (also means that their rng could only ever generate 233280 different numbers to begin with) Why the fuck do they have 2.5k stars!? EDIT: They already have an open issue for it but project seems unmaintained: https://github.com/dylang/shortid/issues/70. Stay far far away.

You can also check https://github.com/dylang/shortid

How about this https://github.com/dylang/shortid/

I recently tried using this for a project but ended up switching. I don't really need the encryption ability. More of an issue though is that there is no way to force that the hashes are "short". If you use their example for hashing the default _id in Mongo, you'll end up with a fairly long hash. The only way I could get them short was to switch to an auto-increment starting at 1 and then they will remain short for as long as the number is small. This presented other issues and in the end I found ShortId [1] which made the whole process much simpler. - [1] https://github.com/dylang/shortid