CRApr 2, 2017

Middle-Square Weyl Sequence RNG

arXiv:1704.00358v710 citations
Originality Synthesis-oriented
AI Analysis

This work addresses the need for reliable random number generation in computational applications, but it is incremental as it builds upon an existing method.

The authors tackled the problem of improving John von Neumann's middle-square random number generator by proposing a new implementation that uses a Weyl sequence to maintain a long period, resulting in a more stable and extended random number generation process.

In this article, we propose a new implementation of John von Neumann's middle-square random number generator (RNG). A Weyl sequence keeps the generator running through a long period.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes