mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Cunningham Tables

Reply
 
Thread Tools
Old 2022-10-14, 03:17   #45
charybdis
 
charybdis's Avatar
 
Apr 2020

39D16 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
Interesting. Was 2,2246M unusually easy? 2,1109+ is 4 digits larger. It should therefore be slightly less than twice as hard. Would this not be less work than 1110 bits of SNFS? [1110 is divisible by 6, 1109 is not]
The polynomial for 2,2246M was indeed very good, but that's still only a ~10% advantage over what we might have expected beforehand.

What surprised me about 2,1109+ was not that GNFS seemed harder than expected but that SNFS seemed easier than expected. I had naively been comparing degree-6 GNFS polys with degree-6 SNFS polys using the msieve Murphy-E score, which uses values for the sieve region and factor base bound that are far too small for a job this size. It was not at all hard to find a GNFS poly that beat the msieve E-score of the SNFS poly. However, the SNFS poly sieved much faster. I then used CADO to produce Murphy-E scores with more realistic parameters and this correctly showed the SNFS poly as the clear winner.

Let's see how 2,1091+ goes with 35-bit large primes. 2,1109+ is 5 digits larger so maybe 60% more difficult?
charybdis is offline   Reply With Quote
Old 2022-10-16, 15:50   #46
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

120108 Posts
Default

2,1091+ sieving has begun. Think I'll turn on my machine to at least make a small contribution to this effort.
pinhodecarlos is online now   Reply With Quote
Old 2022-11-02, 20:25   #47
frmky
 
frmky's Avatar
 
Jul 2003
So Cal

72×53 Posts
Default

2,2390L is done. Approximately 3.8 billion raw relations yielded 2.4 billion unique relations. These produced a 96.4M matrix, which took about 55 hours to solve on four nVidia A100's. The factors were found on the 18th (!) dependency after 58.5 hours. Of these, 11 dependencies failed because of the "bad" algebraic polynomial and 6 simply failed to find the factors.
frmky is offline   Reply With Quote
Old 2022-11-02, 22:21   #48
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

23×641 Posts
Default

For 2,1091+ how high will we be going for the Q range, 5000M? We are very close to the 2000M, did turn on my laptop ( you might have noticed a mini tiny peak, sorry about the server shake) and each wu now takes longer to be processed.
pinhodecarlos is online now   Reply With Quote
Old 2022-11-02, 22:55   #49
frmky
 
frmky's Avatar
 
Jul 2003
So Cal

259710 Posts
Default

Quote:
Originally Posted by pinhodecarlos View Post
For 2,1091+ how high will we be going for the Q range, 5000M?
Somewhere between 3B and 4B. Not sure where yet. Depends on how fast the sieving drops off.
frmky is offline   Reply With Quote
Old 2022-11-02, 23:03   #50
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

23×641 Posts
Default

Quote:
Originally Posted by frmky View Post
Somewhere between 3B and 4B. Not sure where yet. Depends on how fast the sieving drops off.

Sorry, you mean yield per special Q range, right? TIA.
pinhodecarlos is online now   Reply With Quote
Old 2022-11-02, 23:56   #51
frmky
 
frmky's Avatar
 
Jul 2003
So Cal

72·53 Posts
Default

Exactly.
frmky is offline   Reply With Quote
Old 2022-11-03, 19:34   #52
R.D. Silverman
 
R.D. Silverman's Avatar
 
"Bob Silverman"
Nov 2003
North of Boston

22·1,877 Posts
Default

Quote:
Originally Posted by frmky View Post
Somewhere between 3B and 4B. Not sure where yet. Depends on how fast the sieving drops off.

In general, if the yield per q drops off too rapidly, it usually means that the factor bases are too small.
[I'm not suggesting that this is the case here].
R.D. Silverman is offline   Reply With Quote
Old 2022-11-03, 21:24   #53
frmky
 
frmky's Avatar
 
Jul 2003
So Cal

72×53 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
In general, if the yield per q drops off too rapidly, it usually means that the factor bases are too small.
[I'm not suggesting that this is the case here].
That most definitely is the case here. I make the factor bases smaller than optimal to keep memory use under 1GB/core. This is a hard limit for numerous contributors to the project.
frmky is offline   Reply With Quote
Old 2022-11-09, 10:41   #54
R.D. Silverman
 
R.D. Silverman's Avatar
 
"Bob Silverman"
Nov 2003
North of Boston

1D5416 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
I believe that Greg will agree with the following......

Too big for NFS@Home. He has said SNFS 330/GNFS 225 is the limit. This places even 2,1097+
and 2, 2194L or M out of reach.




Yes. Add it to the Gang of 31 [will be 32]. Several efforts could not get a sufficiently good polynomial to do it by
GNFS (even though it is at the stated size limit) and is clearly too big via SNFS.

NFS@Home had to hit a ceiling sooner or later. C'est la vie.
The gang of 32 just became the gang of 31 again. Greg queued 2,1097+.......
R.D. Silverman is offline   Reply With Quote
Old 2022-11-13, 07:10   #55
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

23×641 Posts
Default

Greg, did you manage to get 2,1091+ into LA stage?
pinhodecarlos is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Recommended bases and efforts gd_barnes Conjectures 'R Us 189 2022-12-27 23:33
Doublecheck efforts; S66/S79 to start with gd_barnes Conjectures 'R Us 16 2014-08-07 02:11
Cunningham ECM Now Futile? R.D. Silverman GMP-ECM 4 2012-04-25 02:45
ECM efforts mistake? 10metreh mersennewiki 1 2008-12-28 13:31
ECM Efforts R.D. Silverman Factoring 63 2005-06-24 13:41

All times are UTC. The time now is 08:02.


Tue Jan 31 08:02:04 UTC 2023 up 166 days, 5:30, 0 users, load averages: 1.31, 1.09, 1.00

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, 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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