Heh. I just spotted this old entry from Jim Weirich's blog:

<paulv>    matthew immediately declared that we were already cracked. :)
<matthew>  yeah, it's all good.  Although, can you prove you're Jim?
<jweirich> yes
<jweirich> ask me a Ruby question
<paulv>    implement the Y-combinator!
<matthew>  heh
<paulv>    then I'll believe.
<jweirich> p proc { |le|
<jweirich>   proc { |f| f.call(f) } \
<jweirich>   .call ( proc { |f|
<jweirich>            le.call (proc { |x| f.call(f).call(x) }) })
<jweirich> }.call(proc { |recurse|
<jweirich>   proc { |n|
<jweirich>     if n == 0 then
<jweirich>       1
<jweirich>     else
<jweirich>       n * recurse.call (n-1)
<jweirich>     end
<jweirich>   }
<jweirich> }).call(5)  
<matthew>  wow.  This is better than gpg keys.
<matthew>  I hope you had that laying around 
<jweirich> nah, did it from memory ;)
<paulv>    this *is* better than GPG keys.

Gotta love that right there.