I don&#x27;t know enough about SHA256 to say whether or not it&#x27;s good enough, I&#x27;ll assume it is.<p>Performant enough strongly depends on the game. However looking at the implementation of the algorithm on wikipedia[0], that looks extremely slow by RNG standards. Most RNGs finish in a handful of instructions, but building the &#x27;message schedule array&#x27; takes 64 steps, and the &#x27;main compression loop&#x27; also takes 64 steps. Consider that to reduce these to a range you&#x27;ll have to throw out iterations (you need to do this with any RNG to avoid bias), you&#x27;re looking at a lot of wasted time.<p>Maybe you can afford to waste that time, but given that there are much simpler and more efficient RNG algorithms, I&#x27;m not sure why you wouldn&#x27;t use one of those.<p>[0]: <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;SHA-2#Pseudocode" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;SHA-2#Pseudocode</a>