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

First, this is a fun implementation and I love it.

Second, you could as easily embed an infinite size dataset into an infinitely long binary string and say that you've reproduced your dataset with a 'single' parameter! That's sort of what this is doing, with some extra steps.




This reminds me of the fun thought experiment of using /dev/random as storage. Given an infinite amount of time you'll find every file you need.


The index might need more bits than the file.


Considerably more in all probability :)


Infinite storage, horrendous seek time.


Your second point is what I first assumed this paper was doing before I read it.


Up until ARG_MAX is reached, or you run out of RAM that is... https://serverfault.com/a/844666




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

Search: