Halo ODST > SGP Task Force: 7

J Banner 7

<< < (2/16) > >>

ColdGlider:
I changed my mind.  I would like to maintain a topic in Task Force: 7 for each of the "J Banners".  This post is a perfect place for discussion on the banner that Dunder Moose provided image links to (now also in the gallery.)

Each of the three banners discovered so far has a unique signature in the fourth column.  (They differ elsewhere as well, but that is the first column which differs among all three.)  If you decode these columns into binary (Top-Bottom, Little Endian, Dot=1) then you can obtain three unique numbers which can be used to identify the banners easily: 7, 0, 15.  This is especially nice since each of the extremes (as well as the number 7!) is represented.

Based on this unique property, I'm naming the banner cataloged by Dunder Moose "J Banner 7" and renaming this topic's subject accordingly.  I'm also happily unlocking it.

:)

ColdGlider:


Way back on October 8th I described what I thought would be the required specifications for an analysis tool capable of tackling the binary data we assumed to be contained in the J-Banners.  I began writing that tool the other night and the current version allowed me to produce the following data for J Banner 7.  

I wanted to catalog the 4-bit values encoded in the banner columns.  For each of four possible interpretations, a comma separated list is provided.  There are three fields: column index, binary representation, decimal value.

Please note that maintaining Little Endian bit order while changing scan direction (top-bottom / left-right) is functionally equivalent to maintaining the scan direction and altering the endianness.  


J Banner 7

Transcribed Data (Dot=1)
1011010110111101010111111010
1011111001101101101110110101
0101001011110000110011010110
0000011100101001100101101011

Decoded by Columns: Dot=1, L-R, T-B, Little Endian
01,0011,3
02,0100,4
03,0011,3
04,0111,7
05,0010,2
06,1011,11
07,1110,14
08,1001,9
09,0101,5
10,0110,6
11,1111,15
12,0101,5
13,1011,11
14,0011,3
15,0000,0
16,1011,11
17,1110,14
18,0101,5
19,0010,2
20,1011,11
21,0111,7
22,1101,13
23,1011,11
24,0111,7
25,1001,9
26,0110,6
27,1101,13
28,1010,10


Decoded by Columns: Dot=1, L-R, B-T, Little Endian
01,1100,12
02,0010,2
03,1100,12
04,1110,14
05,0100,4
06,1101,13
07,0111,7
08,1001,9
09,1010,10
10,0110,6
11,1111,15
12,1010,10
13,1101,13
14,1100,12
15,0000,0
16,1101,13
17,0111,7
18,1010,10
19,0100,4
20,1101,13
21,1110,14
22,1011,11
23,1101,13
24,1110,14
25,1001,9
26,0110,6
27,1011,11
28,0101,5

Transcribed Data (Dot=0)
0100101001000010101000000101
0100000110010010010001001010
1010110100001111001100101001
1111100011010110011010010100

Decoded by Columns: Dot=0, L-R, T-B, Little Endian
01,1100,12
02,1011,11
03,1100,12
04,1000,8
05,1101,13
06,0100,4
07,0001,1
08,0110,6
09,1010,10
10,1001,9
11,0000,0
12,1010,10
13,0100,4
14,1100,12
15,1111,15
16,0100,4
17,0001,1
18,1010,10
19,1101,13
20,0100,4
21,1000,8
22,0010,2
23,0100,4
24,1000,8
25,0110,6
26,1001,9
27,0010,2
28,0101,5


Decoded by Columns: Dot=0, L-R, B-T, Little Endian
01,0011,3
02,1101,13
03,0011,3
04,0001,1
05,1011,11
06,0010,2
07,1000,8
08,0110,6
09,0101,5
10,1001,9
11,0000,0
12,0101,5
13,0010,2
14,0011,3
15,1111,15
16,0010,2
17,1000,8
18,0101,5
19,1011,11
20,0010,2
21,0001,1
22,0100,4
23,0010,2
24,0001,1
25,0110,6
26,1001,9
27,0100,4
28,1010,10

