-
Section 1.3.1 seems to incorrectly indicate that the default PRNG is Mersenne not PCG64.
```
np.random: random numbers (Mersenne Twister PRNG):
```
This conflicts with the actual behavior:
…
-
Let `r` be the radix of representation, then computing `x % r^k-1` can be reduced using the following identity (with `R = r^k`):
```
x = x % R + x // R (mod R-1)
```
See https://en.wikipedia.o…
-
### Game and System Information
- **Version:** 1.16.3
- **Downloaded from:** Arch Linux repository
- **Build info:** x86_64
- **OS:** Arch Linux
### Description of the bug
While Mersenne Twist…
renom updated
6 months ago
-
Clear structured code.
6a
Report incomplete
6a(
-
The graph at the bottom of [this page](https://www.mersenne.org/primes/.) can be used to infer exponents that are probabilistically likely to be prime (i.e., by using the standard deviation of the gra…
-
We rely on rand for random numbers. Is this as good as Mersenne Twister? (If not, it would be better to implement Mersenne Twister.)
We rely on statrs for Normal distribution functions. How accurat…
-
uniform_mersenne is using memory proportional to the range of numbers it generates
If asked to generate 3 numbers between 0 and 1000000000 the memmory allocated will be for an array 1000000000 big.…
-
There exists a slower mersenne twister that computes 64 bits of random values instead of 32.
Maybe we should document this fact for users that are concerned with higher quality random numbers?
wolfv updated
6 years ago
-
Seeing as this repo inherits lots of code from https://github.com/ekzhu/datasketch, it should be noted that the implementation of mersenne prime hashing used in both repos causes overflows, and poten…
Apsod updated
5 months ago
-
## Checklist
> Please ensure the following tasks are completed before submitting a feature request.
- [x] Read and understood the [Code of Conduct][code-of-conduct].
- [x] Searched for …