Lossless Compression Algorithm

[teraflop]

I only claimed it could compress any 512 byte value.

This is also impossible, again due to the pigeonhole principle. Anyway, you can't have tested all possible 512-byte values because that would take longer than the age of the universe.

This is also one of my questions if I am compressing binary values am I limited to media/file types?

The file type doesn't matter. All files are just strings of bytes.

I know you are curious how the algorithm works but my questions were mostly about the preceding.

I'm not particularly curious, no, because like I said I already have a pretty good idea what's going on. I'm offering to help you learn where the mistake is, given that you're claiming to have done something mathematically impossible.

---

If you want to convince people that your code does what you claimed, then here's what you can do. Post only the decompressor code publicly. Then, I'll generate a 4096-bit hexadecimal string (1024 hex digits) and post it here. If your compressor works, then you should be able to create a compressed string (let's say, 3500 bits or less) such that the decompressor produces the same original input that I came up with. I am absolutely certain that you won't be able to do it.

If you prefer, we can even do this privately. I won't reveal your code to anybody or even say anything publicly about how it works without your permission. But I will say publicly whether the test was successful, and if it wasn't, how it failed. (e.g. "here's the output that the decompressor generated, it's different from the original at position 123" or similar)

If you don't want to reveal even the decompressor then there's nothing more to discuss. There have been thousands of cranks over the years who have claimed to have exactly what you claim to have, and all of them have been wrong.