“Stroke Theory”

“Would you bet 100$ on this new theory, Prof. Feynman?” — “No, but 10$ I would.”
(Richard Feynman, attributed)

This is my personal pet theory which I’ve entertained for some time.

I’m not really convinced that I’ve got the correct solution here, but I think this scheme would explain several of the characteristics of the VM, while not being completely implausible. Unfortunately, this theory introduces a whole lot of degrees of freedom, so it’s a bit difficult to actually test.

Anyway, I’ll explain the general idea and let you decide for yourselves. The basic idea is to disassemble the letters which make up the plaintext into their individual penstrokes (or, if you start with printed text, disassemble them into their graphical elements). Later, each of these penstrokes is assigned one of the VM letters — voila, instant encipherment!

See a detailled discussion of the Mark I of this algorithm. I wasn’t really statisfied with it, but when I came across Robert Firths notes, I had a relevation and modified the algorithm to Mark II, its current incarnation.

9 thoughts on ““Stroke Theory”

  1. Pingback: A game of tag « Thoughts about the Voynich Manuscript

  2. Pingback: Testing the Stroke theory, Round 1 (Voynich leads by points) « Thoughts about the Voynich Manuscript

  3. Pingback: Top Ten Bad Signs that your theory is likely wrong « Thoughts about the Voynich Manuscript

  4. Pingback: Safety in Numbers (Roman and Arab) « Thoughts about the Voynich Manuscript

  5. Pingback: Higher Stroke Count « Thoughts about the Voynich Manuscript

  6. Pingback: We put the “Brute” in the “Force” | Thoughts about the Voynich Manuscript

  7. Makes sense to me.
    Just a weidr thought: Has anyone ever considered that the word boundaries may be shifted to one side adding extra “security”? Itw ouldm akeo nev erys implec ypher tow irtey eto neh ardert or ead.

    • I don’t think anybody ever looked at it from this particular angle. But considering that some phrases are almost always word-initial in the ciphertext (“qo”, for example) and other are word-terminal (“dy”), I’m quite convinced that ciphertext words do not map 1:1 to plaintext words anyway. It would also be hard to reconcile that find with your model of shifted spaces.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s