Alternatives and similar repositories for miller-rabin

Users that are interested in miller-rabin are comparing it to the libraries listed below

• Mysticial / NumberFactory
  Compute numbers to high precision using the YMP bignum library!
  ☆23Updated 8 years ago
• vectorclass / manual
  Manual for the C++ vector class library
  ☆31Updated last year
• jwiegley / gdtoa
  David M. Gay's floating-point conversion library
  ☆34Updated 15 years ago
• asmjit / cult
  CPU Ultimate Latency Test.
  ☆110Updated last month
• fredrik-johansson / flint
  My copy of FLINT -- please use https://github.com/flintlib/flint/ for development
  ☆82Updated last week
• creachadair / imath
  Arbitrary precision integer and rational arithmetic library
  ☆147Updated 4 months ago
• suiginsoft / hebimath
  arbitrary precision arithmetic library
  ☆43Updated 6 years ago
• michaeljclark / bignum
  C++ bignum with support for arbitrary precision integer arithmetic.
  ☆29Updated 4 years ago
• zwegner / x86-info-term
  A terminal viewer for x86 instruction/intrinsic information using Python 3 + curses
  ☆128Updated 2 years ago
• Mysticial / Flops
  How many FLOPS can you achieve?
  ☆286Updated last year
• nehmeier / libieeep1788
  C++ implementation of the preliminary IEEE P1788 standard for interval arithmetic
  ☆49Updated 10 years ago
• kimwalisch / primesum
  🚀 Sum of the primes below x
  ☆38Updated 3 years ago
• lemire / SIMDxorshift
  Fast random number generators: Vectorized (SIMD) version of xorshift128+
  ☆117Updated 5 years ago
• umontreal-simul / TestU01-2009
  This is the 2009 version of TestU01, a software library, implemented in the ANSI C language, and offering a collection of utilities for t…
  ☆73Updated last year
• draperlaboratory / llvm-cbe
  resurrected LLVM "C Backend", with improvements
  ☆129Updated 4 years ago
• glinscott / linzip2
  A minimal modern LZ compressor example
  ☆59Updated 4 years ago
• Mysticial / ProtoNTT
  A basic implementation of the Small Primes Number-Theoretic Transform (NTT) multiplication algorithm.
  ☆24Updated 7 years ago
• Mrrl / GrailSort
  Stable In-place sorting in O(n*log(n)) worst time
  ☆189Updated 2 years ago
• MersenneTwister-Lab / SFMT
  SIMD-oriented Fast Mersenne Twister
  ☆92Updated 4 years ago
• mohaps / TinySHA1
  A simple header only SHA1 implementation in C++ (no dependencies)
  ☆70Updated 5 years ago
• lemire / testingRNG
  Testing common random-number generators (RNG)
  ☆187Updated 2 years ago
• MersenneTwister-Lab / TinyMT
  Tiny Mersenne Twister
  ☆223Updated 10 months ago
• JohannesBuchner / paq
  PAQ is a series of archivers that achieve very high compression rates at the expense of speed and memory
  ☆75Updated 2 years ago
• Mysticial / Mini-Pi
  A miniature program that can compute Pi to millions of digits.
  ☆144Updated 2 years ago
• PeterLuschny / Fast-Factorial-Functions
  Swing, divide and conquer the factorial!
  ☆81Updated 3 years ago
• rofl0r / chaos-pp
  chaos preprocessor library. this is what boost preprocessor derived from.
  ☆124Updated 13 years ago
• jeremybarnes / cephes
  Mirror of the Cephes C source for reference
  ☆94Updated last year
• skeeto / mandel-simd
  Mandelbrot set in SIMD (SSE, AVX)
  ☆83Updated 7 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆80Updated 5 months ago
• adityaramesh / io_benchmark
  Comparison of IO methods for OS X and Linux.
  ☆14Updated 11 years ago