miller-rabin

Miller Rabin algorithm for primality test

Install

All systems
curl cmd.cat/miller-rabin.sh
Debian Debian
apt-get install node-miller-rabin
Ubuntu
apt-get install node-miller-rabin
Arch Arch Linux
pacman -S node-miller-rabin
image/svg+xml Kali Linux
apt-get install node-miller-rabin

node-miller-rabin

Miller Rabin algorithm for primality test

This a pure javascript implementation of Miller Rabin primality test. The Miller–Rabin primality test or Rabin–Miller primality test is a primality test: an algorithm which determines whether a given number is prime. Like the Fermat and Solovay–Strassen tests, the Miller–Rabin test relies on an equality or set of equalities that hold true for prime values, then checks whether or not they hold for a number that is tested for primality. Node.js is an event-based server-side JavaScript engine.

browserify

browser-side require() the node way

cordova

Cordova command line interface tool

kibana

Browser based analytics and search dashboard for Elasticsearch