Re:Show HN: 48-digit prime numbers every git commit
by Retr0id on Tuesday January 06, 2026 @05:14PM
(#46519606)
30-120 seconds sounds surprisingly long for ~368 attempts, do you know which part(s) the slowness comes from?
[ Parent
| on HN ]
Re:Show HN: 48-digit prime numbers every git commit
by tntxtnt on Tuesday January 06, 2026 @07:53PM
(#46521098)
From doing MR rounds in pure Python: https://github.com/textonly/git-prime/blob/main/git-prime-co....
Should be under 5 seconds in C or C++ using gmp
Re:Show HN: 48-digit prime numbers every git commit
by Retr0id on Wednesday January 07, 2026 @06:05AM
(#46524954)
No, MR in pure python is ~instantaneous for numbers of this magnitude.
From looking at the code, the overhead will be from repeatedly invoking git as a subprocess.
Re:Show HN: 48-digit prime numbers every git commit
by keepamovin on Tuesday January 06, 2026 @09:45PM
(#46521920)
Have not flame graphed or even really considered optimization