VC · Category
Verifiable Compression
When smaller must still be provable.
VC.1
Compression That Preserves Provability
The pain
Compress a file and you lose the ability to prove anything about the original content. The compressed representation has no mathematical relationship to the source data that a verifier can check.
Solved
Polymonial compression is provable. The compressed file proves its own integrity. Every compression step is verifiable. The compressed file satisfies the same rules as the original.
Affects: Every compressed archive
VC.2
Verifiable Compression Models
The pain
Compression algorithms use learned models to predict and encode data. These models are opaque — no way to verify they haven't been tampered with, backdoored, or degraded.
Solved
Compression models are sealed. Model integrity is provable. Query the model without decompressing it. Tampering is mathematically detectable.
Affects: Every ML-based compressor
VC.3
Provable Compression Ratios
The pain
A service claims 10:1 compression. You cannot verify this without decompressing and comparing — which defeats the purpose of trusting the compressed representation.
Solved
Polymonial compression produces a sealed result with a provable compression ratio. Verify the ratio without decompressing. The seal links the compressed and original representations.
Affects: Every cloud storage provider
VC.4
Integrity Proofs for Compressed Data
The pain
Download a compressed file and decompress it. Is the result identical to the original? You can only check by comparing with the original — which requires having the original. If you had the original, you would not need the compressed copy.
Solved
Seal the original before compression. The seal travels with the compressed file. Verify integrity after decompression without needing the original. The proof is smaller than the data it protects.
Affects: Every compressed backup, every archive transfer