mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > XYYXF Project

Reply
 
Thread Tools
Old 2016-06-27, 19:58   #56
XYYXF
 
XYYXF's Avatar
 
Jan 2005
Minsk, Belarus

24×52 Posts
Default

Now it's time to find a good poly for C178_131_81 to ensure that it's not an SNFS target :)
XYYXF is offline   Reply With Quote
Old 2016-06-30, 00:01   #57
wombatman
I moo ablest echo power!
 
wombatman's Avatar
 
May 2013

29·61 Posts
Default

I've started working on C174_136_69 at B1=110e6.
wombatman is offline   Reply With Quote
Old 2016-06-30, 12:16   #58
swellman
 
swellman's Avatar
 
Jun 2012

22·13·59 Posts
Default

Quote:
Originally Posted by XYYXF View Post
Now it's time to find a good poly for C178_131_81 to ensure that it's not an SNFS target :)
Should 10k curves @B1=26e7 be run first? Same thing with C178_133_71? Maybe yoyo will negate the need for poly searching. One can hope.
swellman is online now   Reply With Quote
Old 2016-07-02, 13:22   #59
XYYXF
 
XYYXF's Avatar
 
Jan 2005
Minsk, Belarus

24·52 Posts
Default

The chance to find a factor is small. But who knows, indeed...
XYYXF is offline   Reply With Quote
Old 2016-07-03, 10:24   #60
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

72×131 Posts
Default

I intend to run 20384 or so curves at B1=3e8 on C184_146_89
fivemack is offline   Reply With Quote
Old 2016-07-03, 11:07   #61
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

72·131 Posts
Default

Quote:
Originally Posted by swellman View Post
Should 10k curves @B1=26e7 be run first? Same thing with C178_133_71? Maybe yoyo will negate the need for poly searching. One can hope.
C178_133_71 will take less than three CPU-years to sieve.

A quick Bayesian analysis using a uniform prior and the approximations, good for N>=45, of

P(success at N digits for one 11e7 curve) = 16139*exp(-0.356N)
P(success at N digits for one 26e7 curve) = 9669*exp(-0.331N)

says that the probability of success for 10k curves at 26e7 after 18k curves at 11e7 is 7.5%, so it's worth spending 2000 hours but no more.

(in fact, this argument leads to one that it is only worth spending *any* curves at 26e7 after 18k curves at 11e7 if the GNFS takes longer than running 90,000 curves at 26e7, i.e. 45k hours or about 180 digits)

(likewise that it's only worth running any curves at 11e7 after 8000@43e6 if the GNFS takes longer than running 50,000 curves at 11e7, i.e. 12k hours or 172 digits)

I'm well aware that RDS has been talking about Bayesian analyses for years, but I was stalled because I thought it was necessary to use exact success probabilities: but the exponentials fit so well that I am reasonably happy with this vastly easier approach.
fivemack is offline   Reply With Quote
Old 2016-07-08, 14:59   #62
swellman
 
swellman's Avatar
 
Jun 2012

22×13×59 Posts
Default

Quote:
Originally Posted by XYYXF View Post
Now it's time to find a good poly for C178_131_81 to ensure that it's not an SNFS target :)
Noticed your request for GNFS polys over in the msieve forum. I've got the optimal SNFS poly and will run a comparison test sieve once msieve generates a poly.
swellman is online now   Reply With Quote
Old 2016-07-08, 21:36   #63
wombatman
I moo ablest echo power!
 
wombatman's Avatar
 
May 2013

33518 Posts
Default

I've started working on C174_136_75 at B1=110e6. The Stage 1 curves from C174_136_69 have been sent to Sean to carry out Stage 2.
wombatman is offline   Reply With Quote
Old 2016-07-10, 15:29   #64
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

11001000100112 Posts
Default

Quote:
Originally Posted by fivemack View Post
I intend to run 20384 or so curves at B1=3e8 on C184_146_89
Fairly quickly found a P52, I've mentioned it on the ECM thread.

Looking at C182_136_109 next; if I believe my new implementation of how-much-ECM then it needs about 5000 curves at B1=3e8, which will take about a week, before being ready for polynomial selection. I am running these.

Last fiddled with by fivemack on 2016-07-10 at 15:55
fivemack is offline   Reply With Quote
Old 2016-07-13, 16:30   #65
swellman
 
swellman's Avatar
 
Jun 2012

BFC16 Posts
Default

At the risk of smothering the GNFS efforts currently underway, I am proposing seven more candidates for the OP.

C195_148_83
C196_143_111
C196_146_83
C197_149_70
C198_143_115
C198_143_98
C200_139_113

All appear to be GNFS per test sieving and the methodology discussed previously.

These are not the only GNFS candidates I've identified, but I used an arbitrary cutoff of C200. There are 20 more composites so far that are very slow in SNFS and would seem better suited to GNFS. Size range is C201 to a breathtaking C230. 😳 I am not sure if there are clear lines of demarcation between hard to sieve, really hard and forget it but my list definitely strays into "here be dragons" territory.
swellman is online now   Reply With Quote
Old 2016-07-13, 16:35   #66
swellman
 
swellman's Avatar
 
Jun 2012

57748 Posts
Default Dragons

Here is the remainder of my list. Not sure which (if any) are practical GNFS targets.

C201_137_134
C202_147_116
C203_145_119
C203_146_107
C203_147_104
C203_137_127
C203_142_87
C204_147_118
C206_139_123
C207_143_127
C208_145_99
C211_137_135
C213_147_128
C213_141_113
C214_143_135
C214_143_119
C218_142_133
C222_149_141
C228_145_141
C230_149_136
swellman is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Ready GNFS targets XYYXF XYYXF Project 86 2020-03-07 16:23
SNFS targets which need more ECM XYYXF XYYXF Project 57 2017-07-04 19:15
Ready SNFS targets XYYXF XYYXF Project 25 2016-11-20 21:35
3,697+ (GNFS 220.9) pinhodecarlos NFS@Home 0 2014-12-24 19:13
3,766+ (GNFS 215.5) pinhodecarlos NFS@Home 34 2014-04-01 21:27

All times are UTC. The time now is 04:03.


Sat Jul 17 04:03:54 UTC 2021 up 50 days, 1:51, 1 user, load averages: 2.48, 2.17, 1.92

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