A new type of File Compression
Compression of compressed files
Matrix compression is a 2000 year my idea. In essence, the data (bytes) are arranged in a square numerical matrix and the checksums are entered in rows and columns, maybe diagonally as well as one total checksum of the entire matrix. Only checksums are transmitted over the data channel, without numeric matrices. This is essentially a compressed file. In the receiving country, the program attempts to recover the original data by reference to checksums which should coincide with the original data. When all checksums match then it is considered that the data was recovered correctly.
Due to the incorrectly selected method of checksums, collisions can occur - coincidence of incorrect data.
The task is impossible for classic computers because of the huge number of combinations and the huge time to calculate them. The task is suitable for quantum computers that find milliseconds the right answers by direct match.
The compression rate is constant and independent of the data type. Compression in compression is also allowed - that is, a compressed file can be re-compressed and re-compressed several times as it will be reduced several times.