Knuth describes in "the art of computer programming part 2" an algorithm called "M" for mixing two streams of random numbers. This can be used to mix random number streams giving the assurance that the result is still random even if one (but only one) of the streams suddenly becomes predictable.

Now I have a situation where I do have two streams but they're asymmetrical: one produces +/- 800 bytes per second, the other +/- 340.

My question now is: what can I do so that I can still combine these two and accomplish the same as Knuth's algorithm?

I was thinking of "just feeding them to a hash" and use that result.
What do you think?


Question: Search predictions broken in Chrome - reinstall didn't solve the problem
Answer: After trying @ZacB's suggestion, it still didn't work. Removing all Chromium's settings and rebooting the computer also didn't work, so I concluded that the Chromium version I was running must be buggy.

Updating Chromium fixed it for me.