mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Cunningham Tables

Reply
 
Thread Tools
Old 2022-06-12, 13:43   #23
ryanp
 
ryanp's Avatar
 
Jun 2012
Boulder, CO

2·199 Posts
Default

Got an ECM hit on the 2+ table yesterday.

Code:
GMP-ECM 7.0.5-dev [configured with GMP 6.2.0, GWNUM 30.4, --enable-asm-redc, --enable-assert] [ECM]
Due to incompatible licenses, this binary file must not be distributed.
Input number is (2^1361+1)/228211667657412909230323001705434042549018058879196001936615244070298287105666185870832703670953992780536531240215594078779119204857385398683700824873931077687558812068274836107 (234 digits)
Using B1=850000000, B2=15892628251516, polynomial Dickson(30), sigma=1:3479069830
Step 1 took 2572853ms
Step 2 took 495384ms
********** Factor found in step 2: 6901216084212062896491856436448111443188245170307294941500166249
Found prime factor of 64 digits: 6901216084212062896491856436448111443188245170307294941500166249
Composite cofactor ((2^1361+1)/228211667657412909230323001705434042549018058879196001936615244070298287105666185870832703670953992780536531240215594078779119204857385398683700824873931077687558812068274836107)/6901216084212062896491856436448111443188245170307294941500166249 has 170 digits
I'm going to take the remaining c170 via GNFS.
ryanp is offline   Reply With Quote
Old 2022-06-12, 16:00   #24
xilman
Bamboozled!
 
xilman's Avatar
 
"๐’‰บ๐’ŒŒ๐’‡ท๐’†ท๐’€ญ"
May 2003
Down not across

2·3·7·271 Posts
Default

Quote:
Originally Posted by ryanp View Post
Got an ECM hit on the 2+ table yesterday.

...

I'm going to take the remaining c170 via GNFS.
Nice work!

Interesting the second stage took so much less time than the first. To me that suggests you could raise B2 substantially unless it takes too much memory. Theoretical optimum is to spend equal effort in each stage.

Last fiddled with by xilman on 2022-06-12 at 16:02
xilman is offline   Reply With Quote
Old 2022-06-12, 16:10   #25
charybdis
 
charybdis's Avatar
 
Apr 2020

7×107 Posts
Default

Quote:
Originally Posted by xilman View Post
Theoretical optimum is to spend equal effort in each stage.
Hmmm, can you point me to a reference for this? Surely the optimum ratio is implementation dependent?
charybdis is offline   Reply With Quote
Old 2022-06-12, 16:23   #26
mathwiz
 
Mar 2019

32·31 Posts
Default

Quote:
Originally Posted by xilman View Post
Nice work!

Interesting the second stage took so much less time than the first. To me that suggests you could raise B2 substantially unless it takes too much memory. Theoretical optimum is to spend equal effort in each stage.
Would that be better than just letting GMP-ECM pick a B2?

Last fiddled with by mathwiz on 2022-06-12 at 16:25
mathwiz is offline   Reply With Quote
Old 2022-06-12, 23:16   #27
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

22·31·43 Posts
Default

Quote:
Originally Posted by charybdis View Post
Hmmm, can you point me to a reference for this? Surely the optimum ratio is implementation dependent?
This "spend equal time on stage 1 and stage 2" was pushed really hard by RDS years ago, and the paper he wrote that caused him to push this so hard itself showed stage 2 using much less time than stage 1. Explanations about the difference ranged from "implementation hiccup, it's theoretically correct" to a big shrug.

When using GMP-ECM, stage 2 time half of stage 1, or a bit less (like 40%), appears optimal via experiment. Alas, GMP-ECM itself does not follow that by default when B1 is above 300M or so, as shown by Ryan's result here.
VBCurtis is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Possible extension of expiry dates because of COVID19 Uncwilly PrimeNet 32 2020-08-22 21:24
Extension request LaurV Data 9 2019-04-14 00:13
PCI-E USB 3.0 Extension Cable vsuite GPU Computing 7 2017-07-10 20:45
Hanging reservations and table extension ET_ Operation Billion Digits 5 2012-06-12 08:48
brent suyama extension in P-1 bsquared Factoring 9 2007-05-18 19:24

All times are UTC. The time now is 11:36.


Sun Jul 3 11:36:30 UTC 2022 up 80 days, 9:37, 0 users, load averages: 1.59, 1.43, 1.36

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

โ‰  ยฑ โˆ“ รท ร— ยท โˆ’ โˆš โ€ฐ โŠ— โŠ• โŠ– โŠ˜ โŠ™ โ‰ค โ‰ฅ โ‰ฆ โ‰ง โ‰จ โ‰ฉ โ‰บ โ‰ป โ‰ผ โ‰ฝ โŠ โŠ โŠ‘ โŠ’ ยฒ ยณ ยฐ
โˆ  โˆŸ ยฐ โ‰… ~ โ€– โŸ‚ โซ›
โ‰ก โ‰œ โ‰ˆ โˆ โˆž โ‰ช โ‰ซ โŒŠโŒ‹ โŒˆโŒ‰ โˆ˜ โˆ โˆ โˆ‘ โˆง โˆจ โˆฉ โˆช โจ€ โŠ• โŠ— ๐–• ๐–– ๐–— โŠฒ โŠณ
โˆ… โˆ– โˆ โ†ฆ โ†ฃ โˆฉ โˆช โŠ† โŠ‚ โŠ„ โŠŠ โŠ‡ โŠƒ โŠ… โŠ‹ โŠ– โˆˆ โˆ‰ โˆ‹ โˆŒ โ„• โ„ค โ„š โ„ โ„‚ โ„ต โ„ถ โ„ท โ„ธ ๐“Ÿ
ยฌ โˆจ โˆง โŠ• โ†’ โ† โ‡’ โ‡ โ‡” โˆ€ โˆƒ โˆ„ โˆด โˆต โŠค โŠฅ โŠข โŠจ โซค โŠฃ โ€ฆ โ‹ฏ โ‹ฎ โ‹ฐ โ‹ฑ
โˆซ โˆฌ โˆญ โˆฎ โˆฏ โˆฐ โˆ‡ โˆ† ฮด โˆ‚ โ„ฑ โ„’ โ„“
๐›ข๐›ผ ๐›ฃ๐›ฝ ๐›ค๐›พ ๐›ฅ๐›ฟ ๐›ฆ๐œ€๐œ– ๐›ง๐œ ๐›จ๐œ‚ ๐›ฉ๐œƒ๐œ— ๐›ช๐œ„ ๐›ซ๐œ… ๐›ฌ๐œ† ๐›ญ๐œ‡ ๐›ฎ๐œˆ ๐›ฏ๐œ‰ ๐›ฐ๐œŠ ๐›ฑ๐œ‹ ๐›ฒ๐œŒ ๐›ด๐œŽ๐œ ๐›ต๐œ ๐›ถ๐œ ๐›ท๐œ™๐œ‘ ๐›ธ๐œ’ ๐›น๐œ“ ๐›บ๐œ”