Results 1 to 11 of 11

Thread: the ZPAQ Prize

  1. #1
    Member
    Join Date
    Aug 2014
    Location
    Overland Park, KS
    Posts
    17
    Thanks
    0
    Thanked 0 Times in 0 Posts

    the ZPAQ Prize

    the ZPAQ prize is the same thing as the Hutter prize except you can only use ZPAQ and Extensions of it to compress the file

    Extra Rule No.1 Neither tornado or lzturbo are allowed

  2. #2
    Expert
    Matt Mahoney's Avatar
    Join Date
    May 2008
    Location
    Melbourne, Florida, USA
    Posts
    3,255
    Thanks
    306
    Thanked 778 Times in 485 Posts
    Interesting idea. Can anyone compress 1 million digits of pi to less than 114 bytes? http://mattmahoney.net/dc/pi.txt.zpaq

  3. #3
    Member
    Join Date
    Aug 2014
    Location
    Overland Park, KS
    Posts
    17
    Thanks
    0
    Thanked 0 Times in 0 Posts
    Matt Mahoney Can you compress 1 million digits of y-cruncher lemniscate to 10000 bytes or less
    if you need the program to generate digits go to http://www.numberworld.org/y-cruncher/
    if you want a hint go to http://www.numberworld.org/notes.html
    Last edited by calthax; 18th August 2014 at 01:52.

  4. #4
    Member
    Join Date
    Feb 2013
    Location
    San Diego
    Posts
    1,057
    Thanks
    54
    Thanked 71 Times in 55 Posts
    Quote Originally Posted by Matt Mahoney View Post
    Interesting idea. Can anyone compress 1 million digits of pi to less than 114 bytes? http://mattmahoney.net/dc/pi.txt.zpaq
    Does the program need to be efficient? What if you can prove that it works, but it will not finish within the expected lifetime of the solar system?

  5. #5
    Expert
    Matt Mahoney's Avatar
    Join Date
    May 2008
    Location
    Melbourne, Florida, USA
    Posts
    3,255
    Thanks
    306
    Thanked 778 Times in 485 Posts
    Kolmogorov complexity has no time limit
    The 114 byte zpaq archive only takes a day to decompress.

  6. #6
    Member
    Join Date
    Feb 2013
    Location
    San Diego
    Posts
    1,057
    Thanks
    54
    Thanked 71 Times in 55 Posts
    A lot of times you can write very short algorithms that are exponential in time. I'm not sure if there is one for pi.

  7. #7
    Member
    Join Date
    Feb 2013
    Location
    San Diego
    Posts
    1,057
    Thanks
    54
    Thanked 71 Times in 55 Posts
    Here is ten million digits of pi in 21 bytes, give or take: http://pi.karmona.com

    The language is URL. I don't think Kolmogorov compression disallows it.

  8. #8
    Member
    Join Date
    Jun 2009
    Location
    Kraków, Poland
    Posts
    1,471
    Thanks
    26
    Thanked 120 Times in 94 Posts
    The language is URL. I don't think Kolmogorov compression disallows it.
    I think "URL compression" is quite close to BARF-style compression, thereby undermining the whole concept of general purpose compression.

  9. #9
    Member
    Join Date
    Aug 2014
    Location
    Argentina
    Posts
    464
    Thanks
    202
    Thanked 81 Times in 61 Posts
    Yes! !! We can also send data between paralell universes... to retrieve it again an ipv16 will be needed but we cut off the HD usage

  10. #10
    Expert
    Matt Mahoney's Avatar
    Join Date
    May 2008
    Location
    Melbourne, Florida, USA
    Posts
    3,255
    Thanks
    306
    Thanked 778 Times in 485 Posts
    Some other small programs for calculating pi. So far ZPAQL beats C.
    http://numbers.computation.free.fr/C.../tinycodes.pdf

    But some other languages look promising.
    http://codegolf.stackexchange.com/qu...0-digits-of-pi

  11. #11
    Member
    Join Date
    Feb 2013
    Location
    San Diego
    Posts
    1,057
    Thanks
    54
    Thanked 71 Times in 55 Posts
    Quote Originally Posted by Piotr Tarsa View Post
    I think "URL compression" is quite close to BARF-style compression, thereby undermining the whole concept of general purpose compression.
    I'm not sure it undermines general purpose compression. Kolmogorov compression in general is uncomputable; this, OTOH, is a viable method for representing the digits of pi; moreover, it likely uses fewer bits than the Kolmogorov solution.

    It might undermine this competition, because it clearly doesn't seem to be the point. But I don't know what precept of compression of it violates.

    Edit:
    This has an important difference from BARF. AFAIK, BARF "compresses" a file mainly by moving data into the file name. So the filename now has unbounded length.

    This scheme wasn't intended to compress arbitrary data. The concept is to take advantage of the fact that common data is already on the web, so it can be unambiguously referenced by its URL.

    The smallest URL that fetches a given piece of data describes a well-defined concept that can be used to measure entropy. Call it "Internet entropy." Actually, arbitrary data can also be incorporated into a URL, so this could work for any data.
    Last edited by nburns; 20th August 2014 at 20:13.

Similar Threads

  1. US$3 Million Data compression Prize
    By LawCounsels in forum The Off-Topic Lounge
    Replies: 30
    Last Post: 2nd May 2012, 18:26
  2. NASA Contest: Prize $ 10.000,00
    By BetaTester in forum Download Area
    Replies: 0
    Last Post: 17th April 2012, 20:55
  3. Hutter prize awarded
    By Matt Mahoney in forum Data Compression
    Replies: 2
    Last Post: 19th August 2009, 21:17
  4. Alexander Rhatushnyak wins Hutter Prize!
    By LovePimple in forum Forum Archive
    Replies: 1
    Last Post: 5th November 2006, 19:04
  5. The Hutter Prize
    By LovePimple in forum Forum Archive
    Replies: 7
    Last Post: 22nd September 2006, 12:28

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •