Skip to main content
added 326 characters in body; added 161 characters in body
Source Link

You can use the same seed on 2 parallell processes, and if they start in the same general (in GHz processor terms) timeframe they will have the same exact seed to the static seed. Or most languages if seeded with the same static seed will have the same numerical generation (Java's a good RNG example of this API style).

To combat the inherent static predictability of this, RNG's are usually seeded with the internal system time down to micro or nano second range, giving high unpredictability in the long run and near impossible ability to predict based on time in the short, since it's internal crystal clock cycles that feed up to the API.

As an aside: all numbers generated by machines will be pseudo-random, but close enough for government work.

To get a numerical range you want just take the integer modulo (integer_range_max) of the RNG value [0-1). So RNG * Modulo % Modulo will give you the range.

You can use the same seed on 2 parallell processes, and if they start in the same general (in GHz processor terms) timeframe they will have the same exact seed to the static seed. Or most languages if seeded with the same static seed will have the same numerical generation (Java's a good RNG example of this API style).

As an aside: all numbers generated by machines will be pseudo-random, but close enough for government work.

You can use the same seed on 2 parallell processes, and if they start in the same general (in GHz processor terms) timeframe they will have the same exact seed to the static seed. Or most languages if seeded with the same static seed will have the same numerical generation (Java's a good RNG example of this API style).

To combat the inherent static predictability of this, RNG's are usually seeded with the internal system time down to micro or nano second range, giving high unpredictability in the long run and near impossible ability to predict based on time in the short, since it's internal crystal clock cycles that feed up to the API.

As an aside: all numbers generated by machines will be pseudo-random, but close enough for government work.

To get a numerical range you want just take the integer modulo (integer_range_max) of the RNG value [0-1). So RNG * Modulo % Modulo will give you the range.

Source Link

You can use the same seed on 2 parallell processes, and if they start in the same general (in GHz processor terms) timeframe they will have the same exact seed to the static seed. Or most languages if seeded with the same static seed will have the same numerical generation (Java's a good RNG example of this API style).

As an aside: all numbers generated by machines will be pseudo-random, but close enough for government work.