Pith. sign in

REVIEW 1 cited by

Computationally easy, spectrally good multipliers for congruential pseudorandom number generators

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2001.05304 v3 pith:X5UEIGTD submitted 2020-01-15 cs.DS

Guy Steele , Sebastiano Vigna This is my paper · ORCID
classification cs.DS
keywords goodmultipliersgeneratorscongruentialeightnumberpseudorandomanalyzing
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Congruential pseudorandom number generators rely on good multipliers, that is, integers that have good performance with respect to the spectral test. We provide lists of multipliers with a good lattice structure up to dimension eight and up to lag eight for generators with typical power-of-two moduli, analyzing in detail multipliers close to the square root of the modulus, whose product can be computed quickly.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. (How) Can Transformers Predict Pseudo-Random Numbers?

    cs.LG 2025-02 conditional novelty 7.0 of 10

    Transformers predict LCG sequences in-context for fixed moduli up to 2^32 and unseen moduli up to 2^16 by learning the modulus factorization and digit-wise periodic structure.

Pith tools