Linux takes the highest, the most significant byte and increments it every five minutes.

A branch that was exactly 256 words further down would end up having the same least significant byte of address.

Big endian architectures instead order them with the most significant byte at the lowest-numbered address.

Take the lowest 7 bits and that gives you the least significant byte (0000 1001).

So in the above example, D, the least significant byte, goes into slot 0.

In a round, the least significant byte of half of the block is passed into the 8x32-bit S-box.

The second argument's least significant byte is written to the file.

It is sent as a pair of characters, the least significant byte first.

Which means the least significant byte of the subtraction could be zero, even though the rest of them are not.

Note that at this point the most significant byte may not contain a valid decimal number.