This program is built upon the concept of Miller's test and uses a completely bias-free method to provide accurate probabilistic chances of primes passing the test, an efficient primality test limited by Python's slow interpreter speeds, as well as the lack of multicore processing and multithreading which I may add at one point.
Simply put, this program is a primality test program, it tests whether a number you input is prime or not using one of today's most modern efficient methods of primality testing -- the miller's test.
Python Interpreter 3+ is required in order to compile the code, you may build this into an executable through other means if you wish. Standard compilation is all that is needed.
python primality_test_main.pyOnce the code is executed, follow the instructions on the screen.
git clone https://github.com/faycalki/primality_test_using_millers_test.git- Efficiently checks for primality with customizeable amount of integers to check against for the sake of speed.
- Bias free probabilistic chance for primality passing the test, also computes the chance of it passing the test.
- Minimal dependencies.
- Can be implemented as a fully modular program with minimal editing, built as a function.
If you'd like to contribute, please fork the repository and use a feature branch. Pull requests are warmly welcome.
- Repository: https://github.com/faycalki/primality_test_using_millers_test/
- Issue tracker: https://github.com/faycalki/primality_test_using_millers_test/issues/
- In case of sensitive bugs like security vulnerabilities, please contact icechillgaming@gmail.com directly instead of using the issue tracker. I greatly appreciate any efforts to improve the security of my projects.
- My other projects, feel free to check them out: https://github.com/faycalki/
The code in this project is licensed under the GNU General Public License v3.0.
This project is intended to be used for legal purposes only, and is pursuant to the license terms and conditions provided.