mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Cunningham Tables

Reply
 
Thread Tools
Old 2022-10-06, 22:02   #34
R.D. Silverman
 
R.D. Silverman's Avatar
 
"Bob Silverman"
Nov 2003
North of Boston

23·937 Posts
Default

Quote:
Originally Posted by frmky View Post
Likely since the e-score is an integral combining contributions from both size and root optimization. msieve reports both the final norm characterizing the size and alpha characterizing the root properties of the polynomials. Attached are histograms of each of these separately for the same 2 million polynomials.
The alpha pdf does seem to have a longer tail to the right.
R.D. Silverman is offline   Reply With Quote
Old 2022-10-06, 22:26   #35
frmky
 
frmky's Avatar
 
Jul 2003
So Cal

1001111001012 Posts
Default

Quote:
Originally Posted by R.D. Silverman View Post
The alpha pdf does seem to have a longer tail to the right.
Yes, but also that's the worse side. Better root properties correspond to the left side of the distribution.
frmky is offline   Reply With Quote
Old 2022-11-20, 09:42   #36
Gimarel
 
Apr 2010

5×72 Posts
Default

A few better polys:
Code:
n: 126451876805119252959661548967232013601866431183534308908427174011662073024932261126233275630388431500884665768427172907593022873289431612806891303891687570778305960728323476541491713906981621716831593952842244282430058291761
# norm 4.071969e-16 alpha -9.752538 e 2.347e-16 rroots 4
skew: 4099972.17
c0: 75411469889145395046741594539510303818011021471
c1: -19691135073162315084594784624103449198750
c2: -99438233376176899175468255217094130
c3: 4394174158803947144118894880
c4: 16400189169252108563099
c5: -232506169843650
c6: 4347000
Y0: -2754045785939680784737571685756365496
Y1: 4538373177770229797351
# MurphyF (Bf=6.872e+10,Bg=3.436e+10,area=1.766e+18) = 2.477e-09

n: 126451876805119252959661548967232013601866431183534308908427174011662073024932261126233275630388431500884665768427172907593022873289431612806891303891687570778305960728323476541491713906981621716831593952842244282430058291761
# norm 4.143131e-16 alpha -9.942142 e 2.339e-16 rroots 6
skew: 45290543.52
c0: -269505104302737992226579881824069273348411150390400
c1: 31592047037538685851862704375760833455315760
c2: 1703133447582614942920906384956167268
c3: -129971466498994600011942115252
c4: -2314332759744553531033
c5: 29445952854202
c6: 50400
Y0: -3686227314243652116010167240943024263
Y1: 30016011206759833401211
# MurphyF (Bf=6.872e+10,Bg=3.436e+10,area=1.766e+18) = 2.466e-09

n: 126451876805119252959661548967232013601866431183534308908427174011662073024932261126233275630388431500884665768427172907593022873289431612806891303891687570778305960728323476541491713906981621716831593952842244282430058291761
# norm 4.031559e-16 alpha -12.133288 e 2.292e-16 rroots 4
skew: 29346738.87
c0: 59455777517328054184793219662976360401235607337335
c1: 112779972076226040399992792530106515604140047
c2: -4298413822937233372631606035726816679
c3: -1413322411017627466877645728827
c4: -821206219249483879936
c5: 180781205008140
c6: 2494800
Y0: -2774524181546352716484898272284905686
Y1: 85331174827726081541743
# MurphyF (Bf=6.872e+10,Bg=3.436e+10,area=1.766e+18) = 2.433e-09
I'll continue searching if testsieving indicates that these are at least competitive to the snfs poly.
Gimarel is offline   Reply With Quote
Old 2022-11-21, 21:13   #37
swellman
 
swellman's Avatar
 
Jun 2012

2×3×17×37 Posts
Default

Regardless of which way 2,1109+ ultimately goes (i.e. SNFS or GNFS), do we still want to first run ECM on it as part of the “Gang of 31”? Which likely won’t start for another 4-6 weeks but I can make sure it’s first in queue.

Or are the chances of an ECM hit too low to bother delaying NFS for this particular composite by weeks or months?

Looking further ahead, if 2,1097+ proves to be within the capabilities of NFS@Home then perhaps the few composites of similar difficulty on the 1987 Cunningham base-2 list could be factored immediately while 2,1109+ undergoes ECM. Many paths forward becoming available.
swellman is offline   Reply With Quote
Old 2022-11-22, 00:08   #38
R.D. Silverman
 
