Squares: A Fast Counter-Based RNG

04/14/2020
by   Bernard Widynski, et al.
0

In this article, we present a new counter-based random number generator (RNG) based on John von Neumann's middle square. We've discovered that only three rounds of squaring are sufficient to provide satisfactory random data. This appears to be one of the fastest counter-based RNGs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/15/2020

Some complete ω-powers of a one-counter language, for any Borel class of finite rank

We prove that, for any natural number n ≥ 1, we can find a finite alphab...
research
08/01/2022

Parsimonious Argument Annotations for Hate Speech Counter-narratives

We present an enrichment of the Hateval corpus of hate speech tweets (Ba...
research
08/26/2020

Countdown games, and simulation on (succinct) one-counter nets

We answer an open complexity question by Hofman, Lasota, Mayr, Totzke (L...
research
10/07/2019

The Well Structured Problem for Presburger Counter Machines

We introduce the well structured problem as the question of whether a mo...
research
01/27/2020

Explaining with Counter Visual Attributes and Examples

In this paper, we aim to explain the decisions of neural networks by uti...
research
11/02/2016

Deep counter networks for asynchronous event-based processing

Despite their advantages in terms of computational resources, latency, a...
research
01/19/2022

Sensing Method for Two-Target Detection in Time-Constrained Vector Poisson Channel

It is an experimental design problem in which there are two Poisson sour...

Please sign up or login with your details

Forgot password? Click here to reset