-
This are my personal requirements for picking a default small PRNG. It seems like we should have some set of requirements to apply to https://github.com/dhardy/rand/issues/52, beyond benchmarks.
@dha…
-
| | |
|------------------|-----------------|
|Previous ID | SR-5197 |
|Radar | rdar://problem/32718853 |
|Original Repor…
-
There's a variety of modern PRNG algorithms we could choose from, with various tradeoffs around speed, memory, predictability, complexity, miscellaneous statistical properties, and also amenability to…
-
The current default random seeding approach is to set the seed for each run as equal to the run number, e.g. run number 5 includes `set.seed(5)`. This should be clearly documented in at least two plac…
-
From what I've read, Xoroshiro is often suggested as the fastest RNG with decent random properties. Using the implementation here, I do see it beating Base's MT for small samples, but getting relati…
-
In case anyone is running this anywhere else (*BSD, mac, distros using musl/...) the tests
will fail because srandom() can be (and is) implemented as the authors of the C library wish.
Simplest solut…
loreb updated
8 years ago
-
On https://github.com/rust-lang/rfcs/pull/2106#issuecomment-346610377 I argued that `rand` should not provide any specific/named rngs (so no ChaChaRng, XoroShiro, etc.) but instead provide a very smal…
-
Currently, `util/Random.cpp` contains two harmful functions:
void Seed(unsigned int seed)
void ClockSeed()
Seeding should *always* be done for the full state of the object (not just 32 …
-
Some PRNGs have state which is similar in size to their seed, but a lot of them have much more internal state. For example, Mersenne twisters (which we should not actually use, it's just a dramatic ex…
-
Hi, would like to check if it is normal for the program to stop at each line when it reaches "suppose the index of the last flawless IV of 1st pokemon is".
Example in this case:
It stopped at this…