YAyamrzou·Oct 5, 2020
Link to the post's author's annotated version of the algorithm: https://github.com/colmmacc/s2n/blob/7ad9240c8b9ade0cc3a403a...
In Dissecting Lemire's nearly divisionless random number generatorcolmmacc
s2n
C2020–2020
colmmacc / s2n
s2n
s2n : an implementation of the TLS/SSL protocols
2Distinct people
2Mentions
0Explicit recommenders
5GitHub stars
What to know before exploring
What it is
s2n : an implementation of the TLS/SSL protocols
GitHub
Where it is used
No documented product use has been verified yet.
What people are saying
No recommendation phrase was found in the indexed comments.
No classified warning is attached to this page. Read the discussions before treating silence as approval.
Also in these discussions
No other repository is repeatedly linked in the same discussions.
This week on Hacker News
Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:56:07 PM UTC.
No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.
Mentions over time
HN mentions by hour2 dated mentions
Observed mentions: 2020-10-05 01:34:16 UTC to 2020-10-05 06:37:37 UTC.
Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.
View mention counts and date ranges
| Period | Start (UTC) | End (exclusive, UTC) | Mentions | Submissions | Comments |
|---|---|---|---|---|---|
| Oct 5, 01:00 | 2020-10-05 01:00:00 UTC | 2020-10-05 02:00:00 UTC | 1 | 0 | 1 |
| Oct 5, 02:00 | 2020-10-05 02:00:00 UTC | 2020-10-05 03:00:00 UTC | 0 | 0 | 0 |
| Oct 5, 03:00 | 2020-10-05 03:00:00 UTC | 2020-10-05 04:00:00 UTC | 0 | 0 | 0 |
| Oct 5, 04:00 | 2020-10-05 04:00:00 UTC | 2020-10-05 05:00:00 UTC | 0 | 0 | 0 |
| Oct 5, 05:00 | 2020-10-05 05:00:00 UTC | 2020-10-05 06:00:00 UTC | 0 | 0 | 0 |
| Oct 5, 06:00 | 2020-10-05 06:00:00 UTC | 2020-10-05 07:00:00 UTC | 1 | 0 | 1 |
What Hacker News says
2 sourcesFor Question 1, you can turn division by a known constant into multiplications + bitshifts using a library like `libdivide`[1]. Then, we could use the regular rejection sampling algorithm mentioned in the annotated code [2].
I'd be curious how the naive rejection sampling algorithm's performance compares to Lemire's algorithm's when both are updated to use libdivide...
[1] https://libdivide.com/
[2] https://github.com/colmmacc/s2n/blob/7ad9240c8b9ade0cc3a403a...
In Dissecting Lemire's nearly divisionless random number generator