20200726, 14:21  #573  
"Ed Hall"
Dec 2009
Adirondack Mtns
2^{2}·3·7·41 Posts 
Quote:
Change line 1327 in the GitHub version from: Code:
cout << msg1 << (factors.size() == 1 && factors[0].second == 1 ? "prp" : "c") << n.get_str().size() << " = " << msg2 << msg3 << endl; Code:
cout << " \r" << msg1 << (factors.size() == 1 && factors[0].second == 1 ? "prp" : "c") << n.get_str().size() << " = " << msg2 << msg3 << endl; Edit 2: As an additional note, line 904's comment is incorrect. It should be changed from: Code:
//output a result line to screen and elf file Code:
//output a result line to elf file Last fiddled with by EdH on 20200726 at 14:33 Reason: formatting 

20200728, 14:12  #574 
"Ed Hall"
Dec 2009
Adirondack Mtns
2^{2}·3·7·41 Posts 
@Chris: I have stumbled onto a problem with the GitHub version. I turned off the merge detection to let a sequence run down to a prime and it broke on 81 (3^4). Here's an example using 33391084425, with "detect_merge = false"
Code:
$ ./aliqueit i 0 33391084425 33391084425 Reading config file... Precalcing primes for trial factoring... Preloading mersenne primes for trial factoring... seq = 33391084425 index = 0 value = 33391084425 (11 digits) 0 .t dri c11 = 33391084425 = 3 * 5^2 * 397 * 1121447 : No driver 1 .t dri c11 = 21954617271 = 3^3 * 23 * 499 * 70849 : Decreased! 2 .t dri c11 = 12053382729 = 3 * 4017794243 : Decreased! . . . 21 . dri c3 = 231 = 3 * 7 * 11 : Decreased! 22 . dri c3 = 153 = 3^2 * 17 : Decreased! 23 . dri c2 = 81 = 1 * 3^4 : Decreased! ERROR: factor not prime: 1 Code:
0 . 33391084425 = 3 * 5^2 * 397 * 1121447 1 . 21954617271 = 3^3 * 23 * 499 * 70849 2 . 12053382729 = 3 * 4017794243 . . . 21 . 231 = 3 * 7 * 11 22 . 153 = 3^2 * 17 23 . 81 = 1 * 3^4 Code:
0 . 33391084425 = 3 * 5^2 * 397 * 1121447 1 . 21954617271 = 3^3 * 23 * 499 * 70849 2 . 12053382729 = 3 * 4017794243 . . . 21 . 231 = 3 * 7 * 11 22 . 153 = 3^2 * 17 23 . 81 = 3^4 24 . 40 = 2^3 * 5 25 . 50 = 2 * 5^2 26 . 43 = 43 Code:
$ ./aliqueit i 0 81 81 Reading config file... Precalcing primes for trial factoring... Preloading mersenne primes for trial factoring... seq = 81 index = 0 value = 81 (2 digits) 0 .t dri c2 = 81 = 3^4 : No driver 1 .t dri c2 = 40 = 2^3 * 5 : Decreased! 2 .t dri c2 = 50 = 1 * 2 * 5^2 : Downdriver! ERROR: factor not prime: 1 
20200729, 13:50  #575  
"Alexander"
Nov 2008
The Alamo City
197_{16} Posts 
Quote:
Last fiddled with by Happy5214 on 20200729 at 13:51 

20200729, 17:54  #576 
"Ed Hall"
Dec 2009
Adirondack Mtns
2^{2}·3·7·41 Posts 
Thanks. On the instances in question, I had forced the terminal to close. top showed no instance of Aliqueit to kill, but did show YAFU. When I killed YAFU, it reappeared with another PID, continuously.

20200802, 23:30  #577 
Apr 2013
Germany
3×103 Posts 
@Ed:
I fixed both issues. I don't add spaces like you but instead replace the tab with the correct amount of spaces (diff 4c1bfb26 on github). This also turned out to be faster (albeit not much, considering that this functions is not called very often) and invlolved more math (although I had to correct it [diff 28b4de02 on github] because my own math was weak). The other issue with the surplus 1 in the factor list is fixed by diff eca1a97d on github. The cause was some code I added to test the factors of the previous index before trial factoring. You can download the current code with this link: https://github.com/ChristianBeer/ali...ive/master.zip. 
20200803, 00:10  #578  
Apr 2013
Germany
3·103 Posts 
Let's break those issues down.
Quote:
Quote:
Quote:


