RT Nick Szabo (@NickSzabo4)1. Kolmogorov complexity sets a universal minimum size for various kinds of legible content (i.e. limits on how much it can be compressed and remain legible when then uncompressed). For the most common kinds of legible content, current techniques typically have already come close to these theoretical limits: there's usually room only for improvement around the edges.2. A hash, key, password, or similar is very different from the actual content and usually it's far smaller or no cr ...

RT Nick Szabo (@NickSzabo4)1. Kolmogorov complexity sets a universal minimum size for various kinds of legible content (i.e. limits on how much it can be compressed and remain legible when then uncompressed). For the most common kinds of legible content, current techniques typically have already come close to these theoretical limits: there's usually room only for improvement around the edges.2. A hash, key, password, or similar is very different from the actual content and usually it's far smaller or no cr ...