![]() |
|
|
#375 | |
|
Dec 2012
2×139 Posts |
Quote:
It would be nice if I could search for exponents with less than 0.2 GHzd spent on P-1, and if the form then gave me bounds that achieved that. Combined probability is a fine metric, but I lean more towards wanting to search by GHzd. Maybe it's stupid for me to want that? |
|
|
|
|
|
|
#376 |
|
"James Heinrich"
May 2004
ex-Northern Ontario
342710 Posts |
|
|
|
|
|
|
#377 |
|
Dec 2012
11616 Posts |
Apologies. When I take the Pfactor lines from the link I posted above, it says, "M4025627 does not need P-1 factoring." Again, Pminus1 does work, but the bounds are lower than what have already been done.
Am I doing something wrong? |
|
|
|
|
|
#378 |
|
"James Heinrich"
May 2004
ex-Northern Ontario
1101011000112 Posts |
Ah, I see what's going on with those particular examples. Taking M4,024,717 for example, GIMPS would assign TF to 261 by default, then some P-1 afterwards, both at somewhat under 1GHz-day of work. However, someone has reported a massive amount of TF work on these exponents (as in 2000+GHz-days per exponent) taking the TF level up to 276. A side effect of increased TF level is that the probability of a P-1 factor for any given bounds decreases as the starting TF level increases, and because these exponents (~4M) have been so over-TF'd it makes the P-1 seem to have a low probability, even though the P-1 done is 10x more effort than GIMPS default.
It's for that reason that the page is supposed to work on "combined probability", but thanks for pointing out that I'd missed some part of that and exponents were being shown as "low P-1 probability" when in fact they've had a large amount for work done. I have fixed the page now and you'll see in the 4M range that there's not much left with a <10% probability. That would be an easy search if I had that data stored in the database, but I don't (currently). It's not impossible to add, but it would involve modifying the table of ~24 million records and then calculating GHz-d values and updating all those rows, a non-trivial task. Last fiddled with by James Heinrich on 2014-11-13 at 13:27 |
|
|
|
|
|
#379 | |
|
Dec 2012
2×139 Posts |
Quote:
If I'm set on spending a certain amount of GHzd, I guess I'll have to find another way. This is why I wanted to be able to search for exponents not meeting certain bounds. Now that I think of it, we are now able to sort results, so it wouldn't be a monumental task to collect such numbers myself. I can easily set a range (4M-4.1M) and just sort by B1. I might be able to rig up a spreadsheet or something. |
|
|
|
|
|
|
#380 | |
|
Serpentine Vermin Jar
Jul 2014
3,313 Posts |
Quote:
The tools at my disposal are just whatever the Primenet database stores on such things... TF factored depth is one thing, but when it comes to finding poorly factored ECM or P-1, I tend to nod off.
|
|
|
|
|
|
|
#381 | |
|
"James Heinrich"
May 2004
ex-Northern Ontario
23×149 Posts |
Quote:
|
|
|
|
|
|
|
#382 |
|
Apr 2014
27 Posts |
Recent Results and Recent Cleared no longer have the ability to sort.
|
|
|
|
|
|
#383 | |
|
Serpentine Vermin Jar
Jul 2014
3,313 Posts |
Quote:
Let me know if you still have any issues with it after refreshing the page. If I had to guess, the full table hadn't loaded yet or something when you tried? I hope that's all it was anyway. |
|
|
|
|
|
|
#384 |
|
Jul 2004
Milan, Ita
2·7·13 Posts |
A few moments ago, I was trying to access exponent details, and I got this:
Code:
Parse error: syntax error, unexpected ';' in C:\inetpub\v5\v5server\gimps\0.95_ar2_app.php on line 287 |
|
|
|
|
|
#385 |
|
"James Heinrich"
May 2004
ex-Northern Ontario
23×149 Posts |
Last fiddled with by James Heinrich on 2014-12-02 at 14:09 |
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Database design | xilman | Astronomy | 1 | 2017-04-30 22:25 |
| Theoretical Experiment Design | c10ck3r | Homework Help | 7 | 2015-02-03 08:54 |
| Digital Logic Design | henryzz | Puzzles | 9 | 2014-12-04 20:56 |
| new intel design | tha | Hardware | 5 | 2007-04-19 11:38 |
| design factoring algorithms | koders333 | Factoring | 14 | 2006-01-25 14:08 |