<p>In <a href="http://channel9.msdn.com/posts/Dan/Countdown-to-PDC2008-By-Developers-for-Developers-Don-Box-and-Chris-Anderson/" rel="nofollow noreferrer">today's channel9.msdn.com video</a>, the PDC guys posted a challenge to decipher this code:</p>

<pre><code>2973853263233233753482843823642933243283
6434928432937228939232737732732535234532
9335283373377282333349287338349365335325
3283443783243263673762933373883363333472
8936639338428833535236433333237634438833
3275387394324354374325383293375366284282
3323383643473233852922933873933663333833
9228632439434936334633337636632933333428
9285333384346333346365364364365365336367
2873353883543533683523253893663653393433
8837733538538437838338536338232536832634
8284348375376338372376377364368392352393
3883393733943693253343433882852753933822
7533337432433532332332328232332332932432
3323323323323336323333323323323327323324
2873323253233233233892792792792792792792
7934232332332332332332332733432333832336
9344372376326339329376282344
</code></pre>

<p>Decipher it and win a t-shirt. (Lame, I know, was hoping for a free trip to the PDC.)</p>

<p>I notice some interesting patterns in this code, such as the 332 pattern towards the end, but I'm at a loss as to where to go from here. They've said the answer is a text question.</p>

<p>Any ideas on deciphering this code?</p>

