Pascal's OPN roadblock files

[wombatman]

And nevermind. I just had some parameters poorly chosen. Letting factmsieve.py choose fixed it up. I've got it running overnight on 6 threads of an i7 laptop. Let's see how far it gets.

[RichD]

Alex (akruppa) has a nice write up on this technique in the forum. I'll see if I can find it later today or tomorrow. (Or if someone can find/post it sooner.)

In the meantime, I have polys for the other candidates from the t500.txt file. Notice the last one is a very large job.

7176374761323733117 10

n: 4333672608561400392468435371252369910952175743673535954847528438755330426378888688344890271646226690658741722175084519329620055692562557835697404456447191
# 7176374761323733117^11-1, difficulty: 188.56, skewness: 1.00, alpha: 2.22
# cost: 5.10808e+16, est. time: 24.32 GHz days (not accurate yet!)
skew: 1.000
c5: 1
c4: 1
c3: -4
c2: -3
c1: 3
c0: 1
Y1: -7176374761323733117
Y0: 51500354714964267461382123205042535690
m: 4175449660431940680801462398720637573454718435410724619429434647286979789924092256110020212144851936807023998921154920859727195748106030811008026111736877
type: snfs


9460375336977361 12

n: 209975551157110378892620870103389947805798162009922409120709010153235407321896287264941665911761329863093997764496737809571093731283681478508421978895251769232338342844812999720816439
# 9460375336977361^13-1, difficulty: 191.71, skewness: 1.00, alpha: 3.10
# cost: 6.78261e+16, est. time: 32.30 GHz days (not accurate yet!)
skew: 1.000
c6: 1
c5: 1
c4: -5
c3: -4
c2: 6
c1: 3
c0: -1
Y1: -9460375336977361
Y0: 89498701516489516694491826524322
m: 209975496833072993031777094914692671678971021978566096082083728449322701929753343409485989657280964509270796562729338195171925885593050927551302334398083641662216471838881292896136028
type: snfs


9791642389174771 12

n: 364549208027099682752073528858182603803105960625100051927457251599935464619258371331871971280959126288643305544010164402276270051695066401730376227076800071989921006596834646301869351
# 9791642389174771^13-1, difficulty: 191.89, skewness: 1.00, alpha: 3.10
# cost: 6.89236e+16, est. time: 32.82 GHz days (not accurate yet!)
skew: 1.000
c6: 1
c5: 1
c4: -5
c3: -4
c2: 6
c1: 3
c0: -1
Y1: -9791642389174771
Y0: 95876260677484217584966382902442
m: 364549128701935172751610082076843178604422196867651351870618289633860590401979379495829190274537190161844642056498627741188970435031995718322882071308704278720781242353917087003516290
type: snfs


5081095716541357 12

n: 296134164124765620221178183504283937229641183267132524994276310350894537114341880478369348235566913164345528919663747110052527195669224456723544074276705430456760621790360950150531715966101
# 5081095716541357^13-1, difficulty: 188.47, skewness: 1.00, alpha: 3.10
# cost: 5.0678e+16, est. time: 24.13 GHz days (not accurate yet!)
skew: 1.000
c6: 1
c5: 1
c4: -5
c3: -4
c2: 6
c1: 3
c0: -1
Y1: -5081095716541357
Y0: 25817533680654926123346291401450
m: 296134164124765561939622266202903985335883085507537392204547512250277181744893366581529666027889910897764562852524284410286982854762316363995370278766687775412815047547255078553216770920158
type: snfs


5079304643216687969 12

n: 13227926040671587259710837611313899966904825456092440142374298131942234472692779854055273389506354271426710015812106476351183882963368073614494325473781371808578738391512293610688508221977940908013893290690463947815551
# 5079304643216687969^13-1, difficulty: 224.47, skewness: 1.00, alpha: 3.10
# cost: 1.10965e+18, est. time: 528.41 GHz days (not accurate yet!)
skew: 1.000
c6: 1
c5: 1
c4: -5
c3: -4
c2: 6
c1: 3
c0: -1
Y1: -5079304643216687969
Y0: 25799335658602605863094833809909344962
m: 13227926040613531291022054517611440014488409954166387411585758597925934073636883768118050976671464881310131855093827946354434775202072017634986132886020602419884754213498933879730975150215345857400071630616934067367700
type: snfs

[RichD]

Originally Posted by RichD

Wow, a lot more in the C190s. All the other "ten" ranges only had 4 or 5 composites. This range still has 21 remaining. I've generated all the SNFS polynomials.

I've noticed the numbers are removed from the file within hours of posting them to factordb.com, so I quit posting them to the Gratuitous thread. I thought I was down to 13 remaining (below C200) but after careful inspection, there are 24 remaining in the file. (C153-C199)

There appears to be an automated process to inquire FDB, remove what's been found, and generate more limbs to work. I guess this will be a never ending process.

P.S. This refers to "A list of the most difficult composites for the proof of N > 10^2000"
I don't know about the other (tXXX.txt) files.

[RichD]

Originally Posted by RichD

Alex (akruppa) has a nice write up on this technique in the forum.

Finally found it in this post, section d.

Or if you are too lazy (like me) you can use his phi program to generate the polynomials.

[RichD]

Also Φ3(Φ3(n)) can use the polynomial x^4 + 2*x^3 + 4*x^2 + 3*x + 3, x = n.
(Likewise. Φ3(Φ3(n)/a) with small a.)
As stated here and here, but these are hard to come by.

[wombatman]

Thanks for digging those up. Now I have to figure out why I'm making phi crash. I'm trying to get the same poly you did for

7176374761323733117 10

I used

 phi 11 7176374761323733117 (cofactor)

Am I on the right track?


Edit: And I got it working. Just have to put everything in properly. I'll read through the post and try to understand exactly what I'm doing with the phi program as well.

[wombatman]

Grabbing 7176374761323733117 10

[wombatman]

Also grabbing 9460375336977361 12

[wombatman]

Running 9791642389174771 12

[wombatman]

Grabbing 5081095716541357 12

[wombatman]

Running 329473262366294657316493043899400715093065093 4