mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Conjectures 'R Us

Reply
 
Thread Tools
Old 2012-01-22, 14:24   #56
firejuggler
 
firejuggler's Avatar
 
Apr 2010
Over the rainbow

19·137 Posts
Default

http://mersenneforum.org/showpost.ph...51&postcount=1
first post of the Software/instructions/questions thread.



firejuggler is offline   Reply With Quote
Old 2012-01-22, 16:14   #57
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

635210 Posts
Default

It isn't clear to me if those are the current scripts.
rogue is offline   Reply With Quote
Old 2012-01-22, 18:22   #58
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

24·397 Posts
Default

I presume that the links in this post have the current scripts.
rogue is offline   Reply With Quote
Old 2012-01-22, 18:43   #59
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

141518 Posts
Default

Quote:
Originally Posted by rogue View Post
I presume that the links in this post have the current scripts.
Indeed, they do--those are the latest scripts that had been sent to me and are currently in use on the website.
mdettweiler is offline   Reply With Quote
Old 2012-01-22, 19:30   #60
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

18D016 Posts
Default

I'm trying to run them, but the version of awk on lion doesn't support strtonum(). I will try to install gawk from macports and see if that will do the trick.
rogue is offline   Reply With Quote
Old 2012-01-22, 21:06   #61
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

11000110100002 Posts
Default

You can add this to the 21_main.txt script. You can call the tables whatever you want. I have Table05 and Table07 (I had renumbered them in my copy of the script). You then have to modify 42_final_html.txt to add these two tables to the html generation. Marking conjectures are reserved is a bit more work.

## top20 unproven by test limit ########
END {cct1=0
for (q=1; q<=NR; q++) {
dlim[q] = "0000000000"
if (searchlim[q]!="proven" && searchlim[q]!="part tested") {
if (length(senotemp[q])==3) {dlim[q] = "0000000" senotemp[q]}
if (length(senotemp[q])==4) {dlim[q] = "000000" senotemp[q]}
if (length(senotemp[q])==5) {dlim[q] = "00000" senotemp[q]}
if (length(senotemp[q])==6) {dlim[q] = "0000" senotemp[q]}
if (length(senotemp[q])==7) {dlim[q] = "000" senotemp[q]}
if (length(senotemp[q])==8) {dlim[q] = "00" senotemp[q]}
if (length(senotemp[q])==9) {dlim[q] = "0" senotemp[q]}
dalim[q] = senotemp[q]
ckpro[q]=ck[q];basepro[q]=base[q];highnpro[q]=highn[q]
}
}
n1=asort(dlim,dtemp1)
#
print "\n<a name=\"Table05\"></a><h4>Top-20 unproven conjectures by test limit</h4></tr>" > "temp_"projshort"_html.htm"
print projbeg"<table border=\"1\">\n" > "temp_"projshort"_html.htm"
print projbeg"<tr class=\"toprow\">\n<th colspan=\"4\">"projlong"</th>\n"projend"</tr>\n" > "temp_"projshort"_html.htm"
print projbeg"<tr class=\"secrow\">\n<th>Base</th>\n<th>CK</th>\n<th>k remaining</th>\n<th>Test Limit</th>\n"projend"</tr>\n" > "temp_"projshort"_html.htm"
#
print "Top-20 unproven conjectures by test limit\n" > "temp_"projshort"_tables.txt"
printf (" %s \n",projlong) > "temp_"projshort"_tables.txt"
printf (" %5s %10s %15s %12s \n", " Base", "CK", "k remaining", "Test Limit") > "temp_"projshort"_tables.txt"

for (z=n1; z>=n1-19; z--) {
if (cct1==20) {break}
for (j=q; j>=1; j--) { if (dlim[j]==dtemp1[z]) {
if (dtemp[z]=="0") {continue}
if ((dtemp[z]==dtemp1[z-1]) && (cct1<19)) {continue}
printf ("| %5s %10s %10s %12s |\n",base[j],ck[j],kremain[j],dalim[j]) > "temp_"projshort"_tables.txt"
printf (projbeg"<tr align=\"right\">\n<td>%s</td>\n<td>%s</td>\n<td>%s</td><td>%s</td>\n"projend"</tr>\n", base[j], ck[j], kremain[j], dalim[j]) > "temp_"projshort"_html.htm"
cct1++
delete dlim[j]
}
if (cct1==20) {break}
}
}
print projend"</table>\n" > "temp_"projshort"_html.htm"
}