EnigmaBiz:
 :( What ever happened to good old fashion Tea Bagging?

(I will not be offended if you delete this, for the sake of keeping the it clean)

Dunder Moose:
So I can't program like ColdGlider, but I know how to use Excel a little.  Here is a graphic representation of the banners.  The composite at the bottom shows the frequency for dots in each position.  It seems likely since the codes are so similar that they do not give meaning when concatenated (Unless it is a repetitious phrase).  Also by comparing them one to another, each position now has a possibility of 4 values:  0-3.  I don't know what that opens up decryption-wise.  I got excited when I learned that there is an 8-dot Braille that would match the depth of the banners, but I haven't found a good ascii mapping for it online.

If the attachment doesn't work you can view it here - http://www.flickr.com/photos/61024371@N00/4100217777

ColdGlider:
Well done, Mr. Moose!  The image has been added to our gallery here. 

I've often wondered what binary operations on the data (i.e binary AND, binary OR) would produce.  Moose's result set provides the equivalent of an AND operation if you convert the blocks equal to 3 to a 1 and the rest of the values to 0.  To get the equivalent to an OR operation, you convert all non-zero values to 1.  Performing each of these operations produces two "new" sets of banner dots:

J-Banners - Binary AND
1010010110011101010100000010
1010011001000001101010110101
0000001010010000110011010110
0000011000001001100101101011

J-Banners - Binary OR
1011010110111101010111111110
1011111111111111111111111101
0101001011111100110011011110
1111111100101101101101101011

I dropped these new data sets into my binary analyzer program and set it to decode ASCII in four different ways.  I turned up a big nothing, but am providing the data for proof/reference.  I also grouped the data into 7-bit bytes, performed the same eight decodings, and also got nothing.  If anyone really wants that data I can provide it as well.

Below are the ASCII conversions of these new sets of dots, assuming 8-bit bytes.  Values in brackets ([]) are within the ASCII range but are non-printable.   Values in braces ({}) are outside the valid ASCII range.  Valid ASCII values are decoded into the corresponding ASCII character. 

J-Banner Binary AND ASCII Conversion: Dot=1, L-R, T-B, Big Endian
01,10100101,{165}
02,10011101,{157}
03,01010000,P
04,00101010,*
05,01100100,d
06,00011010,[26]
07,10110101,{181}
08,00000010,[2]
09,10010000,{144}
10,11001101,{205}
11,01100000,`
12,01100000,`
13,10011001,{153}
14,01101011,k

J-Banner Binary AND ASCII Conversion: Dot=0, L-R, T-B, Big Endian
01,01011010,Z
02,01100010,b
03,10101111,{175}
04,11010101,{213}
05,10011011,{155}
06,11100101,{229}
07,01001010,J
08,11111101,{253}
09,01101111,o
10,00110010,2
11,10011111,{159}
12,10011111,{159}
13,01100110,f
14,10010100,{148}

J-Banner Binary AND ASCII Conversion: Dot=1, L-R, T-B, Little Endian
01,10100101,{165}
02,10111001,{185}
03,00001010,[10]
04,01010100,T
05,00100110,&
06,01011000,X
07,10101101,{173}
08,01000000,@
09,00001001,[9]
10,10110011,{179}
11,00000110,[6]
12,00000110,[6]
13,10011001,{153}
14,11010110,{214}

J-Banner Binary AND ASCII Conversion: Dot=0, L-R, T-B, Little Endian
01,01011010,Z
02,01000110,F
03,11110101,{245}
04,10101011,{171}
05,11011001,{217}
06,10100111,{167}
07,01010010,R
08,10111111,{191}
09,11110110,{246}
10,01001100,L
11,11111001,{249}
12,11111001,{249}
13,01100110,f
14,00101001,)

J-Banner Binary OR ASCII Conversion: Dot=1, L-R, T-B, Big Endian
01,10110101,{181}
02,10111101,{189}
03,01011111,_
04,11101011,{235}
05,11111111,{255}
06,11111111,{255}
07,11111101,{253}
08,01010010,R
09,11111100,{252}
10,11001101,{205}
11,11101111,{239}
12,11110010,{242}
13,11011011,{219}
14,01101011,k

J-Banner Binary OR ASCII Conversion: Dot=0, L-R, T-B, Big Endian
01,01001010,J
02,01000010,B
03,10100000,{160}
04,00010100,[20]
05,00000000,[0]
06,00000000,[0]
07,00000010,[2]
08,10101101,{173}
09,00000011,[3]
10,00110010,2
11,00010000,[16]
12,00001101,[13]
13,00100100,$
14,10010100,{148}

J-Banner Binary OR ASCII Conversion: Dot=1, L-R, T-B, Little Endian
01,10101101,{173}
02,10111101,{189}
03,11111010,{250}
04,11010111,{215}
05,11111111,{255}
06,11111111,{255}
07,10111111,{191}
08,01001010,J
09,00111111,?
10,10110011,{179}
11,11110111,{247}
12,01001111,O
13,11011011,{219}
14,11010110,{214}

J-Banner Binary OR ASCII Conversion: Dot=0, L-R, T-B, Little Endian
01,01010010,R
02,01000010,B
03,00000101,[5]
04,00101000,(
05,00000000,[0]
06,00000000,[0]
07,01000000,@
08,10110101,{181}
09,11000000,{192}
10,01001100,L
11,00001000,[8]
12,10110000,{176}
13,00100100,$
14,00101001,)

Navigation

[0] Message Index

[#] Next page

[*] Previous page

Go to full version