gotenks

Awesome!

Aah OK, so it has been suggested before. I thought uniform randomness in occurrence of alphabets => higher entropy => harder to compress, and vice versa (For instance if it's known that I would never use 0 in a binary string, I just need to specify the size of the string, rather than the content).

Greetings! Long time lurker, found this thread very interesting. I was wondering if the code is not based on encryption scheme at all, but a simple compression scheme (we have to figure out the dictionary for the compression still and the compression algorithm used). We know the following: a) T had very limited space T had to convey the message to his future self. For me, it makes no sense in him trying to encrypt anything. He wants whoever reading his diagram to decipher it.