## top20 unproven by test limit decimal length ########
END {cct1=0
for (q=1; q<=NR; q++) {
dlim[q] = "0000000000"
dlen[q] = "0"
if (searchlim[q]!="proven" && searchlim[q]!="part tested") {
dalim[q] = senotemp[q]
dalen[q] = sprintf("%.0f", strtonum(senotemp[q]) * log(strtonum(base[q])) / log(10))
if (length(dalen[q])==3) {dlen[q] = "0000000" dalen[q]}
if (length(dalen[q])==4) {dlen[q] = "000000" dalen[q]}
if (length(dalen[q])==5) {dlen[q] = "00000" dalen[q]}
if (length(dalen[q])==6) {dlen[q] = "0000" dalen[q]}
if (length(dalen[q])==7) {dlen[q] = "000" dalen[q]}
if (length(dalen[q])==8) {dlen[q] = "00" dalen[q]}
if (length(dalen[q])==9) {dlen[q] = "0" dalen[q]}
}
}
n1=asort(dlen,dtemp1)
#
print "\n<a name=\"Table07\"></a><h4>Top-20 unproven conjectures by test limit decimal length</h4></tr>" > "temp_"projshort"_html.htm"
print projbeg"<table border=\"1\">\n" > "temp_"projshort"_html.htm"
print projbeg"<tr class=\"toprow\">\n<th colspan=\"5\">"projlong"</th>\n"projend"</tr>\n" > "temp_"projshort"_html.htm"
print projbeg"<tr class=\"secrow\">\n<th>Base</th>\n<th>CK</th>\n<th>k remaining</th>\n<th>Test Limit</th><th>Decimal Length</th>\n"projend"</tr>\n" > "temp_"projshort"_html.htm"
#
print "Top-20 unproven conjectures by test limit decimal length\n" > "temp_"projshort"_tables.txt"
printf (" %s \n",projlong) > "temp_"projshort"_tables.txt"
printf (" %5s %10s %15s %12s %8s \n", " Base", "CK", "k remaining", "Test Limit", "Decimal Length") > "temp_"projshort"_tables.txt"

for (z=n1; z>=n1-19; z--) {
if (cct1==20) {break}
for (j=q; j>=1; j--) { if (dlen[j]==dtemp1[z]) {
if (dtemp[z]=="0") {continue}
if ((dtemp[z]==dtemp1[z-1]) && (cct1<19)) {continue}
printf ("| %5s %10s %10s %12s %8s |\n",base[j],ck[j],kremain[j],dalim[j],dalen[j]) > "temp_"projshort"_tables.txt"
printf (projbeg"<tr align=\"right\">\n<td>%s</td>\n<td>%s</td>\n<td>%s</td><td>%s</td><td>%s</td>\n"projend"</tr>\n", base[j], ck[j], kremain[j], dalim[j], dalen[j]) > "temp_"projshort"_html.htm"
cct1++
delete dlen[j]
}
if (cct1==20) {break}
}
}
print projend"</table>\n" > "temp_"projshort"_html.htm"
}
rogue is offline   Reply With Quote
Old 2012-01-22, 21:34   #62
mdettweiler
A Sunny Moo
 
mdettweiler's Avatar
 
Aug 2007
USA (GMT-5)

3·2,083 Posts
Default

Hmm...okay. I'm not particularly familiar with the inner workings of the scripts myself; basically I've just plopped them into the web site as-is and set up cron jobs to run them on a schedule. Could you possibly send me your latest version of the complete files for the modified scripts (which I'm guessing you have anyway from testing things on your end)? Thanks.
mdettweiler is offline   Reply With Quote
Old 2012-01-22, 21:45   #63
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

24·397 Posts
Default

I've attached the two scripts I modified.
Attached Files
File Type: zip stats.zip (7.5 KB, 93 views)
rogue is offline   Reply With Quote
Old 2012-01-23, 13:38   #64
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

24·397 Posts
Default

I'm working on the changes to show reserved bases on the crus-stats page. In the process I'm going to clean up the awk scripts. They could use a little reformatting to enhance readability.
rogue is offline   Reply With Quote
Old 2012-01-23, 22:29   #65
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

24·397 Posts
Default

I've attached the updated scripts. I did the following:

1) wget the reservation pages
2) Use the reservation pages to show reserved conjectures in yellow
3) Add two tables: "Top-20 unproven conjectures by highest tested n" and "Top-20 unproven conjectures by highest tested decimal length"
4) Cleaned up the scripts so enhance readability (and maintainability)
5) Add a "partially tested" column. This reflects bases where some k, but not all k have been tested.
6) Replace text like this "There are 7 conjectures with CK>=1T (0.7% of total). 85.7% remain untested, 0.0% are proven" with a table.
7) Fixed the count of calculation of "largest group of consecutive proven" values. Under some conditions, this could produce erroneous results.

For some reason, my build of gawk had a problem with the built-in getline() function. It works fine in BEGIN sections, but not in END sections. This causes the weight to not be correct. Someone will need to run this script independently to ensure that it populates that table correctly.

You can see the new layout here. Of course Gary will need to decide if he wants to run with these as I can't update the server.

In theory, it should be easy to modify the scripts behind http://www.noprimeleftbehind.net/crus/tab/CRUS_tab.htm to do something similar, but I will leave that to the interested reader.

In theory, it should be easy to use the scripts to build an html page that has all reservations (and just reservations). I view that as a quick reference page to see what is reserved, when and by whom. IMO, it would only show conjectures with reservations, thus be a much smaller version of the current reservation pages. Again, that can be left to the interested reader.
Attached Files
File Type: zip vstats.zip (61.4 KB, 73 views)
rogue is offline   Reply With Quote
Old 2012-01-23, 23:05   #66
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

24·593 Posts
Default

"Top-20 Proven Conjectures by Highest Conjectured K" section (vstats/crus-stats.htm#Table10) appears to be sorted reverse-literal (not reverse-numeric): CK of 98 is top in both sections.
Batalov is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Sieving for CRUS rebirther Conjectures 'R Us 638 2021-06-15 07:55
BOINC effort for CRUS gd_barnes Conjectures 'R Us 75 2015-06-17 14:25
What are your CRUS plans? rogue Conjectures 'R Us 35 2013-11-09 09:03
how high will CRUS go Mini-Geek Conjectures 'R Us 1 2010-11-08 20:50
CSVs for stats available + New combined stats opyrt Prime Sierpinski Project 3 2010-05-31 08:13

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


Tue Jul 27 10:17:16 UTC 2021 up 4 days, 4:46, 0 users, load averages: 1.82, 2.07, 1.99

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.