mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > NFS@Home

Reply
 
Thread Tools
Old 2016-06-26, 17:58   #606
jyb
 
jyb's Avatar
 
Aug 2005
Seattle, WA

110111001102 Posts
Default

Quote:
Originally Posted by pinhodecarlos View Post
From Jon Polynomials for homogeneous Cunningham numbers, rest on the attached file.
These polynomials didn't contain the parameters to use when I sent them to Carlos. SNFS difficulties range from 237 to 252 and judging by existing jobs at those levels, they should all be able to use the same values. The attached file contains the same polynomials as above, but with these parameter choices added, so they should all be ready to go right into the queue.

Example:
Code:
# 8-3,263
n: 1074220397608063744092456701155722449290119666365802488437623526859160975424802319394559862204759874721680339424141057973064241372305556832686404359799262209821344487053
# 8^263-3^263, difficulty: 238.89, skewness: 1.18, alpha: 0.00
skew: 1.178
c6: 3
c0: -8
Y1: -984770902183611232881
Y0: 5444517870735015415413993718908291383296
rlim: 134217727
alim: 134217727
lpbr: 31
lpba: 31
mfbr: 62
mfba: 62
rlambda: 2.6
alambda: 2.6

# 5+3,344
n: 50947357611569563899665041936661858420133932467666010404141837622987159151159644790341742059904557155078085087274009047956506693686019417370450122236059032711789321363607489
# 5^344+3^344, difficulty: 240.45, skewness: 0.84, alpha: 0.00
skew: 0.843
c6: 25
c0: 9
Y1: -1570042899082081611640534563
Y0: 6938893903907228377647697925567626953125
rlim: 134217727
alim: 134217727
lpbr: 31
lpba: 31
mfbr: 62
mfba: 62
rlambda: 2.6
alambda: 2.6
Attached Files
File Type: txt HCN_polys.txt (31.5 KB, 126 views)
jyb is offline   Reply With Quote
Old 2016-06-26, 19:13   #607
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

10011010100112 Posts
Default

Let's please queue all HCN composites. It will keep the clients busy for two months.
pinhodecarlos is offline   Reply With Quote
Old 2016-06-28, 23:10   #608
swellman
 
swellman's Avatar
 
Jun 2012

11×281 Posts
Default

Sorry for this cross post but the following list of candidates for NFS@Home was posted in the xyyxf sub-forum:

C200_123_79 * queued 29/6
C204_126_71 * queued 4/7
C223_139_48 * queued 29/6
C224_139_50 * queued 4/7
C235_141_49 * queued 30/6
C207_143_47 * queued 30/6
C235_143_48 * queued 30/6
C185_145_43 * queued 29/6
C207_145_48 * queued 30/6
C205_148_80 * queued 29/6

Not sure if it was noticed.

Last fiddled with by fivemack on 2016-07-04 at 08:49
swellman is online now   Reply With Quote
Old 2016-06-29, 16:34   #609
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

23·11·73 Posts
Default

I've queued five of the HCN numbers with difficulty above 250.
fivemack is offline   Reply With Quote
Old 2016-06-29, 16:56   #610
pinhodecarlos
 
pinhodecarlos's Avatar
 
"Carlos Pinho"
Oct 2011
Milton Keynes, UK

3·17·97 Posts
Default

Quote:
Originally Posted by fivemack View Post
I've queued five of the HCN numbers with difficulty above 250.
Thank you. Better reserve them here http://www.chiark.greenend.org.uk/uc...mack/homcun.pl.
pinhodecarlos is offline   Reply With Quote
Old 2016-06-29, 17:29   #611
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

23·11·73 Posts
Default

I'm going to try to build some automation for parameter choice and range selection for XYYXF numbers
fivemack is offline   Reply With Quote
Old 2016-06-30, 03:05   #612
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

3·3,221 Posts
Default

Quote:
Originally Posted by pinhodecarlos View Post
Thank you. Better reserve them here http://www.chiark.greenend.org.uk/uc...mack/homcun.pl.
I don't see anything with difficulty over 250 in that list (?!)
LaurV is offline   Reply With Quote
Old 2016-06-30, 06:02   #613
jyb
 
jyb's Avatar
 
Aug 2005
Seattle, WA

2·883 Posts
Default

