The bit shifts were my first idea too where this would break down; but actually, 1-8 bit shifts would be just fine, and they can be encoded in 3 bits. 0 and 9 are special cases anyway (nop and full nonyte/nyte) for the programmer/compiler to become a tiny bit more clever; or use the shift-by-register instruction instead. T
This is not the case for 18 or 36 bits; I would imagine an architecture like this wouldn’t have a swap/swapb but a shuffle type instructions to specify where each nyte is expected to end up, encoded in 4x2 bit in the most generic case.
With this, I think I can get behind the 9-bit archs with the niceties described in the post..
In the UK, similar situations are common when “someone” flags any transaction to or from you as suspicious, at which point they need to freeze it, report it to an appropriate branch of an organisation, and… wait. That organisation most of the times doesn’t respond, so the hold expires in about two weeks, and then everything resumes working.
The thing is, noone can be told of this freeze/hold, that would be mean tipping off the party that made the suspicious transaction - from what I gather, it’s actually illegal to reveal it’s frozen, so they invent all kinds of meaningless/dumb reasons why the transaction (or the account) can’t be used right now.
So, lack of transparency and accountability IS the purpose of the system in that case.
This is not the case for 18 or 36 bits; I would imagine an architecture like this wouldn’t have a swap/swapb but a shuffle type instructions to specify where each nyte is expected to end up, encoded in 4x2 bit in the most generic case.
With this, I think I can get behind the 9-bit archs with the niceties described in the post..