Zup - A lossy compression algorithm for text files.

Project Type
Open source idea

Zup - A lossy compression algorithm for text files.

Needing to save some hard drive space? That XML dump of your database too large to send to a colleague? Zup's revolutionary algorithm has an adjustable compress level that fits your needs, and can achieve unsurpassed performance. Compression and decompression only takes O(n) and requires no overhead or special libraries, only a psuedo random generator to determine which characters are necessary The infamous "works on my machine" will always be a valid excuse.
Tech Stack
Various Implementations
Current Team Size
  • 9
    Not gonna use it if it doesn't have a Weissman score of 5.2
  • 2
  • 6
    I'll only agree if you make the "zup" sound when compressing a file.

  • 5
    "Text needs to be losslessly compressed, otherwise you might end up sending the wrong worms"
    -- Tom Scott
  • 0
    Why not just zip or tar the file? There's already commands like zgrep
  • 4
    @billgates Because zip and tar are lossless, how boring is that
  • 1
    I often lossy compr in message
  • 0
    @12bitfloat oh ok.... But that's like generating a hash? or just corrupting the data?

    <El>hi</El> becomes <El>h</> the data is sorta useless and invalid?
  • 0
    @billgates you can often achieve the same effect with fever and shorter words
  • 4
    @billgates Yes that's the joke. Lossy text compression is pointless in 99.9999% of all cases.
  • 0
    @electrineer so like JS code obfuscation/minifier then. Not lossy though...

    But point is if it's lossy then you need to make sure you don't need whatever gets lost. And well for XML... THE only thing you can lose is the info between the start, end tags if you still need it to be valid for machine parsing.

    Guess depends on use case
  • 1
    @BobbyTables I want sure since this was a collab and not tagged as a joke...
  • 3
    Proposal: Replace all input text with ZUUUUUUP.
  • 2
    I get the joke.
    It’s a hilarious idea.
    Build it.
Add Comment