From: admin@nospicedham.127.0.0.1   
      
   On Fri, 16 Jun 2017 20:15:29 +0100, wolfgang kern  wrote:   
      
   > Kerr Mudd-John wrote:   
   >   
   >>> seems I played this game for too long...   
   >>> my brain works still on it even when I sleep :)   
   >   
   >>> Terje asked for another 2:1 algo:   
   >>> I gave up on the hex idea because of the sub 07 and the missing   
   >>> first/second indicator, but why not use the given ranges a bit   
   >>> different ?   
   >>> So a 4+4 bit algo may use the low nibble of "A...P" (41..50) to   
   >>> produce 10..f0 (00 with 50) by shl,4 from first byte and 01..0f   
   >>> of "a..p"(61..70) by AND&OR from every second byte.   
   >   
   >>> in addition I made use of many filler bytes to modify alot:   
   >   
   >>> ZRRh61XPR560PRR4dPjDa-rY1G`Ss$anytext#<=t7r4>> 66hwAX(G%(g/(G3(g8(g9(G0)G1(g:eeee+++   
   >   
   >>> it didn't become shorter than the xor-sub-sub would show with my   
   >>> extended use of printable characters. Just an idea   
   >   
   >> Glad to see you're sleeping well!   
   >   
   > at least I'm not tired when I wake up after dreaming well :)   
   >   
   >> Lots of fixups in there; well done on using the jmp space!   
   >I also tried to replace the two nops right after the CRLF with:   
   > dec bx |dec bx                                    ;,   
   > and then adjust already 'slid' [bx+..] modifications for the second   
   > line followed by pop bx | push bx.   
   > It works too, but it isn't any shorter.   
   >   
      
   You inspired me to think of a horrible^w brilliant scheme, but this margin is   
   too small to contain it.   
      
      
   --   
   Bah, and indeed, Humbug   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)