JavaScript
27
8
No license
This project implements the Miller-Rabin primality test, a probabilistic algorithm for determining whether a given number is prime. It is primarily intended for developers and mathematicians working on cryptography, number theory, or applications requiring efficient primality testing.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of indutny/miller-rabin
Big number implementation in pure javascript
Random number generator for browsers and node.js
simple, flexible, fun test framework
Support the repos that depend on indutny/miller-rabin
Top contributors
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet