Originally posted by Keroberts1
I'm trying to figure out how to use this appication I can't get it to work. I downloaded it and installed it into the same folder as SB 1.10 but after clicking on it it just opens for a second but then immediatly closes. Is there something simple I'm forgeting to do, I'd like to help out here because obviously you need more processors.
If you create a bat file with sobfactor.exe help as the only line and execute it you will get something similar to:
Code:
C:\#GMP-ECM50\sbfactor10>sbfactor11.exe help
SBFactor v1.1
P-1 and ECM factoring for number of the form k*2^n+1.
Adapted from GIMPS v23.4 by George Woltman and Louis Helm
Intel Pentium III or Pentium III Xeon processor detected.
Factors are printed and dumped to fact.txt
P-1 factoring a single number with set bounds:
C:\#GMP-E~1\SBFACT~3\SBFACT~2.EXE <k> <n> <B1> <B2> <mem>
P-1 factoring a single number with optimal bounds:
C:\#GMP-E~1\SBFACT~3\SBFACT~2.EXE <k> <n> <factor depth> <factor value> <mem>
P-1 factoring a range of numbers with optimal bounds:
C:\#GMP-E~1\SBFACT~3\SBFACT~2.EXE <n low> <n high> <factor depth> <factor value>
[[cpu #] [total cpus]] <mem>
ECM factoring a single number with set bounds and # of curves:
C:\#GMP-E~1\SBFACT~3\SBFACT~2.EXE <k> <n> <B1> <B2> <curves to run> <mem>
<factor depth>: how much the number is factored expressed as a power of 2
45 means the number has been factored to 2^45 = 35 trillion
<factor value>: how many prp tests a factor would be worth
values of 1.2 to 1.5 are recommended
presuming you are running in windows. If you want to reserve a range go to the coordination thread and reserve a small range eg 4191000- 4191100 then try run.bat 4191000 4191100 to see what happens
You should get:
Code:
C:\#GMP-ECM50\sbfactor10>sbfactor11.exe 4191000 4191100 45 1.3 256
SBFactor v1.1
P-1 and ECM factoring for number of the form k*2^n+1.
Adapted from GIMPS v23.4 by George Woltman and Louis Helm
Intel Pentium III or Pentium III Xeon processor detected.
256MB of memory avilable for stage 2
Finished parsing SoB.dat
4 numbers between 4191000 =< n < 4191100
Searching for known factors in results.txt...Done.
Searching for known factors in lowresults.txt...Done.
Removed 0 numbers using the factor files
Testing 4 numbers between 4191000 =< n < 4191100
Reordering array by n value...Done.
Estimating for k=27653 n=4191009
Estimating for k=10223 n=4191017
Estimating for k=19249 n=4191026
Estimating for k=21181 n=4191092
Expected number of factors for entire range: 0.042070
B1=20000 B2=190000 Success=0.010517 Squarings=46121
P-1 on 27653*2^4191009+1 with B1=20000, B2=190000
initializing test
sieve finished<<this really means that it started
there will be status lines after this
when it's really done it will tell you how long it took
then it will go on to the next k n pair
27653*2^4191009+1 stage 1 is 0.867 complete.
27653*2^4191009+1 stage 1 is 1.735 complete.
27653*2^4191009+1 stage 1 is 2.602 complete.
27653*2^4191009+1 stage 1 is 3.470 complete.
27653*2^4191009+1 stage 1 is 4.337 complete.
then edit your reservation to read:
4191000 4191100 keroberts 4 0.042070 ? [reserved]
when you are done running the range post a line with the ? changed to the number of factors you have found and the [reserved] changed to [completed]
There will be a file 276534191009 created after 10 minutes and updated every 10 minutes after that. This will be used to restart from if you stop the run. It can also be used to rerun with other parameters i.e. change the 1.3 to 1.5 or even run an individual pair with B1 B2 of your choosing. If you do not plan to do any more runs with this K N pair, then you may delete this file.
If you find a factor, it will be written to the end of fact.txt (i.e. appended not replaced). Submit it at the usual location.
If the factor is greater than 2^64 (~18,446,744,073,709,600,0000), then submit it at the large sieve page.
If the factor is greater than 2^128 (~340,282,366,920,938,000,000,000,000,000,000,000,000), then submit it to Louie via email.
Periodically, you will want to refresh your results.txt file. The latest version can be found here in BZIP2 format.
If you want to know what the next K N pair to be handed out is, look here.
Thanks to Mikael and JMBlazek for the additional ideas.