mtsieve

[rebirther]

srsieve2cl.exe -n2501 -N10000 -P1e9 -M 5000 -g 5 -spl_remain.txt -fB

I tried to reduce the values but ends up every time in a driver timout. The usage was from 6.5-6.8GB VRAM. The error message came from the AMD driver, windows log (amdkmdag).

[rogue]

Originally Posted by rebirther

srsieve2cl.exe -n2501 -N10000 -P1e9 -M 5000 -g 5 -spl_remain.txt -fB

I tried to reduce the values but ends up every time in a driver timout. The usage was from 6.5-6.8GB VRAM. The error message came from the AMD driver, windows log (amdkmdag).

I'm not certain how to address that. How many sequences are in the file? Can you cut the number of sequences in half and see if that works?

[rebirther]

Originally Posted by rogue

I'm not certain how to address that. How many sequences are in the file? Can you cut the number of sequences in half and see if that works?

13808 sequences

[pepi37]

e:\PRIME\NEW-PROJECT1>twinsieve -P 2000000000000000 -W 5 -w 5e7 -i k_b2_n4194304.pfgw -o k_b2_n4194304.pfgw -O 4194304.txt
twinsieve v1.3, a program to find factors of k*b^n+1/-1 numbers for fixed b and n and variable k
Switching to ABC format since other formats are not supported when using -s
Sieve started: 1646125914229267 < p < 2e15 with 128499 terms (7 < k < 3999975, k*2^4194304) (expecting 710 factors)
p=1646139929503171, 46.01M p/sec, 23 factors found at 1328 sec per factor (last 128 min), 0.0% done. ETC 2027-04-15 09:31


C:\Users\Desktop\NEW-PROJECT>twinsieve -P 1500000000000000 -W 3 -w 2e7 -i k_b2_n4194304.pfgw -o k_b2_n4194304.pfgw -O 4194304.txt
twinsieve v1.3, a program to find factors of k*b^n+1/-1 numbers for fixed b and n and variable k
Switching to ABC format since other formats are not supported when using -s
Sieve started: 1215757153905743 < p < 15e14 with 131939 terms (7 < k < 3999975, k*2^4194304) (expecting 793 factors)
p=1226583079600591, 30.11M p/sec, 32 factors found at 925 sec per factor (last 164 min), 3.8% done. ETC 2021-01-16 10:29

I found prediction time very wrong,as you can see in this example. I also found why is time so wrong. From time to time sieve increase current p ( in this example p=1646139929503171) and then prediction become "normal" : in this case sieve will be over in 5-6 days, not 6 years. It is cosmetic bug, but little strange one. On the other CPU prediction with same sieve file, is very accurate.

[rogue]

Originally Posted by pepi37

I found prediction time very wrong,as you can see in this example. I also found why is time so wrong. From time to time sieve increase current p ( in this example p=1646139929503171) and then prediction become "normal" : in this case sieve will be over in 5-6 days, not 6 years. It is cosmetic bug, but little strange one. On the other CPU prediction with same sieve file, is very accurate.

The first output shows 0.0% done. This implies that the sample size is too small to accurate compute the ETC.

Was something hindering execution such as another CPU intensive process? The first snippet shows very little progress (after at least 128 minutes) compared to the second.

[MisterBitcoin]

I found an, well not an bug but a flaw in srsieve2. When using srfile to remove sequences from an k´s remain file its writes a file that begins like that:



pmin=0


I tried starting a sieve and got this result:

C:\Users\Sydekum\Documents\other stuff\cllr38iwin64_v2>srsieve2.exe -s R7_4800.out -n 4800 -N 5000 -P 500e6
srsieve2 v1.1, a program to find factors of k*b^n+c numbers for fixed b and variable k and n
Fatal Error:  sequence must be in form k*b^n+c where you specify values for k, b and c

After removing the line it worked fine.

[rogue]

Originally Posted by MisterBitcoin

I found an, well not an bug but a flaw in srsieve2. When using srfile to remove sequences from an k´s remain file its writes a file that begins like that:

pmin=0

I tried starting a sieve and got this result:

C:\Users\Sydekum\Documents\other stuff\cllr38iwin64_v2>srsieve2.exe -s R7_4800.out -n 4800 -N 5000 -P 500e6
srsieve2 v1.1, a program to find factors of k*b^n+c numbers for fixed b and variable k and n
Fatal Error:  sequence must be in form k*b^n+c where you specify values for k, b and c

After removing the line it worked fine.

That is only of those oddities from srsieve/srfile. If you use a different output format from srsieve/srfile (such as ABCD of PFGW), that line isn't included.

I have added these to FUTURE.txt.

• skipping the pmin line in srsieve2
• added logic to srsieve2 to support removal of sequences similar to what srfile does

[pepi37]

Originally Posted by rogue

The first output shows 0.0% done. This implies that the sample size is too small to accurate compute the ETC.

Was something hindering execution such as another CPU intensive process? The first snippet shows very little progress (after at least 128 minutes) compared to the second.

No, there is no such process, this is Intel CPU with 6 cores, 5 are used. Dedicated machine only for sieving and from time to time open Firefox

[rogue]

Originally Posted by pepi37

No, there is no such process, this is Intel CPU with 6 cores, 5 are used. Dedicated machine only for sieving and from time to time open Firefox

All I can say is that the output is telling me that the CPUs are not being fully utilized by twinsieve, unless there is a bug causing the CPU to burn cycle without doing anything useful.

[pepi37]

Originally Posted by rogue

All I can say is that the output is telling me that the CPUs are not being fully utilized by twinsieve, unless there is a bug causing the CPU to burn cycle without doing anything useful.

That is reason why I say it is cosmetic bug, as soon as p increase, prediction time become accurate.

[Plutie]

This is most likely an issue with my syntax, but when I run srsieve2 with a sequence in the form (k*b^n+c)/d, the program does not seem to be recognizing the division.

uwu@DESKTOP-7I8GNER:~/Math/mtsieve$ ./srsieve2 -W2 -o=45557 -s"(41*10^n+13)/9" -n100001 -N150000
srsieve2 v1.3.1, a program to find factors of k*b^n+c numbers for fixed b and variable k and n
Sieving with generic logic
Sieve started: 3 < p < 2^62 with 50000 terms (100001 < n < 150000, k*10^n+c)
Fatal Error:  Invalid factor: 41*10^100001+13 mod 3 = 12