asciilifeform: incidentally ( and luckily for asciilifeform ) asciilifeform is not left-handed : left-handers were savagely beaten on asciilifeform's home world
asciilifeform currently making an efficient seekritshift, it is somewhat tricky
asciilifeform: can i persuade you to write this out as algo , apeloyee ?
asciilifeform: apeloyee: maybe i'm thick, but i don't see how to grind 'shift so b has one digit less than a' a fixed number of times for all possible a and b.
asciilifeform: pretty sure you just described lehmer's gcd, actually
asciilifeform: thing has to take exactly.same.number.of.steps. regardless of what a,b equal.
asciilifeform: same thing we do for the wholeword shift
asciilifeform: ( first : 'maybe shift by 1' , second : 'maybe by 2', last : ' ... by 32' )
asciilifeform: ( example : if wordbitness is 64, any subword shift is from 0 .. 63, and therefore can be expressed using 6 muxgated shifts . )
asciilifeform: though it does look like it'll have to do log2(wordbitness) shifts for the initial subword slide, rather than 1, to avoid leaking on machines without barrel