I have a list of 256-bit binary data to store. Any algorithm for doing lossless compression on it in a way I can retrieve an entry by its index without decompressing the whole data (if possible). The decompressed data will also be stored as binary. I will also need to code this algorithm ground-up in a domain-specific language.
I'm trying to store 256-bit addresses in a blockchain smart-contract. I will need to later lookup addresses by index so, it'd be helpful if I can do that without full decompression.
Sample data with each entry pasted end to end here. I tried this site to compress using LSW and it seems I get a good reduction. Also here is another sample with each entry separated with line-break. The real data will contain from 2 to 65,000 entries.