mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Software (https://www.mersenneforum.org/forumdisplay.php?f=10)

 pepi37 2020-08-28 16:28

[QUOTE=rogue;555282]The reason is that -x is intended to be used on new sieves. It is also geared towards n < 2000. For larger n using gfndsieve+pfgw would be faster. Also other programs will likely be faster than gfndsieve for such small x.[/QUOTE]

All you say is OK but if I wish to use your program what will be correct command?

 rogue 2020-08-28 19:28

[QUOTE=pepi37;555284]All you say is OK but if I wish to use your program what will be correct command?[/QUOTE]

What n range are you sieving?

 pepi37 2020-08-28 19:40

[QUOTE=rogue;555300]What n range are you sieving?[/QUOTE]

-k 10000 -K 10050 -n 1600 -N 1610

just for test , but to know how to use x option

 rogue 2020-08-29 00:05

[QUOTE=pepi37;555302]-k 10000 -K 10050 -n 1600 -N 1610

just for test , but to know how to use x option[/QUOTE]

As long as you are not using -i, you can use -x. I assume that you are just testing the functionality. For that range of k and n feromant or pmts would be faster per [url]http://www.fermatsearch.org/productivity.html[/url]

 pepi37 2020-08-29 20:06

[QUOTE=rogue;555328]As long as you are not using -i, you can use -x. I assume that you are just testing the functionality. For that range of k and n feromant or pmts would be faster per [URL]http://www.fermatsearch.org/productivity.html[/URL][/QUOTE]

e:\MTSIEVE\GFDN>gfndsievecl.exe -k 170000 -K 170050 -n 29900 -N 30000 -P 2000000000 -W6 -x
gfndsieve v1.8, a program to find factors of k*2^n+1 numbers for variable k and n
terminate called after throwing an instance of 'std::bad_alloc'
[/I]

 rogue 2020-08-30 00:23

[QUOTE=pepi37;555396]e:\MTSIEVE\GFDN>gfndsievecl.exe -k 170000 -K 170050 -n 29900 -N 30000 -P 2000000000 -W6 -x
gfndsieve v1.8, a program to find factors of k*2^n+1 numbers for variable k and n
terminate called after throwing an instance of 'std::bad_alloc'
[/I][/QUOTE]

It ran out of memory. Use -X to reduce the number of terms per chunk.

Since n is so large, you are much better off running without -x than using pfgw with the output file.

 rogue 2020-09-17 18:08

I have posted 2.0.6 at sourceforge. Here are the improvements:
[LIST][*]Fixed crash with xyyxsievecl with overly large ranges for the GPU.[*]More speed enhancements for xyyxsieve, mainly due to reduced memory requirements.[*]Do not show ETA or percent done if less than 1% done and -P not used.[*]Modify factor rate calculation to handle uneven factor distribution better.[*]Fix srsieve2 to not check for algebraic factors when abs(c) != 1.[*]Fix srsieve2 as it was counting factors of terms that had already been removed.[/LIST]
srsieve2 has some issues for (k*b^n+c)/d that are not fully worked out. The main ones are the removal of terms if d does not divide k*b^n+c and factors of (k*b^n+c)/d if gcd(d, p) > 1 and gcd(d, p) != p. I would appreciate if anyone could write some code to assist in those areas.

 henryzz 2020-09-19 05:50

What is the best way to convert fkbnsieve output to abc format rather than abcd?

 Dylan14 2020-11-02 16:39

For anyone that uses Arch Linux or its derivatives, I've [URL="https://aur.archlinux.org/packages/mtsieve/"]made mtsieve into an AUR package[/URL]. All that's needed to install it is to run

[code]pikaur -S mtsieve[/code]and you can install the full suite.

 rebirther 2020-11-08 07:12

The latest srsieve2 has still worker issues where not all workers are used. This is happening around 2 of 10 bases and only 1 core is active.

[CODE]srsieve2 -n2501 -N10000 -P1e9 -W16 -spl_remain.txt -fB[/CODE]In this case Iam using the srsieve2 file from 16.01.2020 without a problem.

 rogue 2020-11-08 14:01

[QUOTE=rebirther;562612]The latest srsieve2 has still worker issues where not all workers are used. This is happening around 2 of 10 bases and only 1 core is active.

[CODE]srsieve2 -n2501 -N10000 -P1e9 -W16 -spl_remain.txt -fB[/CODE]In this case Iam using the srsieve2 file from 16.01.2020 without a problem.[/QUOTE]

Do you mean the the one from earlier this year works correctly and the newer one does not?

All times are UTC. The time now is 07:42.