mersenneforum.org mtsieve
 Register FAQ Search Today's Posts Mark Forums Read

2018-02-22, 16:08   #23
rogue

"Mark"
Apr 2003
Between here and the

22·32·11·17 Posts

Quote:
 Originally Posted by pepi37 View Post fbncsieve -p50000000000000 -P 100000000000000 -i 500.npg -fN -W4 -O fact.txt fbncsieve v1.3.1, a program to find factors of k*b^n+c numbers for fixed b, n, and c and variable k Sieve started: 5e13 < p < 1e14 with 159895 terms p=50055611474419, 28.92M p/sec, 4 factors found at 15298 sec per factor, 0.1% done. ETA 2018-02-22 16:51
Can you e-mail me your input file?

Last fiddled with by rogue on 2018-02-22 at 16:09

2018-02-22, 17:37   #24
pepi37

Dec 2011
After milion nines:)

32·52·7 Posts

Quote:
 Originally Posted by rogue How was the newpgen file created? Was it created by newpgen or fbnciseve? Is there a reason that you choose that format over the ABC or ABCD format? Getting sr1sieve into mtsieve is one of my goals, but it is behind the GPU options.
Newpgen file is created using merge function in that program (sieved across few machines) and then join into one.
Quote:
 Is there a reason that you choose that format over the ABC or ABCD format?
Of course there is reason: and reason is called removing factors. I dont know why you now make some new formats when we have srfile that can make miracles , and make remove factors and convert from one to another formats. If you make some new formats, then please make utility to
-allow removing factors
-allow change from one format to another ( and also support to convert to npg format)

How I will remove factors: if I have three computers and every computer make own range?

2018-02-22, 17:39   #25
pepi37

Dec 2011
After milion nines:)

32·52·7 Posts

Quote:
 Originally Posted by rogue Can you e-mail me your input file?
Here it is

https://www.dropbox.com/s/hmmyd6lqrwgamf6/500.zip?dl=0

P.S sieve depth is lower, so header in file is not OK, but this is just for experiment so dont care about it

 2018-02-22, 18:42 #26 wombatman I moo ablest echo power!     May 2013 22×11×41 Posts Pepi, just as a heads-up. The linux version of sr1sieve is multithreaded. If you have Windows 10, you can compile the source within the Ubuntu shell and it will work fine.
2018-02-22, 18:51   #27
rogue

"Mark"
Apr 2003
Between here and the

22×32×11×17 Posts

Quote:
 Originally Posted by pepi37 Newpgen file is created using merge function in that program (sieved across few machines) and then join into one. Of course there is reason: and reason is called removing factors. I dont know why you now make some new formats when we have srfile that can make miracles , and make remove factors and convert from one to another formats. If you make some new formats, then please make utility to -allow removing factors -allow change from one format to another ( and also support to convert to npg format) How I will remove factors: if I have three computers and every computer make own range?
Use the -I argument to pass a file of factors in the form "p | candidate" into fbncsieve. If you have multiple factor files, concatenate before using as input. fbncsieve can be used to convert input files from ABCD/ABC/NPG formats into ABCD/ABC/NPG format using the -f switch. What it doesn't do is "convert then exit immediately", but I could probably add a switch for that.

fbncsieve does not output "invalid header", so I don't know what issue it had with your file. I will d/l that file later today and see what is tripping it up as I don't see anything obviously wrong with what you pasted.

BTW, one of my long term goals is to remove the need for srfile. None of the programs in this framework rely on srfile for any processing. If they do, then please let me know what I can do to move you away from using it.

Last fiddled with by rogue on 2018-02-22 at 19:25

2018-02-22, 19:37   #28
pepi37

Dec 2011
After milion nines:)

32·52·7 Posts

Quote:
 Originally Posted by rogue Use the -I argument to pass a file of factors in the form "p | candidate" into fbncsieve. If you have multiple factor files, concatenate before using as input. fbncsieve can be used to convert input files from ABCD/ABC/NPG formats into ABCD/ABC/NPG format using the -f switch. What it doesn't do is "convert then exit immediately", but I could probably add a switch for that. fbncsieve does not output "invalid header", so I don't know what issue it had with your file. I will d/l that file later today and see what is tripping it up as I don't see anything obviously wrong with what you pasted. BTW, one of my long term goals is to remove the need for srfile. None of the programs in this framework rely on srfile for any processing. If they do, then please let me know what I can do to move you away from using it.
