I'm a bit late to the party but done some experiements with the flames on the border.
The datasets provided by other users seem to be consistent with a number of 152 flames. But no one knows in which order or direction you have to read them.
So what I did is the hard way: I wrote a little script, which tries every possible combination you can read the flames in.
The dataset I used is:
outer_top_left_to_right = "001101100111001101"
outer_right_top_to_bottom = "001111000101"
outer_bottom_right_to_left = "0011111011010001"
outer_left_bottom_to_top = "01101101"
inner_top_left_to_right = "0110110110100010110110110011"
inner_right_top_to_bottom = "110111110110110111110010"
inner_bottom_right_to_left = "100011100010110111110111110111110"
inner_left_bottom_to_top = "0111001101101"
Of course I tried them forwards and backwards, so I don't miss the right combination.
What I did than, is use the binary strings (152 bit long each) and parse them to ASCII. So I got lots of strings (around 200 MB as a txt file with 10339728 lines)
Example:
m>Ñ}÷Ú8ž*}·Þm¢ÛYÍ–Î
m>Ñ}÷Ú8ž*}·Þm¢Û[:Îl
m>Ñ}÷Ú8ž*}·Ý³¬æÌÛE¶
m>Ñ}÷Ú8ž*}·Ý³³mÚÎl
m>Ñ}÷Ú8ž-³¬æÌÛE¶O¶û
m>Ñ}÷Ú8ž-³¬æÄûo¼ÛE¶
m>Ñ}÷Ú8ž-³³mÚÎlO¶û
m>Ñ}÷Ú8ž-³³mÙ>ÛîÎl
m>Ñ}÷Ú8ž-³“í¾ìæÌÛE¶
m>Ñ}÷Ú8ž-³“í¾ómÚÎl
m>Ñ}÷Ú8æÚ-µœØx©ößvÎ
m>Ñ}÷Ú8æÚ-µœØx¶ÎO¶û
m>Ñ}÷Ú8æÚ-µœØŸmöx¶Î
m>Ñ}÷Ú8æÚ-µœØŸm÷lãÅ
m>Ñ}÷Ú8æÚ-µœÙlãÅO¶û
m>Ñ}÷Ú8æÚ-µœÙläûo³Å
As expected, there are a lot of non printable characters in there, so I stripped all of them and took a look at my file.
What is left looks like this (just a few lines of the output left after filtering):
Ž-÷ß9µ·}·ÈñO´[h¶ÎÎl
Ž-÷ß9µ·}·Èñ[h¶ÎÎl>Ñ
Ž-÷ß9µ·}·Èñ[h¶ÌûFÎl
Ž-÷ß9µ·}·ÈûFÎl<VÚ-³
Ž-÷ß9µ·}·ÈûFÎlm¢Û3Å
Ž-÷ß9µ·}·ÈûDñlæÆÚ-³
Ž-÷ß9µ·}·ÈûDñ[h¶ÎÎl
Ž-÷ß9µ·}·ÈûE¶‹lìæÃÅ
What I did know is look for words ("you", "www", "dot", "found", etc) in this file. But nothing can be found.
So what I can say is:
- if my dataset is right and the encoding is in the length of the flames (long = 1, short = 0) you need to find the right starting point
- this starting point is not on a edge
- maybe we need to decode the flames not in ASCII
I hear you guys say: "But 680cfbb909, what about that Bacon cipher we told you about?"
Don't worry, I got you covered!
Bacon cipher uses 5 bit (A/B) to encode one letter. We have 152 flames. So either there are 2 flames too much, or we need to find 3 more to
make the cipher work right.
But I'm a scientist and we do stupid things all the the time, so I wrote my binary strings (152 bit each) to a file and tried to decode them with
that bacon-dude's cipher.
What I found are some words in the strings, mostly "YOU" but to be honest: I decoeded 1,7 GB of binary strings. If you decode such a huge
dataset, it is possible to find a lot of words by coincidence. Of course I checked the lines strings that have a "YOU" in it after I threw that
bacon cipher on to them. But none of those lines made any sense after the "YOU". There's only gibberish.
Conclusion:
Bacon Cipher and ASCII encoding doesn't work on the flames if we don't have the right starting point or use some other encoding before
we convert them to ASCII or use bacon to decrypt them.
So how to find a starting point? TBH, I don't have the slightest idea.
Let's look at the poem.
Phoenix and the Turtle fled
In a mutual flame from hence.
...
Two distincts, division none:
Number there in love was slain.
...
Flaming in the Phoenix' sight:
Either was the other's mine.
What I think is important here is "phoenix' sight". So take a look at the phoenix' eye.
It is the only element, which is aligned with the chess fields and their borders.
If you follow this line to the top, it ends right on a leaf which points to a spot that
has no flame in it.
Maybe this can be the starting point? But what about the ribbons on the key? They aren't there for nothing. And in which direction should we read the flames?
Maybe those greek-key-thingies tell us something?
Show Posts
