git-prime
Dev tools
git tooling
SHOW HN2026
How HN took it
2 positive, 16 neutral or asking, 1 mixed, 6 critical, out of 25 comments about the project. Thread score -0.10.
Performance: 0 for, 3 againstIdea: 2 for, 0 againstDesign: 0 for, 1 againstExecution: 0 for, 1 againstPrivacy: 0 for, 1 against
The thread, comment by comment
Each row is a top-level comment and its replies, in HN's order. Select a cell to open that comment on HN.
positive neutral or mixed critical about another commenter or something else the maker
What HN said
What people liked
Clever proof-of-work-style idea and fun math
From 2 comments
This is amazing. A true proof of work. Have you considered finding hashes with leading zeros or making sure each hash starts with 1337?
haute_cuisine on HNThank you. This is the hn I’m here for. Probabilistic tests for definite primes still being so slimmest definitive is amazing to me. What structure are they approximating?
keepamovin on HN
Objections
Install via curl piped to bash is risky
From 1 comment
Sure hope the first line of that bash script isn’t rm -rf $HOME/* Please don’t ever suggest to anyone ever to curl a script and pipe it to bash. I’m sure this one is fine (I…
irishcoffee on HN
Slow runtime; overhead from repeated git subprocess calls
From 2 comments
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.
Retr0id on HNFrom doing MR rounds in pure Python: https://github.com/textonly/git-prime/blob/main/git-prime-commit. Should be under 5 seconds in C or C++ using gmp
tntxtnt on HN
Primality test choice and false positive bound
From 2 comments
> Miller-Rabin primality test (40 rounds, ~10^-24 false positive rate) It's way better than that. You are using the simplest upper bound for the false positive rate, which is…
tzs on HNFor those that want more details on this fun rabbit hole of math, see the theory of Strong Pseudoprimes: https://en.wikipedia.org/wiki/Strong_pseudoprime Miller-Rabin in…
primemegently on HN
Requests
Store nonce as a git trailer, not in message body
From 2 comments
Personally I'd append the Nonce as a git trailer, not to the message body. And would keep the date constant rather than use the time of each attempt (such that the only thing…
hoten on HN> Hash as int Should be "Hash as decimal". The hexadecimal hash is already the same integer. > Message: "Fix critical bug" + git-prime Nonce: 167 In the actual code it looks…
kazinator on HN
Add leading-zero or prefix vanity options
From 1 comment
This is amazing. A true proof of work. Have you considered finding hashes with leading zeros or making sure each hash starts with 1337?
haute_cuisine on HN
Questions
Why does the output say not prime then prime?
From 1 comment
Attempt 168: cb80ebbd975f0028... not prime [PRIME] Found after 168 attempts! Commit: cb80ebbd975f00288dca70d8fa735c688755f947 Why does it say not prime then prime?
mlyle on HN
Why is the commit slow at 30-120 seconds?
From 1 comment
30-120 seconds sounds surprisingly long for ~368 attempts, do you know which part(s) the slowness comes from?
Retr0id on HN
Alternatives named
git-vanity-hash
From 1 comment
https://github.com/prasmussen/git-vanity-hash
yencabulator on HN
git-vanity (tochev)
From 1 comment
This already exists btw https://github.com/tochev/git-vanity
Retr0id on HN
git-vanity-sha
From 1 comment
What about changing the committer timestamp slightly until you find a match like https://github.com/mattbaker/git-vanity-sha? That would make it entirely invisible
brw on HN