![]() |
![]() |
#144 |
"Ben"
Feb 2007
376410 Posts |
![]()
I tried to duplicate this and couldn't... maybe there is some other option you are using that is causing problems but so far I can't see it.
Code:
fac: factoring 3799443788262456075850615749721 fac: using pretesting plan: deep fac: using specified qs/gnfs crossover of 100 digits fac: using specified qs/snfs crossover of 75 digits div: primes less than 10000 fmt: 1000000 iterations rho: x^2 + 3, starting 4096 iterations on C31 rho: x^2 + 2, starting 4096 iterations on C31 rho: x^2 + 1, starting 4096 iterations on C31 fac: trivial ECM work to do... skipping to sieve method starting SIQS on c31: 3799443788262456075850615749721 pretesting / qs ratio was 4.08 Total factoring time = 0.5986 seconds ***factors found*** P16 = 1289726107402801 P16 = 2945930741770921 ans = 1 |
![]() |
![]() |
![]() |
#145 | |
"James Heinrich"
May 2004
ex-Northern Ontario
22·1,061 Posts |
![]() Quote:
Code:
YAFU Version 2.10 Built with Microsoft Visual Studio 1931 Using GMP-ECM 7.0.4, Powered by MPIR 3.0.0 >> factor(3799443788262456075850615749721) fac: factoring 3799443788262456075850615749721 fac: using pretesting plan: deep fac: using specified qs/gnfs crossover of 100 digits fac: using specified qs/snfs crossover of 100 digits div: primes less than 10000 fmt: 1000000 iterations rho: x^2 + 3, starting 1000 iterations on C31 rho: x^2 + 2, starting 1000 iterations on C31 rho: x^2 + 1, starting 1000 iterations on C31 starting SIQS on c31: 3799443788262456075850615749721 Total factoring time = 0.2085 seconds ***factors found*** P16 = 1289726107402801 P16 = 2945930741770921 |
|
![]() |
![]() |
![]() |
#146 |
"Daniel Jackson"
May 2011
14285714285714285714
14018 Posts |
![]()
Delete siqs.dat, and run this: yafu "10^92*409522002-1", instead of yafu 3799443788262456075850615749721. If you still can't reproduce it, I'll double check my copy of YAFU to see if it's up to date with the version on Github.
|
![]() |
![]() |
![]() |
#147 | |
"Ben"
Feb 2007
22×941 Posts |
![]() Quote:
Code:
YAFU Version 2.10 Built with Microsoft Visual Studio 1933 Using GMP-ECM 7.0.4, Powered by MPIR 3.0.0 Detected Intel(R) Xeon(R) Gold 5122 CPU @ 3.60GHz Detected L1 = 32768 bytes, L2 = 17301504 bytes, CL = 64 bytes Using 1 random witness for Rabin-Miller PRP checks Cached 664579 primes; max prime is 9999991 Parsed yafu.ini from H:\src\c\yafu =============================================================== ======= Welcome to YAFU (Yet Another Factoring Utility) ======= ======= bbuhrow@gmail.com ======= ======= Type help at any time, or quit to quit ======= =============================================================== fac: factoring 40952200199999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999 fac: using pretesting plan: deep fac: no tune info: using qs/gnfs crossover of 100 digits fac: no tune info: using qs/snfs crossover of 75 digits div: primes less than 10000 fmt: 1000000 iterations rho: x^2 + 3, starting 4096 iterations on C101 rho: found prp5 factor = 25073 rho: x^2 + 3, starting 4096 iterations on C97 rho: x^2 + 2, starting 4096 iterations on C97 rho: x^2 + 1, starting 4096 iterations on C97 nfs: searching for brent special forms... nfs: input divides 409522002*10^92 - 1 nfs: snfs form detection took 0.005973 seconds fac: generating an SNFS polynomial to assess ECM effort nfs: snfs form detection took 0.004977 seconds fac: ecm effort reduced from 32.33 to 25.15: input has snfs form pm1: starting B1 = 150K, B2 = gmp-ecm default on C97 pm1: Process took 0.0677 seconds. pm1: found c31 factor = 3799443788262456075850615749721 fac: generating an SNFS polynomial to assess ECM effort nfs: snfs form detection took 0.008960 seconds fac: ecm effort maintained at 22.00: input better by qs fac: setting target pretesting digits to 22.000000 fac: estimated sum of completed work is t0.000000 fac: work done at B1=2000: 0 curves, max work = 30 curves fac: 30 more curves at B1=2000 needed to get to t22.000000 ecm: 32/32 curves on C66 @ B1=2000, B2=100*B1 ecm: process took 0.0567 seconds. ecm: found prp17 factor = 23225232914006407 ecm: found prp50 (co)factor = 18509335919243735948602524162646878133338090793729 Composite result found, starting re-factorization fac: factoring 3799443788262456075850615749721 fac: using pretesting plan: deep fac: no tune info: using qs/gnfs crossover of 100 digits fac: no tune info: using qs/snfs crossover of 75 digits div: primes less than 10000 fmt: 1000000 iterations rho: x^2 + 3, starting 4096 iterations on C31 rho: x^2 + 2, starting 4096 iterations on C31 rho: x^2 + 1, starting 4096 iterations on C31 fac: trivial ECM work to do... skipping to sieve method starting SIQS on c31: 3799443788262456075850615749721 n = 3799443788262456075850615749721 (31 digits and 102 bits) ==== sieve params ==== factor base: 170 primes (max prime = 2593) large prime cutoff: 129650 (50 * pmax) sieve interval: 1 blocks of size 16384 multiplier is 1 trial factoring cutoff at 40 bits ==== sieving in progress ==== 203 relations found: 144 full + 59 from 446 partial, using 198 polys QS elapsed time = 0.0100 seconds. Gauss elapsed time = 0.0010 seconds. pretesting / qs ratio was 7.77 Total factoring time = 0.9650 seconds Total factoring time = 3.5554 seconds ***factors found*** P5 = 25073 P17 = 23225232914006407 P50 = 18509335919243735948602524162646878133338090793729 P16 = 1289726107402801 P16 = 2945930741770921 ans = 1 |
|
![]() |
![]() |
![]() |
#148 |
"James Heinrich"
May 2004
ex-Northern Ontario
22·1,061 Posts |
![]()
Also works fine here on both the posted Windows binary (from Github 2022-09-22) and a WSL-Ubuntu version built 2023-Feb-12.
|
![]() |
![]() |
![]() |
#149 | |
Aug 2020
79*6581e-4;3*2539e-3
2·5·73 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#151 |
"Ben"
Feb 2007
22×941 Posts |
![]()
The cado-enabling code was contributed to yafu by "Nyan cat" on github. I can try to update it what they did but it might take me a while.
|
![]() |
![]() |
![]() |
#152 |
Mar 2006
23×3×23 Posts |
![]()
I ran into a couple of issues when compiling my own copy of yafu from the latest github source. The first issue was the undefined reference to fftmul, which I luckily saw you mentioned the fix in another thread (add arith/fftmul.c to the compile line). But, since I wasn't building with msieve, I also received an undefined reference to 'nfs'
My compile command line was: make yafu USE_SSE41=1 USE_AVX2=1 USE_BMI2=1 MINGW=1 NFS=0 NO_ZLIB=1 I ended up commenting out the 3 nfs() calls in the code and then was able to compile my version of yafu with the new stopgt (etc) options. Would you like me to submit a PR with the makefile fftmul and protecting those nfs() calls with #if NFS == 1? And, speaking of stopgt (etc)... they work great! Thank you for adding these options. However, after testing it out for a while, I see that I should have asked that it stops when it finds a prime factor that meets the conditions. Would this be an easy thing to fix? |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
How I install YAFU version 2 onto my Ubuntu Machines | EdH | EdH | 7 | 2023-03-14 15:06 |
yafu ignoring yafu.ini | chris2be8 | YAFU | 9 | 2022-02-17 17:52 |
YAFU Version Differences | nivek000 | YAFU | 2 | 2021-12-21 16:21 |
Running YAFU via Aliqueit doesn't find yafu.ini | EdH | YAFU | 8 | 2018-03-14 17:22 |
YAFU version 1.31 | bsquared | YAFU | 26 | 2012-04-23 03:16 |