Return to “General”

Post

Re: Limit Theory Fan Contest - Discussion

#1847
OK, I am back in Switzerland.... and no pizza is waiting for me :cry:

So here is the solution for the code in LTFC's Information round of June:
First the encrypted message:
Spoiler:      SHOW
Image
The message was:
Spoiler:      SHOW
XXXXQXQQKKXKKKXXQQXKXQQQXXQKQKXQQQKKXXXKXQQKQXQKXQKXXKXXQQXKXQQQKXQQQXXKXKQXQKQXKXXXQKXXKXXKXKQXQQKKXQKQXXKXKQXQQQQXQQKKKXXKKKXXXQXKXKQXQKQQKXXXKXQKXQXQQQXXQKKQXKXKQKXXKXKXXXKKKQKKKXXXQXQQQKKXXXKXKKQQXKXKQKXXXQXQQXKXKXKQXQQQKXQQQXXKXKQXQQKKXQKXQXKXKQXQKKKXQQQKXQQKQKXXXXKXXXKXQKQXXQQQXXQKKQXKQXKXXXKX
The symbols were chosen because they looked cool - but there are three of them, thus creating a trinary encoding:
X=0, K=1, Q=2
The symbols are in groups of 5, thus making 243 possibilities, which is close enough to the 256 ASCII positions.
Spoiler:      SHOW

Code: Select all

Rank	4	3	2	1	0	
Dec.	81	27	9	3	1	
________________________________________
<sot>	0	0	0	0	2	XXXXQ
l	0	2	2	1	1	XQQKK
'	0	1	1	1	0	XKKKX
i	0	2	2	0	1	XQQXK
n	0	2	2	2	0	XQQQX
f	0	2	1	2	1	XQKQK
o	0	2	2	2	1	XQQQK
r	1	0	0	0	1	KXXXK
m	0	2	2	1	2	XQQKQ
a	0	2	1	0	2	XQKXQ
t	1	0	0	1	0	KXXKX
i	0	2	2	0	1	XQQXK
o	0	2	2	2	1	XQQQK
n	0	2	2	2	0	XQQQX
 	0	1	0	1	2	XKXKQ
e	0	2	1	2	0	XQKQX
s	1	0	0	0	2	KXXXQ
t	1	0	0	1	0	KXXKX
	0	1	0	1	2	XKXKQ
l	0	2	2	1	1	XQQKK
e	0	2	1	2	0	XQKQX
	0	1	0	1	2	XKXKQ
p	0	2	2	2	2	XQQQQ
l	0	2	2	1	1	XQQKK
u	1	0	0	1	1	KXXKK
s	1	0	0	0	2	KXXXQ
	0	1	0	1	2	XKXKQ
g	0	2	1	2	2	XQKQQ
r	1	0	0	0	1	KXXXK
a	0	2	1	0	2	XQKXQ
n	0	2	2	2	0	XQQQX
d	0	2	1	1	2	XQKKQ
	0	1	0	1	2	XKXKQ
t	1	0	0	1	0	KXXKX
r	1	0	0	0	1	KXXXK
é	1	1	2	1	1	KKQKK
s	1	0	0	0	2	KXXXQ
o	0	2	2	2	1	XQQQK
r	1	0	0	0	1	KXXXK
,	0	1	1	2	2	XKKQQ
	0	1	0	1	2	XKXKQ
s	1	0	0	0	2	KXXXQ
i	0	2	2	0	1	XQQXK
	0	1	0	1	2	XKXKQ
o	0	2	2	2	1	XQQQK
n	0	2	2	2	0	XQQQX
	0	1	0	1	2	XKXKQ
l	0	2	2	1	1	XQQKK
a	0	2	1	0	2	XQKXQ
	0	1	0	1	2	XKXKQ
c	0	2	1	1	1	XQKKK
o	0	2	2	2	1	XQQQK
m	0	2	2	1	2	XQQKQ
p	1	0	0	0	0	KXXXX
r	1	0	0	0	1	KXXXK
e	0	2	1	2	0	XQKQX
n	0	2	2	2	0	XQQQX
d	0	2	1	1	2	XQKKQ
.	0	1	2	0	1	XKQXK
<eot>	0	0	0	1	0	XXXKX
The resulting message is:
<sot>L'information est le plus grand trésor, si on la comprend.<eot>
(<sot> = start of text, <eot> = end of text)

In english, the translation is approximatively:
Information is the greatest treasure, if it is understood.
... obviously, it wasn't :mrgreen:

Thanks again to Talv and the judges for their work for LTFC!
Image
Post

Re: Limit Theory Fan Contest - Discussion

#1850
0111narwhalz wrote:
Sat Jul 22, 2017 10:04 pm
Five-trit encoding? I was working with three-trit (27, A–Z + ' ') and four-trit (81, covers most of ASCII). Had a permutator and everything so I could scan it in search of wordlike strings.
Ah well.

Regarding the submission deadline extension: I'm very happy to learn of this. My entry will be either slightly more ambitious or significantly more procrastinated. :ghost:
To be honest, I did not even think of using only 3 "bits" as sufficient to cover the alphabet! :oops: - I really thought ASCII "as is" would be the easiest code, in retrospect, this was wrong.
As a french-speaker, I need the accent (é), so 81 chars is not sufficient, though. Is either 3 bits without accents, or 5 bits to cover almost all.

However, I did choose a number of characters in the text leading to 300 "bits", so that it was divisible by 1, 2, 3, 4, 5, and 6. Without the <sot> and <eot> I would have 290 bits, thus making it obvious it was 5-bits per char. :twisted:
Image
Post

Re: Limit Theory Fan Contest - Discussion

#1855
Zennofska wrote:
Thu Aug 17, 2017 9:03 am
I finally got around to make something for the LTFC.
To make the song sound "spacey", I tried to simulate that certain C64 sound using modulated square waves.
The flute, accoustic bass guitar and some of the drums are old samples ripped from the old amiga sample disk ST-01.
Very nice, zennofska. I lestened before reading the comment and had this 80s retro feeling. As a C64 kid, i understand now why!

Thanks, look forward hearing more from you in the future!
Image

Online Now

Users browsing this forum: No registered users and 1 guest

cron