20200803, 15:00  #579 
"Ed Hall"
Dec 2009
Adirondack Mtns
3444_{10} Posts 
As far as I can tell, ecmpi only writes to stdout. Here is a sample of its normal output for a successful run:
Code:
# 000: N = 3090600480571341440695629848053409503575850194735086870320378383071 # 000: B1 = 11000 # 000: #curves = 69 # 002: N = 3090600480571341440695629848053409503575850194735086870320378383071 # 002: B1 = 11000 # 002: #curves = 69 # 006: N = 3090600480571341440695629848053409503575850194735086870320378383071 # 006: B1 = 11000 # 006: #curves = 69 . . . # 096: N = 3090600480571341440695629848053409503575850194735086870320378383071 # 096: B1 = 11000 # 096: #curves = 69 # 103: B1 = 11000 # 103: #curves = 69 # 046: curve 0 found factor 83229881248601348477 using sigma 1:3897721773 # 069: curve 0 found factor 83229881248601348477 using sigma 1:2104735613 # 112 curves done (162.3%) Results: 3090600480571341440695629848053409503575850194735086870320378383071 = 37133303979371927709681795987519828996261725323 * 83229881248601348477 Code:
. . . # 068: N = 411676773140232256051084769693456454376283873543984860467009008264837448990912018251228188229503895262379101626680194478551024664844928705462803579339 # 068: B1 = 11000000 # 068: #curves = 4166 # 112 curves done (2.7%) # 224 curves done (5.4%) . . . # 4144 curves done (99.5%) # 4256 curves done (102.2%) Results: 411676773140232256051084769693456454376283873543984860467009008264837448990912018251228188229503895262379101626680194478551024664844928705462803579339 = 411676773140232256051084769693456454376283873543984860467009008264837448990912018251228188229503895262379101626680194478551024664844928705462803579339 I also use a script to catch Aliqueit's "ecm.py" call and change it to what ecmpi expects. The scripts I use are fully explained in this post in my "How I..." thread for Aliqueit. In actuality, it might not be worth the effort to make Aliqueit ecmpi friendly, though. If I can get something like ECMnet working, that would be preferred by me, mainly because Ubuntu 18.04 broke openmpi and unless 20.04 has it working again, I will stop using it altogether with my next upgrade, but also because mpi clusters work best with all similar nodes, whereas my farm is anything but similar across the nodes, resulting in the slowest machine setting the pace for the whole cluster. And, besides, if I'm the only one using it, or there is a tiny following I/we can quite effectively use scripts to convert the calls/results. 
20200803, 15:04  #580  
"Ed Hall"
Dec 2009
Adirondack Mtns
2^{2}×3×7×41 Posts 
Quote:


20200808, 20:58  #581 
Apr 2013
Germany
135_{16} Posts 
If I unterstand your ecmpi scripts correctly you would output multiple lines of the form
Code:
********** Factor found in step 2: $factor Found prime factor of ${#factor} digitis: $factor Edit upon further review of the aliqueit code: this should already be the case. Could you send me an "aliqueit_ecm_temp.log" that was created by your "aliECM.sh" script? The current code checks every line of "aliqueit_ecm_temp.log" and looks for "Found factor" it then looks for ": " and extracts the number after that. It does so with every line and collects multiple factors. Last fiddled with by ChristianB on 20200808 at 21:10 
20200808, 22:38  #582 
"Ed Hall"
Dec 2009
Adirondack Mtns
2^{2}×3×7×41 Posts 
My ecmpi script is not harvesting correctly. If possible, you should work with actual ecmpi output. However, you probably shouldn't spend too much time on this particular item, since I may be the only user and that might be shortlived if Ubuntu doesn't fix openmpi in version 20.04 LTS. If Aliqueit is harvesting all the factors returned from GMEECM and ecm.py, that should be sufficient. ecmpi output would be a bonus, but my script shouldn't be considered any kind of valid format, since it was just an intermediary step.
My script merely grabs the factor string and sticks it on a manufactured line and appends it to the temp file. This was from a recent success: Code:
GMPECM 7.0.4 [configured with GMP 6.1.2, enableasmredc] [P+1] Input number is 199846925325212778936524636255908932994729050497908854338781889672773772151749842241106868914659381665057376759667160384756876084264093979 (138 digits) Using B1=55000, B2=19411780, polynomial x^1, x0=683685786 Step 1 took 32ms Step 2 took 40ms Run 2 out of 3: Using B1=55000, B2=19411780, polynomial x^1, x0=1704320829 Step 1 took 24ms Step 2 took 32ms Run 3 out of 3: Using B1=55000, B2=19411780, polynomial x^1, x0=1137676472 Step 1 took 28ms Step 2 took 36ms ********** Factor found in step 2: 7232220600701 * 29530212079756657 Found prime factor of 33 digitis: 7232220600701 * 29530212079756657 
20200809, 15:08  #583 
"Ed Hall"
Dec 2009
Adirondack Mtns
2^{2}·3·7·41 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Resuming aliqueit  johnadam74  Aliquot Sequences  4  20160328 12:32 
Apparent aliqueit issue with specifying factors  pakaran  Aliquot Sequences  2  20150912 23:10 
Using Several Instances of Aliqueit for a large gnfs job  EdH  Aliquot Sequences  6  20111213 18:58 
Setting up aliqueit  science_man_88  Aliquot Sequences  185  20111108 12:18 
Tried out aliqueit.exe: ggnfs failing  Greebley  Aliquot Sequences  35  20100213 15:23 