View Single Post
 2021-07-02, 21:35 #9 kriesel     "TF79LL86GIMPS96gpu17" Mar 2017 US midwest 3×1,933 Posts Mlucas v19.0 -h help output As generated by the program: Code:  Mlucas 19.0 http://www.mersenneforum.org/mayer/README.html INFO: using 64-bit-significand form of floating-double rounding constant for scalar-mode DNINT emulation. INFO: testing FFT radix tables... For the full list of command line options, run the program with the -h flag. For a list of command-line options grouped by type, run the program with the -topic flag. Mlucas command line options: Symbol and abbreviation key: : carriage return | : separator for one-of-the-following multiple-choice menus [] : encloses optional arguments {} : denotes user-supplied numerical arguments of the type noted. ({int} means nonnegative integer, {+int} = positive int, {float} = float.) -argument : Vertical stacking indicates argument short 'nickname' options, -arg : e.g. in this example '-arg' can be used in place of '-argument'. Supported arguments: Default mode: looks for a worktodo.ini file in the local directory; if none found, prompts for manual keyboard entry Help submenus by topic. No additional arguments may follow the displayed ones: -s Post-build self-testing for various FFT-length rnages. -fftlen FFT-length setting. -radset FFT radix-set specification. -m[ersenne] Mersenne-number primality testing. -f[ermat] Fermat-number primality testing. -shift ***SIMD builds only*** Number of bits by which to shift the initial seed (= iteration-0 residue). -prp Probable-primality testing mode. -iters Iteration-number setting. -nthread|cpu Setting threadcount and CPU core affinity. *** NOTE: *** The following self-test options will cause an mlucas.cfg file containing the optimal FFT radix set for the runlength(s) tested to be created (if one did not exist previously) or appended (if one did) with new timing data. Such a file-write is triggered by each complete set of FFT radices available at a given FFT length being tested, i.e. by a self-test without a user-specified -radset argument. (A user-specific Mersenne exponent may be supplied via the -m flag; if none is specified, the program will use the largest permissible exponent for the given FFT length, based on its internal length-setting algorithm). The user must specify the number of iterations for the self-test via the -iters flag; while it is not required, it is strongly recommended to stick to one of the standard timing-test values of -iters = [100,1000,10000], with the larger values being preferred for multithreaded timing tests, in order to assure a decently large slice of CPU time. Similarly, it is recommended to not use the -m flag for such tests, unless roundoff error levels on a given compute platform are such that the default exponent at one or more FFT lengths of interest prevents a reasonable sampling of available radix sets at same. If the user lets the program set the exponent and uses one of the aforementioned standard self-test iteration counts, the resulting best-timing FFT radix set will only be written to the resulting mlucas.cfg file if the timing-test result matches the internally- stored precomputed one for the given default exponent at the iteration count in question, with eligible radix sets consisting of those for which the roundoff error remains below an acceptable threshold. If the user instead specifies the exponent (only allowed for a single-FFT-length timing test)**************** and/or a non-default iteration number, the resulting best-timing FFT radix set will only be written to the resulting mlucas.cfg file if the timing-test results match each other? ********* check logic here This is important for tuning code parameters to your particular platform. FOR BEST RESULTS, RUN ANY SELF-TESTS UNDER ZERO- OR CONSTANT-LOAD CONDITIONS -s {...} Self-test, user must also supply exponent [via -m or -f] and/or FFT length to use. -s tiny Runs 100-iteration self-tests on set of 32 Mersenne exponents, ranging from 173431 to 2455003 -s t This will take around 1 minute on a fast CPU.. -s small Runs 100-iteration self-tests on set of 32 Mersenne exponents, ranging from 173431 to 2455003 -s s This will take around 10 minutes on a fast CPU.. **** THIS IS THE ONLY SELF-TEST ORDINARY USERS ARE RECOMMENDED TO DO: ****** * * * -s medium Runs set of 16 Mersenne exponents, ranging from 2614999 to 9530803 * -s m This will take around an hour on a fast CPU. * * * **************************************************************************** -s large Runs set of 24 Mersenne exponents, ranging from 10151971 to 72123137 -s l This will take around an hour on a fast CPU. -s huge Runs set of 16 Mersenne exponents, ranging from 76821337 to 282508657 -s h This will take a couple of hours on a fast CPU. -s all Runs 100-iteration self-tests of all test Mersenne exponents and all FFT radix sets. -s a This will take several hours on a fast CPU. -fftlen {+int} If {+int} is one of the available FFT lengths (in Kilodoubles), runs all all available FFT radices available at that length, unless the -radset flag is invoked (see below for details). If -fftlen is invoked without the -iters flag, it is assumed the user wishes to do a production run with a non-default FFT length, In this case the program requires a valid worktodo.ini-file entry with exponent not more than 5% larger than the default maximum for that FFT length. If -fftlen is invoked with a user-supplied value of -iters but without a user-supplied exponent, the program will do the specified number of iterations using the default self-test Mersenne or Fermat exponent for that FFT length. If -fftlen is invoked with a user-supplied value of -iters and either the -m or -f flag and a user-supplied exponent, the program will do the specified number of iterations of either the Lucas-Lehmer test with starting value 4 (-m) or the Pe'pin test with starting value 3 (-f) on the user-specified modulus. In either of the latter 2 cases, the program will produce a cfg-file entry based on the timing results, assuming at least one radix set ran the specified #iters to completion without suffering a fatal error of some kind. Use this to find the optimal radix set for a single FFT length on your hardware. NOTE: IF YOU USE OTHER THAN THE DEFAULT MODULUS OR #ITERS FOR SUCH A SINGLE-FFT- LENGTH TIMING TEST, IT IS UP TO YOU TO MANUALLY VERIFY THAT THE RESIDUES OUTPUT MATCH FOR ALL FFT RADIX COMBINATIONS AND THE ROUNDOFF ERRORS ARE REASONABLE! -radset {int} Specific index of a set of complex FFT radices to use, based on the big select table in the function get_fft_radices(). Requires a supported value of -fftlen to also be specified, as well as a value of -iters for the timing test. -m [{+int}] Performs a Lucas-Lehmer primality test of the Mersenne number M(int) = 2^int - 1, where int must be an odd prime. If -iters is also invoked, this indicates a timing test. and requires suitable added arguments (-fftlen and, optionally, -radset) to be supplied. If the -fftlen option (and optionally -radset) is also invoked but -iters is not, the program first checks the first line of the worktodo.ini file to see if the assignment specified there is a Lucas-Lehmer test with the same exponent as specified via the -m argument. If so, the -fftlen argument is treated as a user override of the default FFT length for the exponent. If -radset is also invoked, this is similarly treated as a user- specified radix set for the user-set FFT length; otherwise the program will use the cfg file to select the radix set to be used for the user-forced FFT length. If the worktodo.ini file entry does not match the -m value, a set of timing self-tests is run on the user-specified Mersenne number using all sets of FFT radices available at the specified FFT length. If the -fftlen option is not invoked, the self-tests use all sets of FFT radices available at that exponent's default FFT length. Use this to find the optimal radix set for a single given Mersenne number exponent on your hardware, similarly to the -fftlen option. Performs as many iterations as specified via the -iters flag [required]. -f {int} Performs a base-3 Pe'pin test on the Fermat number F(num) = 2^(2^num) + 1. If desired this can be invoked together with the -fftlen option. as for the Mersenne-number self-tests (see notes about the -m flag; note that not all FFT lengths supported for -m are available for -f). Optimal radix sets and timings are written to a fermat.cfg file. Performs as many iterations as specified via the -iters flag [required]. -shift ***SIMD builds only*** Bits by which to circular-left-shift the initial seed. This shift count is doubled (modulo the number of bits of the modulus being tested) each iteration. Savefile residues are rightward-shifted by the current shift count before being written to the file; thus savefiles contain the unshifted residue, and separately the current shift count, which the program uses to leftward-shift the savefile residue when the program is restarted from interrupt. The shift count is a 64-bit unsigned int (e.g. to accommodate Fermat numbers > F32). -prp {int} Instead of running the rigorous primality test defined for the modulus type in question (Lucas-Lehmer test for Mersenne numbers, Pe'pin test for Fermat numbers do a probably-primality test to the specified integer base b = {int}. For a Mersenne number M(p), starting with initial seed x = b (which must not = 2 or a power of 2), this means do a Fermat-PRP test, consisting of (p-2) iterations of form x = b*x^2 (mod M(p)) plus a final mod-squaring x = x^2 (mod M(p)), with M(p) being a probable-prime to base b if the result == 1. For a Fermat number F(m), starting with initial seed x = b (which must not = 2 or a power of 2), this means do an Euler-PRP test (referred to as a Pe'pin test for these moduli), i.e. do 2^m-1 iterations of form x = b*x^2 (mod M(p)), with M(p) being not merely a probable prime but in fact deterministically a prime if the result == -1. The reason we still use the -prp flag in the Fermat case is for legacy-code compatibility: All pre-v18 Mlucas versions supported only Pe'pin testing to base b = 3; now the user can use the -prp flag with a suitable base-value to override this default choice of base. -iters {int} Do {int} self-test iterations of the type determined by the modulus-related options (-s/-m = Lucas-Lehmer test iterations with initial seed 4, -f = Pe'pin-test squarings with initial seed 3. Top of reference tree: https://www.mersenneforum.org/showpo...22&postcount=1 Last fiddled with by kriesel on 2021-07-02 at 21:41