Generating All 32-Bit Primes (Part I) • Hacker News Board

Re: Generating All 32-Bit Primes (Part I)

#31

Post by flysand7 » Mon, Mar 16, 2026, 12:24 AM UTC

reader9274 wrote: post #20

Very well written

I enjoyed it too! Enough technical details to be useful, but not too boring.

Re: Generating All 32-Bit Primes (Part I)

#32

Post by Cold_Miserable » Mon, Mar 16, 2026, 2:22 AM UTC

Heh. 1.Create fast modulus quad M for dword D for the first 2000? 200000? (xM)D 2.Eliminate 0b,101b 3.Divide using vrcp14ss/vdivss with correction. Use fast square root too using rsqrt14.

Re: Generating All 32-Bit Primes (Part I)

#33

Post by susam » Mon, Mar 16, 2026, 2:42 AM UTC

flancian wrote: post #24

susam wrote: post #13

I have a little tool called Prime Grid Explorer at https://susam.net/primegrid.html that I wrote for my own amusement. It can display all primes below 3317044064679887385961981 (an 82-bit integer). The largest three primes it can show are 3317044064679887385961783 3317044064679887385961801 3317044064679887385961813 Visit https://susam.net/primegrid.html#3317044064679887385961781-2... to see them plotted. Click the bu…

Very cool, thank you! Both the visualization tool and the description of Miller-Rabin. I didn't know an algorithm with these properties existed! Furthermore, your tool gave me a more intuitive feel of the rate at which primes "thin out" than every treatment of the topic I read previously.

Thank you for writing this. I'm glad my comment was useful.

Re: Generating All 32-Bit Primes (Part I)

#34

Post by stainlu » Mon, Mar 16, 2026, 3:01 AM UTC

[flagged]

Re: Generating All 32-Bit Primes (Part I)

#35

Post by hnlyman » Mon, Mar 16, 2026, 5:13 AM UTC

flysand7 wrote: post #31

reader9274 wrote: post #20

Very well written

I enjoyed it too! Enough technical details to be useful, but not too boring.

Thank you both! I'm glad my writing style appeals to people. This is the first time a substantial number of people have read something I wrote, so it's pretty big for me.