asciilifeform: ( homework to reader: prove that this works.. )
asciilifeform: pretty 'martian' algo for the usual O(N^2) mults, but notably it doesn't need a full Z's worth of temporary row space, but only 3 words' , ~regardless of Z width~ !
asciilifeform: and has to ponder, 'who should it be'
asciilifeform: brings to mind this old '40s sf tale, where 2 d00dz are exonerated of murder after doing 20y on the toughest prison planets, with giant wasps & similar joys, and so each gets a 'murder pass' to actually do the thing he already sat for
asciilifeform: '...the public defender’s office has filed approximately 2,000 motions informing the court that, due to its reportedly imperfect software, many of its clients have been forced to serve unnecessary jail time, be improperly arrested, or even wrongly registered as sex offenders.' << lol!!
asciilifeform: orlol's tub somehow got by with... 35hp
asciilifeform: ( just as in the old smoking gun, where it came out that nsa delayed the introduction of POPCOUNT instr )
asciilifeform: i wouldn't even be surprised if the explanation for this turns out, in the end, to be an usgological one
asciilifeform: Because It Would Be Wrong (tm)(r)(uncle al)
asciilifeform: it is mind-boggling, ~all major cpu have had 2word-outputting MUL instr for, what, 30 years. and NO compiler actually gives you, by default, the top half of it !!