R.D. Silverman's Avatar
 
"Bob Silverman"
Nov 2003
North of Boston

23×937 Posts
Default

Quote:
Originally Posted by swellman View Post
Regardless of which way 2,1109+ ultimately goes (i.e. SNFS or GNFS), do we still want to first run ECM on it as part of the “Gang of 31”? Which likely won’t start for another 4-6 weeks but I can make sure it’s first in queue.
It is unclear to me.
Quote:

Or are the chances of an ECM hit too low to bother delaying NFS for this particular composite by weeks or months?
I don't think a delay would matter. More ECM will not hurt in any case.

Quote:
Looking further ahead, if 2,1097+ proves to be within the capabilities of NFS@Home then perhaps the few composites of similar difficulty on the 1987 Cunningham base-2 list could be factored immediately while 2,1109+ undergoes ECM. Many paths forward becoming available.
Whatever Greg decides is fine with me. I have no opinion. They will all get done eventually.
R.D. Silverman is offline   Reply With Quote
Old 2022-11-22, 03:02   #39
frmky
 
frmky's Avatar
 
Jul 2003
So Cal

9E516 Posts
Default

Presuming 2,1097+ goes ok, I'll do 2,2194L&M next. That'll give you some time for ECM.
frmky is offline   Reply With Quote
Old 2022-11-22, 10:22   #40
sweety439
 
sweety439's Avatar
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

71028 Posts
Default

Quote:
Originally Posted by frmky View Post
Presuming 2,1097+ goes ok, I'll do 2,2194L&M next. That'll give you some time for ECM.
See https://homes.cerias.purdue.edu/~ssw/cun/appc722.txt, you can consider 3,715-, 2,2874M, 10,710M, 7,419- (just a suggestion)
sweety439 is offline   Reply With Quote
Old 2022-11-22, 10:26   #41
sweety439
 
sweety439's Avatar
 
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36

2×52×73 Posts
Default

Quote:
Originally Posted by charybdis View Post
To the best of my knowledge, no number between 222 and 229 digits has ever been factored with GNFS
Are there any numbers with > 229 digits ever been factored with GNFS (a challenge, factor the 230-digit composite cofactor of R383 with GNFS)? If not, then this 221-digit cofactor of 2,2246M is the largest number which has ever been factored with GNFS

Last fiddled with by sweety439 on 2022-11-22 at 10:28
sweety439 is offline   Reply With Quote
Old 2022-11-22, 12:32   #42
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Liverpool (GMT/BST)

27·47 Posts
Default

Quote:
Originally Posted by sweety439 View Post
See https://homes.cerias.purdue.edu/~ssw/cun/appc722.txt, you can consider 3,715-, 2,2874M, 10,710M, 7,419- (just a suggestion)

I believe he is well aware of this list.



Quote:
Originally Posted by sweety439 View Post
Are there any numbers with > 229 digits ever been factored with GNFS (a challenge, factor the 230-digit composite cofactor of R383 with GNFS)? If not, then this 221-digit cofactor of 2,2246M is the largest number which has ever been factored with GNFS

A very quick google suggested that RSA 768(232 digits), RSA-240 and RSA-250 have all been factored with more digits than this.
henryzz is offline   Reply With Quote
Old 2022-11-22, 12:47   #43
swellman
 
swellman's Avatar
 
Jun 2012

377410 Posts
Default

Quote:
Originally Posted by frmky View Post
Presuming 2,1097+ goes ok, I'll do 2,2194L&M next. That'll give you some time for ECM.
Ok I will enqueue 2,1109+ this week. Hoping it gets processed by February, possibly sooner if Yoyo’s recent surge keeps up.
swellman is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Polynomial selection Max0526 NFS@Home 9 2017-05-20 08:57
Updated polynomial selection jasonp Msieve 65 2011-05-01 19:06
GNFS polynomial selection Unregistered Information & Answers 3 2011-04-16 14:24
2^877-1 polynomial selection fivemack Factoring 47 2009-06-16 00:24
Polynomial selection CRGreathouse Factoring 2 2009-05-25 07:55

All times are UTC. The time now is 10:26.


Wed Dec 7 10:26:06 UTC 2022 up 111 days, 7:54, 0 users, load averages: 0.62, 0.69, 0.78

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.

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