I stopped working on PAQ about 12 years ago to work on ZPAQ, and stopped working on that in 2015. PAQ was experimental code designed for general compress, not specifically the Hutter prize. There are about 200 incompatible versions. ZPAQ defines a standard format compatible both forward and backwards, but again for general compression.
ZPAQ defines a context mixing algorithm in the header and a virtual machine language for computing contexts and postprocessing. For prototyping I find it easier to write in C++ than ZPAQL. I will probably reuse some code from LibZPAQ but I have some ideas for optimization that would break compatibility. -- Matt Mahoney, [email protected] On Sat, Nov 8, 2025, 6:29 AM <[email protected]> wrote: > ? > > Also actually the numbers for speed that are listed seem to say PAQ is not > as fast as other algorithms. But I still like the other things in it - it > went the right way really. > *Artificial General Intelligence List <https://agi.topicbox.com/latest>* > / AGI / see discussions <https://agi.topicbox.com/groups/agi> + > participants <https://agi.topicbox.com/groups/agi/members> + > delivery options <https://agi.topicbox.com/groups/agi/subscription> > Permalink > <https://agi.topicbox.com/groups/agi/T2172127a22502678-M05903d121ada61da903eb9f1> > ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/T2172127a22502678-M762e74cc7bf3e85ccf217d9e Delivery options: https://agi.topicbox.com/groups/agi/subscription
