按年被提到
20172024 · 2 次2026
数学、逻辑与理论›数学猜想与重大证明·arXiv:1704.00358 · cs.CR

Middle-Square Weyl Sequence RNG

Bernard Widynski · 2017
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2023-02-17 · 最近 2025-10-29
2不同的人
3活跃月份
5讨论串
5被引(OpenAlex)
arXiv 摘要(候选层不写导读)

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.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论camel-cdr · 2023-02

“A history of PRNGs without mentioning George Marsaglia is heresy. Also, PCG didn't stop the development. Nowadays, modern PRNGs explore the usage of chaotic PRNGs (without a fixed period), which are often faster than non-chaotic ones. Notable examples are the Romu family [0] of PRNGs and sfc [1], and tylov's sfc derivative [2]. Another thing that would …”

A Brief History of Random Numbers原评论 ↗
评论camel-cdr · 2024-03

“I like how the earliest and easiest PRNGs are making a comeback: First middle square method, just add a weyl sequence to it, and all statistical tests stop failing [0] uint64_t x, weyl; uint32_t msws(void) { x = x * x + (weyl += 0xB5AD4ECEDA1CE2A9); return x = (x >> 32) | (x << 32); } And now Collatz, just add a weyl sequence to it, and all statistical …”

A Primer on Randomness原评论 ↗
评论camel-cdr · 2024-03

“I like how the earliest and easiest PRNGs are making a comeback: First middle square method, just add a weyl sequence to it, and all statistical tests stop failing [0] uint64_t x, weyl; uint32_t msws(void) { x = x * x + (weyl += 0xB5AD4ECEDA1CE2A9); return x = (x >> 32) | (x << 32); } And now Collatz, just add a weyl sequence to it, and all statistical …”

History of Uniform Random Number Generation (2017) [pdf]原评论 ↗
评论camel-cdr · 2025-10

“A history about random number generation isn't complete without mentioning George Marsaglias work. He is responsible for multiply-with-carry, xorshift (the original version), KISS (a high quality generator predating the mersene twister), the Ziggurat algorithm, diehard Fun fact, one of the earliest methods for generating random mumbers, the middle squa…”

A brief history of random numbers (2018)原评论 ↗
被提交为 story · 1 次