[{'answer_id': 36304, 'author': 'Mike Stone', 'author_id': 122, 'author_profile': 'https://Stackoverflow.com/users/122', 'pm_score': 2, 'selected': False, 'text': '<p>Well, based on the 332 pattern you pointed out and the fact that the number of numbers is divisible by 3, and that several of the first 3 digit groups have matches... it might be that each 3 digits represent a character.  Get a distribution of the number matches for all the 3 digit groups, then see if that distribution looks like the distribution of common letters.</p>\n\n<p>If so, each 3 digit code could then be mapped to a character, and you might get a lot of the characters filled in for you this way, then just see if you can fill in the blanks of the less common letters that may not match the distribution perfectly.  </p>\n\n<p>A quick google search revealed <a href="https://web.archive.org/web/20080220140738/http://www.csm.astate.edu/~rossa/datasec/frequency.html" rel="nofollow noreferrer">this source for distribution of frequency</a> in the English language.  </p>\n\n<p>This, of course, may not be fruitful, but it\'s a good first attempt.</p>\n'}, {'answer_id': 36383, 'author': 'Anonymoose', 'author_id': 2391, 'author_profile': 'https://Stackoverflow.com/users/2391', 'pm_score': 2, 'selected': False, 'text': '<p>I\'m still fiddling with this -- no answer yet, or even a clear direction, but some of this random assortment of facts might be useful to someone..</p>\n\n<p><strong>Meta: Is there any way to mark "read more" in an answer?  Sorry in advance for all the scrolling this answer will cause!</strong></p>\n\n<p>The code is 708 digits long.  Prime factorization: 2 2 3 59.  Unless they\'re being tricky by padding the ends, the chunk size must be 1, 2, 4, 6, or 12; the higher factors are silly.  This assumes, of course, that the code is based on concatenated chunks, which may not be the case.</p>\n\n<p>Mike Stone suggested a chunk size of 3.  Here\'s the distribution for that:</p>\n\n<pre>\n    Number of distinct chunks: 64\n    Number of chunks: 236 (length of message)\n\n      275: ###\n      279: #######\n      282: ####\n      283: #\n      284: ####\n      285: ##\n      286: #\n      287: ###\n      288: #\n      289: ###\n      292: #\n      293: ####\n      297: #\n      323: #############################\n      324: #######\n      325: #######\n      326: ####\n      327: ####\n      328: ##\n      329: #####\n      332: ###\n      333: ###########\n      334: ###\n      335: ######\n      336: ###\n      337: #\n      338: ####\n      339: ###\n      342: #\n      343: ##\n      344: ###\n      345: #\n      346: ###\n      347: ##\n      348: ###\n      349: ###\n      352: ####\n      353: #\n      354: ##\n      363: ##\n      364: #######\n      365: #####\n      366: #####\n      367: ##\n      368: ###\n      369: ##\n      372: ###\n      373: ##\n      374: ##\n      375: ###\n      376: #######\n      377: ####\n      378: ##\n      382: ###\n      383: ###\n      384: ###\n      385: ####\n      387: ##\n      388: ######\n      389: ##\n      392: ###\n      393: ####\n      394: ###\n      449: #\n</pre>\n\n<p>If it\'s base64 encoded then we might have something ;) but my gut tells me that there are too many distinct chunks of length 3 for plain English text.  There is indeed that odd blip for the symbol "323" though.</p>\n\n<p>Somewhat more interesting is a chunk size of 2:</p>\n\n<pre>\n    Number of distinct chunks: 49\n    Number of chunks: 354 (length of message)\n\n      22: ##\n      23: ########################\n      24: #####\n      25: ######\n      26: #\n      27: ######\n      28: #########\n      29: ####\n      32: ##################################\n      33: ################################################\n      34: ###########\n      35: ########\n      36: ##############\n      37: ############\n      38: ##################\n      39: ####\n      42: ##\n      43: ###########\n      44: ###\n      45: #\n      46: #\n      47: #\n      49: ##\n      52: #\n      53: #########\n      54: ##\n      62: #\n      63: #############\n      64: ####\n      65: ###\n      66: ##\n      67: ##\n      68: #\n      72: ###\n      73: ############\n      74: #\n      75: ####\n      76: #####\n      77: #\n      79: ####\n      82: ######\n      83: ###########\n      84: #####\n      85: ####\n      88: ####\n      89: #\n      92: #########\n      93: ################\n      94: ##\n</pre>\n\n<p>As for letter frequency, that\'s a good strategy, but remember that the text is likely to contain spaces and punctuation.  Space might be the most common character by far!</p>\n\n<p>Meta: This question re-asks a question found elsewhere.  Does that count as homework? :)</p>\n'}, {'answer_id': 36505, 'author': 'Judah Gabriel Himango', 'author_id': 536, 'author_profile': 'https://Stackoverflow.com/users/536', 'pm_score': 0, 'selected': False, 'text': "<p>I wrote some C# code to scan the cipher and give me some stats back. Here are some interesting results:</p>\n\n<p>With a chunk size of 3, </p>\n\n<ul>\n<li><p>There are 236 chunks.</p></li>\n<li><p>There are 172 duplicates.</p></li>\n<li><p>The 323 code shows up a whopping\ntotal of 29 times!</p></li>\n<li><p>The 333 code shows up 11 times.</p></li>\n<li><p>All other codes show up 7 times or less.</p></li>\n<li><p>35 chunks start with a 2.</p></li>\n<li><p>200 chunks start with a 3. (Interesting!)</p></li>\n<li><p>1 chunk starts with a 4.</p></li>\n<li><p>Despite the cipher containing 2s, 3s, 4s, 5s, 6s, 7s, 8s, and 9s, chunks only start with 2 and 3, except the 1 chunk that starts with 4.</p></li>\n<li><p>There are no 0s.</p></li>\n<li><p>There are no 1s.</p></li>\n<li><p>There are 115 2s.</p></li>\n<li><p>There are 293 3s.</p></li>\n<li><p>There are 56 4s.</p></li>\n<li><p>There are 38 5s.</p></li>\n<li><p>There are 49 6s.</p></li>\n<li><p>There are 52 7s.</p></li>\n<li><p>There are 63 8s.</p></li>\n<li><p>There are 42 9s.</p></li>\n</ul>\n\n<p>I'd describe the 323 appearance count highly irregular. I'd also suggest that the fact that all of the chunks start with either 3 or 2 (barring the 1 appearance of a 4 chunk) is also highly irregular.</p>\n\n<p>I've ran the same analysis using chunks of 2, 4, and 8, and the results look more or less random. At this point, I'm leaning towards a 3 chunk.</p>\n"}, {'answer_id': 36830, 'author': 'Lasse V. Karlsen', 'author_id': 267, 'author_profile': 'https://Stackoverflow.com/users/267', 'pm_score': 0, 'selected': False, 'text': "<p>I'd say that anyone that finds the answer should keep it to themselves, and instead of posting it should just add a note that you can go read a particular url to find it, or send someone an email or something if they want to know the answer to it. At the time when Channel9 says its broken or posts the answer themselves, post it here, but until then, just let the discussion and pondering going. Much better for the brain.</p>\n"}]
['https://Stackoverflow.com/questions/36296', 'https://Stackoverflow.com', 'https://Stackoverflow.com/users/536/']