Rust port of GNU Factor for 128-bit integers. Some changes have been made to my preference
-
Evaluation loop exits on the input of "q","quit" or "exit"
-
Hexadecimal, Octal, and binary input is supported with the --hex, --oct and --bin options respectively
-
Factorisations are properly represented using exponentiation and multiplication symbols
-
Supports GNU factor style of formatting, with the provided --gnu flag
-
Supports formatting without repeating the factor, only outputting the factors.
-
Supports other related unary number theoretic functions like primality testing, euler totient, least group exponent, counting divisors, and others
-
Supports evaluating binary number theoretic functions to a constant. Multiplicative orders, GCD,Kronecker symbol, fermat test, and the strong fermat test.
-
Supports filtering out primes,coprimes,and fermat pseudoprimes. These functions are heavily limited by stdin/out speed.
Currently faster than the coreutils Rust port, and begins to outspeed GNU factor for n > 2^50.
Most semiprimes will be factored in less than 60 seconds (0.6s on average for 128-bit integers)
This performance is entirely due to the machine-factor library.
reference.sh contains some examples of usage. While this program is relatively fast and can be used for some research,
single-threaded piping through stdio is very inefficient, and I recommend using a serious library instead.
Running make install, installs it to /usr/bin and redefines factor to call this program instead.
For a drop-in replacement of GNU factor edit the .bash_aliases file to alias factor='/usr/bin/rfactor --gnu'
This code is licensed under GPLv3.