Kevin_P86
Level: Smitemaster

Rank Points: 535
Registered: 06-28-2005
IP: Logged

I have 5 rank points for the first person to tell me the significance of my signature. For those of you who choose not to view signatures (or to maintain coherence in case I change my signature some time in the future), I will post it here:

11111001000101111101100000110100010001011101011110
10111110110110110000011010001010010100101001000000
0000000000000000001010011111100101011111001010

I imagine several hints will be needed, so I will start with two:
1) No, it is not a binary number (or a number of any kind).
2) When you get the correct answer, you will be absolutely certain it is correct.

____________________________
+++++[>+++++<-]>[>+++>++++>+++++<<<-]>.>+.>-------.<++++.+++++.

---

[Last edited by Kevin_P86 at 08-22-2006 11:40 PM]

Niccus
Level: Smiter
Rank Points: 308
Registered: 07-02-2006
IP: Logged

It reads "Kevin"

Kinda easy since your last signature was of Brainf***

Kevin_P86
Level: Smitemaster

Rank Points: 535
Registered: 06-28-2005
IP: Logged

Yes, I wondered who would've noticed/remembered that...

Good job!

____________________________
+++++[>+++++<-]>[>+++>++++>+++++<<<-]>.>+.>-------.<++++.+++++.

TripleM
Level: Smitemaster
Rank Points: 1379
Registered: 02-05-2003
IP: Logged

Check out the link in Niccus' post

Kevin_P86
Level: Smitemaster

Rank Points: 535
Registered: 06-28-2005
IP: Logged

Ok, let's try a harder one... I'm not sure if this will be too hard or too easy (or somewhere in between).

11111111111111111111111111111111001110001111111111
10001111111111111100011111111111111111111111000111
11111111111111111111111000111111111111111111111111
11111000111111111111111111111111111111110001111111
11111111111111111111111111110001111111111111111111
11111111111111111110001111111111111111111101110111
01110111011101110111011101100111000110001100011000
11000101010001100011111111111100101010101010100011
00011000101010100011011101110111011101110111011111
11001100011000110001100011000110001010101010001100
01000110111011101110111011101110100110001100011111
10011000110001100011000110001010101000101000110110
10101000110001111111111111110011011101110111011101
11011101001100011000110001111111110011000110001100
01111111111110011111111111100110001010001111111110
01010101000100011011101110111011101110110001100011
00011000110001100011000111111111111111001101110111
01110111011101110100110001100011000110001100011000
00101010100011011111111110000110001111111110011011
11001101110111011101110100110001100011000110001100
01100011111100110110101010001100010001101111111111
1110011000110001100011111111100

Above is a program in a language much like Spoon. In fact, the language is identical to Spoon, except the 8 commands are represented with different strings of bits. This program prints a question. Once the question is discovered, the answer should be very easy to find using any search engine (if the answer is not known without one). For 5 more rank points, I need the answer to the question (because I think this is quite difficult, I would offer more, but I don't exactly have an excess of mod points...)

If it is indeed too difficult, I may start giving hints (that is, if anyone is interested in solving this).

Also, in case anyone is worried, I know about Huffman coding and how to use a tree to ensure there is no ambiguity in the bit strings. For those who do not know what I am talking about, I will explain. For example, if '+' was encoded as "0110", and '-' was encoded as "01100", and '.' was encoded as "0", then the program "01100" could either represent "-", or "+.". With my new encoding, as with the Spoon encoding, there is no such ambiguity.

____________________________
+++++[>+++++<-]>[>+++>++++>+++++<<<-]>.>+.>-------.<++++.+++++.

Kevin_P86
Level: Smitemaster

Rank Points: 535
Registered: 06-28-2005
IP: Logged

Kevin_P86 wrote:
Above is a program in a language much like Spoon. In fact, the language is identical to Spoon, except the 8 commands are represented with different strings of bits.

Ok, I'm sorry - I've made a slight mistake here... This language only has 7 commands, unlike Spoon's 10. There is no encoding (or use of) input (','), or DEBUG or QUIT. It's also important to note that the way the tree was designed, there is no way to add an eighth command while retaining no ambiguities. Sorry about that...!

____________________________
+++++[>+++++<-]>[>+++>++++>+++++<<<-]>.>+.>-------.<++++.+++++.

Kevin_P86
Level: Smitemaster

Rank Points: 535
Registered: 06-28-2005
IP: Logged

Ok, it's been almost 3 days. So either it's just too impossible (likely), or no one's interested (perhaps as likely). Just in case it is the former, I will make it a little more possible (probably way too easy now, but that's ok):

111 111 111 111 111 111 111 111 111 111 11001 11000 111 111 111 
11000 111 111 111 111 11000 111 111 111 111 111 111 111 11000 
111 111 111 111 111 111 111 111 11000 111 111 111 111 111 111 
111 111 111 11000 111 111 111 111 111 111 111 111 111 111 11000 
111 111 111 111 111 111 111 111 111 111 111 11000 111 111 111 
111 111 111 111 111 111 111 111 111 11000 111 111 111 111 111 
111 1101 1101 1101 1101 1101 1101 1101 1101 1101 10 01 11000 
11000 11000 11000 11000 10 10 10 00 11000 111 111 111 111 00 10 
10 10 10 10 10 10 00 11000 11000 10 10 10 10 00 1101 1101 1101 
1101 1101 1101 1101 111 111 00 11000 11000 11000 11000 11000 
11000 10 10 10 10 10 00 11000 10 00 1101 1101 1101 1101 1101 
1101 1101 00 11000 11000 111 111 00 11000 11000 11000 11000 
11000 10 10 10 10 00 10 10 00 1101 10 10 10 10 00 11000 111 111 
111 111 111 00 1101 1101 1101 1101 1101 1101 1101 00 11000 
11000 11000 111 111 111 00 11000 11000 11000 111 111 111 111 00 
111 111 111 111 00 11000 10 10 00 111 111 111 00 10 10 10 10 00 
10 00 1101 1101 1101 1101 1101 1101 10 00 11000 11000 11000 
11000 11000 11000 111 111 111 111 111 00 1101 1101 1101 1101 
1101 1101 1101 00 11000 11000 11000 11000 11000 11000 00 10 10 
10 10 00 1101 111 111 111 00 00 11000 111 111 111 00 1101 111 
00 1101 1101 1101 1101 1101 00 11000 11000 11000 11000 11000 
11000 111 111 00 1101 10 10 10 10 00 11000 10 00 1101 111 111 
111 111 00 11000 11000 11000 111 111 111 00

All that's left to be done is to figure out which string of bits stands for which symbol, and to simulate the running of it.

____________________________
+++++[>+++++<-]>[>+++>++++>+++++<<<-]>.>+.>-------.<++++.+++++.

---

[Last edited by Kevin_P86 at 08-25-2006 08:01 AM]

Tuttle
Level: Smitemaster

Rank Points: 1588
Registered: 02-22-2003
IP: Logged

Answer:

Explanation:

---

[Last edited by Tuttle at 08-25-2006 10:03 AM]

Kevin_P86
Level: Smitemaster

Rank Points: 535
Registered: 06-28-2005
IP: Logged

Yep, good job

As a side note, I'm slightly impressed I was so easily able to write a program in Brainf that outputted such a long message!

____________________________
+++++[>+++++<-]>[>+++>++++>+++++<<<-]>.>+.>-------.<++++.+++++.