RXOR is described as a 1-bit left-shift rotation performed on the current hash value before each block (in sequence) is being XOR-ed with it. That is, process each successive n-bit block of data: a. Rotate the current hash value to the left by one bit. b. XOR the block into the hash value. Is it true that the following bit flips result in finding a message different than the original and that this new message "produces" the same hash