> If PRNG sequence is reused to generate more shuffles, then the next shuffle can be predicted from the previous one. That's theoretically true by a counting a

> If PRNG sequence is reused to generate more shuffles, then the next shuffle can be predicted from the previous one. That's theoretically true by a counting argument, but for a CSPRNG the only way to compute that next shuffle costs about as much computationally as brute force. 128 bits is enough to make that infeasible, though 256 may be preferable for the usual abundance of caution. The number of permutations doesn't matter here, since an attack becomes computationally infeasible before it becomes counting infeasible. It's also possible for a practical attack to exist even when the output can't be predicted exactly, since statistical information is still valuable.