按年被提到
20232024 · 2 次2026
算法与数据结构›哈希、压缩与向量化·arXiv:2312.17043 · cs.CE

Collatz-Weyl Generators: High Quality and High Throughput Parameterized Pseudorandom Number Generators

Tomasz R. Działa · 2023
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2024-03-08 · 最近 2025-10-29
2不同的人
2活跃月份
3讨论串
1被引(OpenAlex)
arXiv 摘要(候选层不写导读)

We introduce the Collatz-Weyl Generators, a family of uniform pseudorandom number generators (PRNGs) which are based on generalized Collatz mappings, derived from the Collatz conjecture and Weyl sequences. The high-quality statistical properties of our generators is demonstrated by the fact that they pass stringent randomness tests used by the research and standardization community. The proposed Collatz-Weyl Generators have a number of important properties, including solid mathematical foundations, enablement of high throughput and low latency implementation, small code and/or ASIC size, enablement of producing multiple independent streams and potential of support of cryptographic applications.

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

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论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]原评论 ↗
被提交为 story · 1 次