1 comments

  • keepamovin 2 hours ago

    Why? Fun. Now every commit is a certified 160-bit prime number.

    - Miller-Rabin primality test (40 rounds, ~10^-24 false positive rate)

    - Fuzzes commit messages with nonces until finding a prime hash

    - Average ~368 attempts to find a prime (based on prime density at 2^160)

    - Actual performance: 30-120 seconds depending on luck

    The philosophy: shouldn't the global distributed compute grid be used to forward number theoretic random non-goals like primality?

    Every developer running git-prime contributes cycles to finding 160-bit primes hidden in SHA-1 space. Corporate pointless, but math & aesthets satisfying.

    Install:

      curl -fsSL https://textonly.github.io/git-prime/install.sh | bash
    
    or

      irm textonly.github.io/git-prime/install.ps1 | iex 
    
    on Win

    Then just run

      git prime-commit -m "my frickin commit message, etc..."
    Side note: disappointed that this Show's item ID is NOT prime. 46454369 = 13 × 3573413. Would've been perfect meta-content, ahah