A node.js module for generating high-quality Mersenne Twister random numbers.
Mersenne twister pseudorandom number generator
A fast Mersenne Twister
TypeScript definitions for mersenne-twister
A 32-bit Mersenne Twister pseudorandom number generator.
A native JS implementation of the Mersenne Twister PRNG.
This is a polyfill for `window.crypto.getRandomValues()`. In place of `Math.random()` it uses the [Mersenne Twister pseudorandom number generator](https://github.com/boo1ean/mersenne-twister) seeded by `Math.random()`.
functional implementation of Mersenne Twister
Mersenne Twister random numbers
Configurable Mersenne Twister PRNG implementation written in TypeScript.
Configurable Mersenne Twister implementation.
The Mersenne Twister implementation for Chance.js.
Calculate a Mersenne number
Create an iterator for a 32-bit Mersenne Twister pseudorandom number generator.
Mersenne Twister 19937 generator
Create a readable stream for a 32-bit Mersenne Twister pseudorandom number generator.
Class representing a pseudorandom number manager. Includes Mersenne Twister uniform distribution, Box Mueller gaussian distribution, n-sided die rolling, history of variable max size, elementary statistics, and scale/clip/round convenience functions.
A high-performance Mersenne Twister implementation for JavaScript.
checks if a number is a known mersenne prime
A Mersenne twister
Generates random number for Nodejs (and browser) using Mersenne Twister.
A serializable Mersenne Twister
Check if the given number is a mersenne prime or not.
A lightweight TypeScript library for probabilistic branching and random selection, powered by the Mersenne Twister algorithm.
This package provides function to generate Mersenne number and test primality with Miller-Rabin Algorithme
A lightweight, no_std-friendly random number generator backed by Xoshiro256++ with optional Mersenne Twister support.
Mersenne Twister pseudorandom number generator
Rust implementation of Mersenne Twister PRNG algorithm
mersenne twister pseudorandom number generator
porting Mersenne Twister to Rust
Mersenne field operations
Universal Random Number Generator
Make random number based on Mersenne twister.
An implementation of the Mersenne31 prime field F_p, where p = 2^31 - 1.
Reference Mersenne Twister random number generators.
Hash rope: a BB[2/7] balanced binary tree with polynomial hash metadata for O(log n) concat, split, substring hashing, and O(log q) repetition encoding.
A Mersenne-Twister random number generator (RNG) packed up as a class. This allows multiple RNG streams to be active at the same time (which Ruby's normal rand/srand does not allow). The Mersenne-Twister is implemented with fast C code for speed.
ISAAC is a fast, cryptographically secure pseudo random number generator with strong statistical properties. This gem provides both a pure Ruby and a C extension based implementation which conforms to the Ruby 2 api for Random, with some enhancements. So, you should be able to use it as a drop in replacement for Ruby's (Mersenne Twister based) PRNG.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.