You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Is it possible to define a function that can produce a PCG that has a full period, with state size n, for any n in [8, 32]? Is it possible for us to do that? Or is such a function already here?
This PCG info site says the period can be "Arbitrary" so it sounds like that should be possible?
I need this for, essentially, shuffling a large configuration-space. (I initially tried to use symmetric ciphers for this, but they're naturally not very supportive of very very small messages or non power of two bit lengths. Nor will RNGs be, but I figured PCGs might be easier to adapt than any symmetric ciphers.)
Oh and by the way, do you do non power of two modulos here? (modulos of the state, not just the output)
(this would be ideal, but I'll be fine as long as I'm within the nearest power of two)
The text was updated successfully, but these errors were encountered:
Is it possible to define a function that can produce a PCG that has a full period, with state size n, for any n in [8, 32]? Is it possible for us to do that? Or is such a function already here?
This PCG info site says the period can be "Arbitrary" so it sounds like that should be possible?
I need this for, essentially, shuffling a large configuration-space. (I initially tried to use symmetric ciphers for this, but they're naturally not very supportive of very very small messages or non power of two bit lengths. Nor will RNGs be, but I figured PCGs might be easier to adapt than any symmetric ciphers.)
Oh and by the way, do you do non power of two modulos here? (modulos of the state, not just the output)
(this would be ideal, but I'll be fine as long as I'm within the nearest power of two)
The text was updated successfully, but these errors were encountered: