881
ultimate storage hack (sh.itjust.works)
submitted 1 year ago by to c/programmer_humor@programming.dev
89 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] 62 points 1 year ago (15 children)

I had a manager once tell me during a casual conversation with complete sincerity that one day with advancements in compression algorithms we could get any file down to a single bit. I really didn't know what to say to that level of absurdity. I just nodded.

  • permalink
  • fedilink
  • source
  • hideshow 15 child comments
    •
  • [–] 5 points 1 year ago

    Just make a file system that maps each file name to 2 files. The 0 file and the 1 file.

    Now with just a filename and 1 bit, you can have any file! The file is just 1 bit. It's the filesystems that needs more than that.

  • permalink
  • fedilink
  • source
  • parent
  • [–] 3 points 1 year ago* (last edited 1 year ago) (2 children)

    It's an interesting question, though. How far CAN you compress? At some point you've extracted every information contained and increased the density to a maximum amount - but what is that density?

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 2 child comments
    •
  • [–] 3 points 1 year ago

    I think by the time we reach some future extreme of data density, it will be in a method of storage beyond our current understanding. It will be measured in coordinates or atoms or fractions of a dimension that we nullify.

  • permalink
  • fedilink
  • source
  • parent
  • [–] 2 points 1 year ago*

    This is a really good question!

    I believe the general answer is, until the compressed file is indistinguishable from randomness. At that point there is no more redundant information left to compress. Like you said, the 'information content' of a message can be measured.

    (Note that there are ways to get a file to look like randomness that don't compress it)

  • permalink
  • fedilink
  • source
  • parent