Quote:
Originally Posted by LaurV View Post
I don't see anything with difficulty over 250 in that list (?!)
There are actually a small number of them. If you click on the "SNFS Difficulty (digits)" link, the table will by sorted by that and you can see the most difficult at the bottom.

However, that only partly answers the question. That web page calculates the SNFS difficulty by looking at the raw base and exponent values and doing the obvious thing. It doesn't take into account any increases in difficulty which might arise from having to actually generate practical polynomials for these numbers.

For example, 7+2,298 shows up with a difficulty of 251.8, because 298 * log107 = 251.8. However, in making a polynomial for SNFS at this approximate difficulty, one would use degree 6, which requires massaging sufficient to cause the difficulty to actually be 300*log107 + log104, which is 254.13.

After all such massaging is taken into account, there turn out to be 8 numbers with difficulty over 250. If you look at the combined .poly file I attached, you can see the most difficult numbers with something like this:
Code:
jon% grep difficulty HCN_polys.txt | sed -E 's/# ([^,]*),.*difficulty: ([^,]*),.*/\1: \2/g' | sort -n -k 2 -r
7^298+3^298: 254.48
7^298+2^298: 254.13
5^358+4^358: 252.83
5^359+3^359: 252.11
5^359+2^359: 251.93
8^277-3^277: 250.16
7^296+5^296: 250.15
7^296+4^296: 250.15
3^523-2^523: 249.53
12^226+5^226: 246.25
...

Last fiddled with by jyb on 2016-06-30 at 06:52 Reason: Most sed programs will need a -E flag for this to work.
jyb is offline   Reply With Quote
Old 2016-06-30, 11:16   #614
swellman
 
swellman's Avatar
 
Jun 2012

11·281 Posts
Default

Here's a few more xyyx candidates for 14e:

C183_131_61 QUEUED 30/6
C208_132_61 QUEUED 30/6
C201_126_73 QUEUED 30/6

I've started preprocessing the low SNFS xyyx numbers with ECM prior to suggesting them to NFS@Home. Thank you.

Last fiddled with by fivemack on 2016-06-30 at 14:21
swellman is online now   Reply With Quote
Old 2016-06-30, 12:15   #615
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

642410 Posts
Default Initial XYYXF automation script

candidates.txt has lines of the form C123_45_67

../results2.txt is the file http://www.primefan.ru/xyyxf/results2.txt

rename the (I am a stoat; the file is attached in a new thread elsewhere) as automate.py, run automate.py and then something like

Code:
for u in *.initial_snfs; do ../gnfs-lasieve4I14e -a $u -f 130000000 -c 10000 2> $u.Axt & ../gnfs-lasieve4I14e -r $u -f 130000000 -c 10000 2> $u.Rxt & done
I am sure my python is hopelessly unidiomatic, probably make a new thread elsewhere to complain about that -- this message is already getting off-topic for this thread.

(I am testing it on #608 and #614 so don't bother rerunning on those)

Last fiddled with by fivemack on 2016-07-04 at 08:51 Reason: observe that poster is a stoat
fivemack is offline   Reply With Quote
Old 2016-06-30, 15:31   #616
jyb
 
jyb's Avatar
 
Aug 2005
Seattle, WA

6E616 Posts
Default

Quote:
Originally Posted by fivemack View Post
rename the attached file as automate.py, run automate.py and then something like

Code:
for u in *.initial_snfs; do ../gnfs-lasieve4I14e -a $u -f 130000000 -c 10000 2> $u.Axt & ../gnfs-lasieve4I14e -r $u -f 130000000 -c 10000 2> $u.Rxt & done
Attached file?
jyb is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
System management notes kriesel kriesel 7 2020-10-21 18:52
Improving the queue management. debrouxl NFS@Home 10 2018-05-06 21:05
Script-based Primenet assignment management ewmayer Software 3 2017-05-25 04:02
Do normal adults give themselves an allowance? (...to fast or not to fast - there is no question!) jasong jasong 35 2016-12-11 00:57
Power Management settings PrimeCroat Hardware 3 2004-02-17 19:11

All times are UTC. The time now is 01:23.


Fri Aug 6 01:23:09 UTC 2021 up 13 days, 19:52, 1 user, load averages: 2.93, 2.50, 2.40

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.