[tiler]

SpamMimic works by using a context free probabilistic grammar to derive its output. Each production of the grammar is translated into a Huffman tree based on the probabilities assigned to each variable or terminal symbol in the production.

For example:

  S -> A(.25) | B(.75)
  A -> aS(1.0)
  B -> bS(.75) | b(.25)

You simply feed the mimic function an encoded message (as a binary string) until you consume all the bits. Of course you can also pad the bit string so that it always terminates on a terminal symbol.

I wrote a program not too long ago that took some inspiration from SpamMimic and linguistic steganography in general. For fun I used the comments from this thread as input to my program:

  So why not send it as spam? The key here is hiding in this approximately 95% of HN.

  So why not send spammer--not a spy.

  For my favourite variation seems rather inefficient. It should be possible output 
  can be used already, and you just look for in spam thousands of people with it. 2. 
  Also send lots of receiving person and a Novel Vertex Coding and identify the 
  system being used, it's used to encoding and identify the fake spam. Appendix 
  B gives an enemy (Kerckhoffs's principle).

  [1]: https://github.com/rw/tweetfs

  Plainsight uses each byte of the

The encoded message is: 'meet at 3'