What it doesn't do is "convert then exit immediately", but I could probably add a switch for that.- that will be great , so at the end I can get one or more npg files.
Then I dont need srfile anymore ( agree with you)

2018-02-22, 21:36   #29
rogue

"Mark"
Apr 2003
Between here and the

22·32·11·17 Posts

Quote:
 Originally Posted by pepi37 What it doesn't do is "convert then exit immediately", but I could probably add a switch for that.- that will be great , so at the end I can get one or more npg files. Then I dont need srfile anymore ( agree with you)
How many terms are remaining in the output from fbncsieve that require you to split it? In the case of CRUS, you would be using that output as input to srbsieve. In other cases is it possible for you to set up a PRPNet server to hand out the work? If not, I can look into adding a switch (similar to what is in gfndsieve) for splitting the remaining terms from fbncsieve into multiple files.

I recommend avoiding NPG file formats. The ABC format is similar, but the difference between the headers of the two formats makes the ABC format easier to comprehend.

2018-02-22, 22:17   #30
pepi37

Dec 2011
After milion nines:)

32×52×7 Posts

one more cosmetic bug
if you use option -h then you got text
look at last line ( in the red)
Quote:
 C:\Users\Alpha-I7\Desktop\mtsieve>gfndsieve -h gfndsieve v1.3, a CPU program to find factors of k*2^n+1 numbers for variable k and n -h --help prints this help -p --pmin=P0 sieve start: P0 < p (default 1) -P --pmax=P1 sieve end: p < P1 (default 2^62) -w --worksize=w primes per chunk of work (default 1000000) -W --workers=W start W workers (default 1) -i --inputterms=i input file of remaining candidates -I --inputfactors=I input file with factors -o --outputterms=o output file of remaining candidates -O --outputfactors=O output file with new factors -k --kmin=k minimum k to search -K --kmax=K maximum k to search -n --nmin=N minimum n to search -N --nmax=N maximum n to search -T --nsperfile=T number of n per output file Fatal Error: kmin must be specified

2018-02-22, 22:24   #31
rogue

"Mark"
Apr 2003
Between here and the

11010010011002 Posts

Quote:
 Originally Posted by pepi37 one more cosmetic bug if you use option -h then you got text look at last line ( in the red)
The question is whether or not it should exit immediately after printing the help.

 2018-02-23, 00:39 #32 rogue     "Mark" Apr 2003 Between here and the 22·32·11·17 Posts pepi37 reported a bug with the newpgen format output by fbncsieve. It is with the cryptic details buried in that pesky first line. I hope to fix it this weekend.
 2018-02-23, 02:31 #33 Dylan14     "Dylan" Mar 2017 2×33×11 Posts I found a bug with the cksieve executable: when the -n flag is supplied with 1 as its argument it gives a fatal error saying that 1 is out of range. The output is given below: Code: C:\Users\Dylan_000\Desktop\mtsieve\mtsieve>cksieve -P1e9 -n1 -N50000 -b50 cksieve v1.2, a program to find factors of (b^n+/-1)^2-2 numbers Fatal Error: cksieve: out of range argument -n 1 whereas if the -n flag is supplied with a 2 instead it works fine: Code: C:\Users\Dylan_000\Desktop\mtsieve\mtsieve>cksieve -P1e9 -n2 -N50000 -b50 cksieve v1.2, a program to find factors of (b^n+/-1)^2-2 numbers Sieve started: 1 < p < 1e9 with 99998 terms  In cksieve v1.1.4 -n 1 works fine: Code: cksieve -P1e9 -n1 -N50000 -b50 cksieve 1.1.4 -- A sieve for Carol (b^n-1)^2-2 and Kynea (b^n+1)^2-2 numbers. Started with 100000 terms for (50^n+/-c)^2-2 from command line. cksieve 1.1.4 started: 1 <= n <= 50000, 3 <= p <= 1000000000  I can confirm that the multithreading works in cksieve: with one thread on a otherwise idle i5-5200U it takes 261.82 seconds to process the sieve in the second code snippet, whereas with 4 threads the time taken is 88.82 sec. Last fiddled with by Dylan14 on 2018-02-23 at 02:34

All times are UTC. The time now is 18:00.

Tue Sep 27 18:00:07 UTC 2022 up 40 days, 15:28, 0 users, load averages: 0.93, 1.02, 1.21