This question is about Tyche, a non-cryptographic PRNG. While the PRNG is not cryptographic the analysis and this question surely is heavily involved with cryptography, so I think it's on-topic here.
In short, Tyche is a nonlinear PRNG based on the ChaCha quarter-round function. The state (4 words $a, b, c, d$) gets mixed using the $MIX$ function (which is basically the ChaCha quarter-round), and then a part of the state gets returned. This is the $MIX$ function in pseudocode:
MIX(a, b, c, d):
a = a + b
d = (d ^ a) <<< 16
c = c + d
b = (b ^ c) <<< 12
a = a + b
d = (d ^ a) <<< 8
c = c + d
b = (b ^ c) <<< 7
Later the authors propose a faster variant (due to instruction level parallelism), where the inverse of $MIX$ is used, $\textit{MIX-i}$:
MIX-i(a, b, c, d):
b = (b >>> 7) ^ c; c = c - d
d = (d >>> 8) ^ a; a = a - b
b = (b >>> 12) ^ c; c = c - d
d = (d >>> 16) ^ a; a = a - b
Then the authors note the following (emphasis mine):
The downside, however, is that $\textit{MIX-i}$ diffuses bits slower than $MIX$ does: for 1-bit differences in the internal state, 1 $MIX$ call averages 26 bit flipped bits, while $\textit{MIX-i}$ averages 8.
I don't exactly know how to interpret this note.
- Why is this a downside?
- Does this mean the quality of the PRNG is less?
- By default the initial constant state (in $c$ and $d$) gets mixed with the seed (in $a$ and $b$) using 20 calls to $MIX$. Does it need more iterations to initialize the PRNG when using $\textit{MIX-i}$?
- It surely can't affect period length since it's the inverse, right?