PAC’S WEEKLY WRAP-UP: OCTOBER 23, 2016

Three codes were found in the PAC’S WEEKLY WRAP-UP: OCTOBER 23, 2016 post on the Investigate Ingress blog.

[1] bcbbbbccdbcdgcbbecbbddfcbebdbdbccbbbbdcbccdcbdbbbbbcdbcccbbbcdcbccbcdcbbbbbdbbdebbb

[2] xlhgvvrwwzzrptpnihhpkgafctille

[3] eedpnbeecsilniytnaigthecnhhrbketrego

Code #1

Observations

All letters ranging between B & G and lots of them repeating.

Code #2

Observations

30 letters with no particular range.

Code #3

Observations

36 letters… that a perfect square!

  • Pieter Schutz

    Can you elaborate a bit on code 1?
    I googled run length encoding but I don’t see how you got from the string with numbers to the binary using un length.

    • Marc Belanger (keyclick)

      Sure, I’ll provide a small example. Let’s say the string is 12341234. Each single digit specifies the amount of bits you need to put. In the case of binary you alternate between 0 and 1 for each digit:

      1 is 1×0 = 0
      2 is 2×1 = 11
      3 is 3×0 = 000
      4 is 4×1 = 1111
      1 is 1×0 = 0
      2 is 2×1 = 11
      3 is 3×0 = 000
      4 is 4×1 = 1111

      Final result is 01100011110110001111

      • Pieter Schutz

        thanks, that cleared it up.