HackerPapers

arXiv:1404.0390cs.DS

Further scramblings of Marsaglia's xorshift generators

Sebastiano Vigna

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

xorshift* generators are a variant of Marsaglia's xorshift generators that eliminate linear artifacts typical of generators based on $\mathbf Z/2\mathbf Z$-linear operations using multiplication by a suitable constant. Shortly after high-dimensional xorshift* generators were introduced, Saito and Matsumoto suggested a different way to eliminate linear artifacts based on addition in $\mathbf Z/2^{32}\mathbf Z$, leading to the XSadd generator. Starting from the observation that the lower bits of XSadd are very weak, as its reverse fails systematically several statistical tests, we explore xorshift+, a variant of XSadd using 64-bit operations, which leads, in small dimension, to extremely fast high-quality generators.

arXiv comments
arXiv admin note: text overlap with arXiv:1402.6246
Journal reference
DOI
Subjects
cs.DSData Structures and Algorithms cs.CRCryptography and Security cs.MSMathematical Software

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Dec 2015 to Dec 2015.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Testing Math.random(): Crushing the browser 1 comment

    • What research went into choosing XorShift128+? (Paper is apparently http://arxiv.org/pdf/1404.0390.pdf, which makes it seem like this still has quite a few failures on randomness tests.) Were any PRNG experts consulted? Did these folks consider http://www.pcg-random.org ? This…

      jacobolusView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.