Hacker News new | past | comments | ask | show | jobs | submit login

"X in pi" is an interesting thought experiment, but practically speaking, the least efficient way to do anything, since finding a string of N digits in pi will require a search space exponentially much larger than N on average, so it ends up just being an extremely inefficient encoding. A huffman coding + base32/base64 is a better "databaseless" short URL system.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: