Global Data Compression Competition

Date: before 20/11/20
Test your strength in universal compression and win a prize.
- 50 000 EUR prize fund
- 12 compression areas for research
- Consulting from the best masters in data compression
Latest News
13.11.2020
Leaderboards updated.
This is the last interim update. Deadline for new and updated submissions is November 20 midnight GMT.
30.10.2020
Leaderboards updated, excessive reference data deleted
15.10.2020
Leaderboards updated for many categories
About Competition
In this competition we concentrate on the advantages of algorithms and their implementations for universal lossless data compression, rather than tuning for certain data types. We test compressors under the following scenarios:
Qualitative-data compression
This year we use text data.
Quantitative-data compression
The test set for this year contains images, most of which are photographic.
Mixed-data compression
This year our focus is on slightly preprocessed executable files (we removed incompressible chunks).
Small-block-data compression
We use small blocks of textual and mixed data to evaluate how compressors behave when the data size is severely limited, such as in block-storage systems.
About Competition
In this competition we concentrate on the advantages of algorithms and their implementations for universal lossless data compression, rather than tuning for certain data types. We test compressors under the following scenarios:
Qualitative-data compression
This year we use text data.
Quantitative-data compression
The test set for this year contains images, most of which are photographic.
Mixed-data compression
This year our focus is on slightly preprocessed executable files (we removed incompressible chunks).
Small-block-data compression
We use small blocks of textual and mixed data to evaluate how compressors behave when the data size is severely limited, such as in block-storage systems.
Awards for Each Category
Second place
1,000 EUR and award certificate
Third place
Honorable mention certificate (no monetary prize)
We're also reserving 2,000 EUR for additional rewards in case of ties or other difficult situations.
Awards for Each Category
Second place
1,000 EUR and award certificate
Third place
Honorable mention certificate (no monetary prize)
Description of Test Categories
Leaderboards
The leaderboard tables below contain results for contest submissions and selected publicly available compressors. The names of submitted compressors appear in boldface. Although the statistics for publicly available compressors may enable speed estimates for other compressors running on our hardware, they're for reference only.

When possible, we set compressor options to use just one thread for publicly available compressors. Some programs, however, may (and did) use multiple threads. Because we declined to fine-tune presets to fit the speed limits as tightly as possible, the compressors are not aligned by speed. Therefore, these results SHOULD NOT be used to draw conclusions about publicly available compressors such as "compressor X is better than compressor Y."

Note that for prize-winning places of the final leaderboards we will be taking into account results for submissions from faster categories. Thus submissions from, say, the Balanced category will be eligible to win a prize in the HCR category of the same test.
Please wait, leaderboard is loading now...
Notes on Table Titles
  • HCR stands for "High compression ratio".
  • "Full" means the entire test (1 GB), "open part" means 400 MB data available to participants.
Table Additional Notes
The compressors that fell just short of a given speed category appear at the bottom of the corresponding table. Submissions that failed to fully comply with the rules (in particular, the rule that every compressor must correctly decode the compressed files for all four tests) are also at the bottom.

Since the August update, we replaced the c_size column with the c_full_size column, taking the decompressor size into account.

Some presets for publicly available compressors have undergone optimization since the initial publication of the leaderboards.

All compressors in the table underwent testing on a machine running Windows 10 64-bit (except agiannis_text, k5, pglz, archbox, BWIC, guess, agiannis_image, pgcm, sgcm, Orz which underwent testing on a machine running Ubuntu 18.04), with the machine configuration described in Test Hardware.

Notes on Compressors
  • lzuf2 appears unranked in the table because it failed to correctly process all four test sets as the rules require
  • mcm 0.84 froze while decoding Test 3 data for both the -t11 and -x11 presets
  • nanozip 0.09 with the -cc -m26g -p1 -t1 -nm preset failed to correctly decode Test 3 data
  • Zstd was modified for Test 4 to comply with our API: it employed the functions ZSTD_createCCtx, ZSTD_compressCCtx, ZSTD_createDCtx and ZSTD_decompressDCtx from the zstd API; it was compiled using x86_64-w64-mingw32-gcc; and the ZSTD_compressCCtx function took the number from the preset column as an argument
  • zlib was modified for Test 4 to comply with our API: it employed the functions compress2 and uncompress from the zlib API, it was compiled using x86_64-w64-mingw32-gcc, and the compress2 function took the number from the preset column as an argument
To find out more about the competition, check out Rules and Conditions. Also see discussions at Encode.su forum for this competition.
Get Experience From the Best
Be among the first 30 participants to have the opportunity to receive consulting on data compression and, if you like, get feedback on your algorithm and implementation from the leading professionals in this field.


Board of Experts
Alexander (Alex) Rhatushnyak
A PhD developing data-compression algorithms since the 1990s. Coauthor of a book and patents on data compression, co-creator of the JPEG-XL standard, and multiple-time winner of the Hutter Prize and Calgary Corpus Compression Challenge—the only ongoing competitions (before ours) in lossless data compression.
Eugene Shelwien
Developer of recompression algorithms for Deflate, JPEG, MP3, AAC, proprietary audio codecs and the .pa compression format. Administrator of Encode.su, the biggest international forum covering data-compression algorithms and software.
Dmitriy Vatolin
A PhD, video-codec developer and coauthor of a book on data compression. Supervisor of collaborative video- and image-processing research projects that include Broadcom, Huawei, Intel, RealNetworks, Samsung and other leading companies. Instructs courses on methods of 3D and 2D video and image processing and compression.
Schedule
19.06.2020
19.06.2020
Start accepting submissions
30.06.2020
30.06.2020
Test set fixed
40% of test set available to participants
About every month
About every month
Leaderboards updated
20.11.2020
20.11.2020
Deadline for new and updated submissions
27.11.2020
27.11.2020
Deadline for settling any technical issues affecting submitted compressors
15.12.2020
15.12.2020
Winners and results announced
Test sets fully disclosed
Registration Form
Register to get access to the test data and take part in the competition.
About Organizer and Sponsor
The test method and result validity are the sole responsibility of the organizer ("we" in this text), the Graphics & Media Lab of the Computational Mathematics and Cybernetics Department at Moscow State University.

The Graphics & Media Lab has more than 15 years of experience comparing video codecs. These comparisons are well known throughout the compression community.

This competition is sponsored by Huawei.
Contacts
Send us your questions, submissions and any updates to globalcompetition@compression.ruTo find out more about the competition, check out Rules and Conditions. Also see discussions at Encode.su forum for this competition.
Made on
Tilda