MuPuPriNT Files

MuPuPriNT 1.2.02 x64
5 October 2012
by Jaska (NullCoding)
http://sourceforge.net/projects/mupuprint
http://ncprime.blogspot.com

/////////////////////////////////////////
About:

MuPuPriNT is a Multi-Purpose Prime Number Tester. It includes GJSieve, GJSieveC, GJSieveW, and GJSievePy for testing Proth, Cullen, Woodall, and Pythagorean numbers respectively. 

The new interface looks exactly like GJSieve 2.03, except there are additional radio buttons up at the top left for choosing what kind of test you wish to perform on what kind of number. Needless to say, you can only do one at a time.

The best way to learn about how the program works is to simply use it! :)

/////////////////////////////////////////
Changes:

- 64-bit means no more CPU / RAM display as inline assembly code is no longer supported.

- Interface is updated

- Screeenshot button easily takes a screenshot of the window at any time and saves it to your My Pictures folder in a MuPuPriNT Screenshots folder.

- Saving and Tweeting has been fixed and should work properly 100% of the time. Should.

/////////////////////////////////////////
How to use:

1. Select a type of number using the buttons in the top left. You cannot even calculate without telling the program what it is!

2. Input k and n in their respective boxes. Proth numbers are the only ones requiring a k. All must be positive integers.

3. Click Calculate...

4. Select a testing method using the radio buttons near the top - BFTD or SPAT.

4a. If you wish, select "verbose" or "Reverse." See descriptions below.

5. Press TEST!

6. Click Save To File if you wish to save your results. The file is automatically placed in a folder for that type of number within a MuPuPriNT 1.2.02 Results folder created in your Documents directory.

7. Click Clear to clear the boxes and reset for another test. 

/////////////////////////////////////////
Notes:

- If you do not select any additional parameters (step 4a), it will still spawn a testing thread, but will stop after finding only a single factor. Note that SPAT currently offers only single-threaded single-factor testing, and likely won't ever offer anything more until I can find a way to easily expand the range of known primes it tests. If you look in SVN, you see I typed them all in myself! This is ridiculous.

- Verbose mode works the same for every type of number. Indeed, all numbers are tested exactly the same way. This may change. It may not. (Let's be honest, it probably will)

- Reverse mode IS verbose mode, but with 6 threads instead of 3. It accomplishes exactly the same thing. Sometimes, reverse mode finds factors you'd ordinarily have to wait quite long for the other threads to find.

- The threads all run in the same process, unfortunately. This means that the speed increase is minimal compared to, say, 3 to 6 separate processes.

- BFTD in Verbose mode (NOT Reverse) is still the BEST way to factor the number. It also takes the most time.

/////////////////////////////////////////
Known Issues:

- I don't know of anything glaring I overlooked. If you find something, TELL ME! nullcoding@gmail.com