![]() |
|
|
#1 |
|
"Mihai Preda"
Apr 2015
137110 Posts |
Let's play this theoretical trading game:
Let's say you completed PRP on some exponent. The result was "composite". The PRP has been verified. At this point you're sure the M(exponent) in question is composite. You do not doubt this fact a bit; but you don't have a factor. Now a magical genie (jinn) appears, and proposes you this trade: he would provide a factor for the exponent in question, in exchange for an amount of computation measured as a percent of one PRP test. What percent of one PRP are you willing to pay for a factor? [Note, we're talking about a factor of an already established-composite number, so the factor does not contribute to deciding primality.] At one extreme, you may answer: I already know that the candidate is composite, so I have no need for a factor; I'm willing to pay 0% (of one PRP test) for a factor. In the other direction, you may answer: even though I know it's composite, I consider a factor so cool in itself that I'm willing to pay ... this much % of one PRP for it. So, how much are you willing to pay for a factor for its own sake? Please post your amount (as a percentage of one PRP test) below. PS: maybe this should be turned into a poll? Last fiddled with by preda on 2020-08-15 at 08:13 |
|
|
|
|
|
#2 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
22·1,549 Posts |
A "percent of one PRP test" is not fixed value. So the cost is unknown at the time of the transaction.
Anyone entering into a contract for unknown costs would need to be crazy. ![]() So the genie is a trickster. DON'T DO ANY BUSINESS WITH IT.
|
|
|
|
|
|
#3 | |
|
"Mihai Preda"
Apr 2015
3×457 Posts |
Quote:
I imagine, if I took 1h to complete the PRR, or 1day, or 1month, I would probably also pay different (proportional?) amounts for a factor. |
|
|
|
|
|
|
#4 |
|
"Mihai Preda"
Apr 2015
25338 Posts |
The first data-point (to break the ice):
I would pay 5% for a factor. Maybe even a bit more, but clearly not more than 10%. Last fiddled with by preda on 2020-08-15 at 08:48 |
|
|
|
|
|
#5 |
|
"Robert Gerbicz"
Oct 2005
Hungary
148410 Posts |
A lot, maybe even 800% or more (for small exponent). Why? Because for semi prime Mersenne number even a single factor means that you have a full factorization. OK, without the proof that the factors are prime, but we have not that many full factorizations for Mersenne numbers.
Last fiddled with by R. Gerbicz on 2020-08-15 at 08:52 |
|
|
|
|
|
#6 | |
|
"Mihai Preda"
Apr 2015
3×457 Posts |
Quote:
Last fiddled with by preda on 2020-08-15 at 09:05 |
|
|
|
|
|
|
#7 |
|
"Robert Gerbicz"
Oct 2005
Hungary
22·7·53 Posts |
When you have the proof scheme then probably nothing, but say 1% if you have no proof scheme (it is still too generous as the prp has much less than 1% failure).
One advantage of a factor is that you can check it in linear time that d | Mp. You could say that it is pure theory, we haven't seen such things in Maths, then see this: https://hal.inria.fr/inria-00181029v1/document they provided a polynomial factor (the smallest degree divisor) for all reducible polynomial, much faster than the previous methods (if we count the time per polynomial). Last fiddled with by R. Gerbicz on 2020-08-15 at 10:00 |
|
|
|
|
|
#8 |
|
"Alex_soldier (GIMPS)"
Aug 2020
www.Mersenne.ru
2×3 Posts |
Upto 100% for ordinary exponent, because thit is better than Double-check.
Perhaps, the same price for each next factor of the same exponent, because this may be the only way to full factoring. And much more for small exponents, because their full factorings are more actual. For example, I calculated, 4624984171798410% has been already spent on M1277. |
|
|
|
|
|
#9 |
|
Aug 2020
1628 Posts |
If we consider factoring as goal that will eventually be reached (regardless of its relative priority to determining primality), then the percentage is certainly much more than 100%, given the algorthms we currently have. The expected amount of computation needed to find one factor for all composite mersenne numbers under a considerable exponent, say 100000, will certainly exceed (and might have already exceeded) the amount of computation needed to run a primality test on all of them. Many will succumb to TF, P-1, or ECM curves with small bounds, but there are a few diehards which have no small factors at all, inflating the overall average. So if we do the deal repeatedly with the genie at 100% for every composite mersenne number under a certain bound, we will almost certainly profit (in terms of computational output——We will lose the excitement, of course).
Last fiddled with by Ensigm on 2020-08-15 at 12:16 |
|
|
|
|
|
#10 |
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
23·1,223 Posts |
|
|
|
|
|
|
#11 |
|
P90 years forever!
Aug 2002
Yeehaw, FL
2·53·71 Posts |
I'd pay an extra 50% of a PRP test even for an ordinary looking 90ish-bit factor.
This may not be rational and is not best as far as GIMPS throughput goes, but for me it is a lot more satisfying to say "that Mersenne is composite, here's a factor" rather than "I ran a PRP test, and generated a proof file which I've since deleted, and it went through this process that I'm sure is secure and that process said the proof was valid, so that Mersenne number is really, really composite. Trust me". |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Fun factor | TheMawn | Lounge | 0 | 2014-04-11 02:41 |
| who can factor 10^100+27? | aaa120 | Factoring | 17 | 2008-11-13 19:23 |
| New factor | fivemack | ElevenSmooth | 4 | 2008-05-07 19:28 |
| P56 ECM Factor | wblipp | Factoring | 4 | 2005-04-23 11:41 |
| Shortest time to complete a 2^67 trial factor (no factor) | dsouza123 | Software | 12 | 2003-08-21 18:38 |