Uncommons Maths: High-Performance RNGs for Java

The Uncommons Maths Open Source library offers a collection of five easy-to-use, statistically sound, high-performance pseudorandom number generators (RNGs) for Java applications. Developed by Daniel W. Dyer, this library provides robust RNG options for various use cases.

Key Features:

• MersenneTwisterRNG: Fast and reliable RNG with a long period


• XORShiftRNG: Very fast PRNG for optimal performance


• CMWC4096RNG: Complementary-Multiply-With-Carry RNG with an extremely long period


• AESCounterRNG: Cryptographically-strong non-linear RNG


• CellularAutomatonRNG: Utilizes a 256-cell automaton to generate random values

Technical Specifications:

• Language: Java


• License: Open Source


• Developer: Daniel W. Dyer


• Price: FREE

MersenneTwisterRNG

The Mersenne Twister RNG, originally developed by Makoto Matsumoto and Takuji Nishimura, offers speed, reliability, and a long period of randomness.

XORShiftRNG

George Marsaglia's XORShiftRNG provides fast pseudo-random number generation with a shorter period than Mersenne Twister but excellent performance.

CMWC4096RNG

The CMWC RNG by George Marsaglia offers a long period alternative to Mersenne Twister and comparable performance.

AESCounterRNG

For cryptographic applications, AESCounterRNG offers strong non-linear number generation, faster than java.security.SecureRandom.

CellularAutomatonRNG

Tony Pasqualoni's Cellular Automaton RNG uses a 256-cell automaton for quick random value generation in Java.

Explore the Uncommons Maths library for reliable and efficient RNG solutions in your Java projects. Download it for FREE from SoftPas today!