mersenneforum.org How I could assign a trial factorization Prime95?
 Register FAQ Search Today's Posts Mark Forums Read

 2010-02-01, 16:25 #1 bloodIce     Feb 2010 Sweden 173 Posts How I could assign a trial factorization Prime95? Hello, I would like to work on trial factorization of 2^1061-1 to extend it from the current state. So far it has been tried up to factors of 2^62. Could you please help me to assign a job for 2^62-2^63 and so far.
 2010-02-01, 18:35 #2 Mini-Geek Account Deleted     "Tim Sorbera" Aug 2006 San Antonio, TX USA 4,271 Posts Considering the ECM that has been done on it, TF from 2^62 to 2^63 is (nearly) guaranteed to be absolutely useless. This is the line you would add to worktodo.txt to have Prime95 TF it from 2^62 to 2^63, but it tells you to use ECM instead and doesn't let you do it: Code: Factor=1061,62,63 Last fiddled with by Mini-Geek on 2010-02-01 at 18:35
2010-02-01, 18:37   #3
xilman
Bamboozled!

"𒉺𒌌𒇷𒆷𒀭"
May 2003
Down not across

255748 Posts

Quote:
 Originally Posted by bloodIce Hello, I would like to work on trial factorization of 2^1061-1 to extend it from the current state. So far it has been tried up to factors of 2^62. Could you please help me to assign a job for 2^62-2^63 and so far.
You are extremely unlikely to find any factors by trial division.

This number has had so much ECM work done on it that the chance of it having a factor of under 150 bits is somewhere between nil and negligible. You would be wasting your time and your electricity bill.

If you don't understand that claim, or don't believe it, please Google "elliptic curve method".

However, there are many other computations you could perform with a much, much greater probability of achieving a useful result. Quite a few people here could make suggestions, including myself.

Paul

P.S. Don't be dismayed by some of the reactions your proposal may elicit... Developing a thick skin is part of the entry requirements for playing an active part in on-line discussions.

 2010-02-01, 22:01 #4 bloodIce     Feb 2010 Sweden 173 Posts I agree that there is not much reason to check for lower factors, however if we want to be systematic, we should start from somewhere. The argument to continue what is done to 2^62 is that even a small chance that factor in that range exists, that should be checked and eventually eliminated as possibility. The problem is that the server does not recognize my assignment as Factor=1061,62,63 even not as Factor=1061,81,82. My attitude might be close to absolute stupidity, however why not to check systematically (step by step) for factors up to 250 bits if you wish . Is there another way to assign what I want (do not bother about my electricity bill, but only about my curiosity)? @xilman: If you have any idea, where I could use my processors better, please let me know. If something more useful can be done, lets do it then . Last fiddled with by bloodIce on 2010-02-01 at 22:05
 2010-02-01, 22:23 #5 Uncwilly 6809 > 6502     """"""""""""""""""" Aug 2003 101×103 Posts 29·353 Posts If you absolutely feel that you need to do that, you can do it and turn in the result. Since the server won't assign that (since the CPU is better used by doing ECM), it won't give you an assignment key. There are are ways to do the work. If you poke around the forum you may find them. While you are doing that, maybe you can do some ECM. If a factor is found by ECM, it may lead to the complete factorization. 971 (the last of the small expos without a known factor) has a factor of 174 bits. It is a complete waste of time to try a work your way up to that level. Last fiddled with by Uncwilly on 2010-02-01 at 22:24
2010-02-01, 22:25   #6
petrw1
1976 Toyota Corona years forever!

"Wayne"
Nov 2006

2·32·277 Posts

Quote:
 Originally Posted by bloodIce Factor=1061,62,63 Factor=1061,81,82
Besides Electricity, are you aware that according to http://mersenne-aries.sili.net/credit.php ... which is proven reliable

Factor=1061,62,63 - would take 1 core of a high-end Quad much of a year to complete?
Factor=1061,81,82 - ... in the order of 100 Million years?

2010-02-01, 22:32   #7
mdettweiler
A Sunny Moo

Aug 2007
USA (GMT-5)

3×2,083 Posts

Quote:
 Originally Posted by petrw1 Besides Electricity, are you aware that according to http://mersenne-aries.sili.net/credit.php ... which is proven reliable Factor=1061,62,63 - would take 1 core of a high-end Quad much of a year to complete? Factor=1061,81,82 - ... in the order of 100 Million years?
What the heck? A year to TF an exponent from 62 to 63 bits? (Or is the "slight" decrease in primes to test as exponent increases enough to make it take that long at this extreme low end of things?)

2010-02-01, 22:37   #8
Uncwilly
6809 > 6502

"""""""""""""""""""
Aug 2003
101×103 Posts

1023710 Posts

Quote:
 Originally Posted by petrw1 Factor=1061,62,63 - would take 1 core of a high-end Quad much of a year to complete?
You could instead do 2000 curves at B1=1000000000 B2=5000000000 in less than a GHz year.

I would suggest that you ask some who knows what bounds to run, instead of what you have been doing.
Code:
History 3 curves, B1=260000000, B2=26000000000 by "THK" on 2010-01-30
History 3 curves, B1=260000000, B2=26000000000 by "THK" on 2010-01-30
History 3 curves, B1=260000000, B2=26000000000 by "THK" on 2010-01-30
History 3 curves, B1=260000000, B2=26000000000 by "THK" on 2010-01-30
History 100 curves, B1=1000000, B2=100000000 by "ANONYMOUS" on 2010-01-30
History 100 curves, B1=1000000, B2=100000000 by "ANONYMOUS" on 2010-01-30
History 100 curves, B1=1000000, B2=100000000 by "ANONYMOUS" on 2010-01-30
History 100 curves, B1=1000000, B2=100000000 by "ANONYMOUS" on 2010-01-30
History 100 curves, B1=1000000, B2=100000000 by "ANONYMOUS" on 2010-01-30
History 100 curves, B1=1000000, B2=100000000 by "ChuckEtienne" on 2010-01-31
History 2 curves, B1=1000000, B2=100000000 by "BloodIce" on 2010-01-31
History 2 curves, B1=1000000, B2=100000000 by "BloodIce" on 2010-01-31
History 100 curves, B1=1000000, B2=100000000 by "BloodIce" on 2010-01-31
History 10 curves, B1=10000000, B2=1000000000 by "BloodIce" on 2010-01-31
History 10 curves, B1=12000000, B2=1200000000 by "BloodIce" on 2010-01-31
History 100 curves, B1=3000, B2=300000 by "BloodIce" on 2010-01-31
History 500 curves, B1=30000, B2=3000000 by "BloodIce" on 2010-01-31
History 100 curves, B1=30000, B2=30000000 by "BloodIce" on 2010-01-31
History 50 curves, B1=300000, B2=300000000 by "BloodIce" on 2010-01-31
History 100 curves, B1=200000, B2=20000000 by "BloodIce" on 2010-01-31
History 10 curves, B1=1000000, B2=100000000 by "BloodIce" on 2010-01-31
History 400 curves, B1=50000, B2=5000000 by "BloodIce" on 2010-02-01

2010-02-01, 22:39   #9
axn

Jun 2003

11·479 Posts

Quote:
 Originally Posted by mdettweiler What the heck?
What did you expect?

2010-02-01, 22:41   #10
mdettweiler
A Sunny Moo

Aug 2007
USA (GMT-5)

141518 Posts

Quote:
 Originally Posted by axn What did you expect?
I expected something more along the lines of the less than half a GHz-day or so that it would take to do a leading-edge exponent to the same level...according to the calculator it would be ~.4 Ghz-days even for just a 2M exponent.

2010-02-01, 22:58   #11
petrw1
1976 Toyota Corona years forever!

"Wayne"
Nov 2006

2·32·277 Posts

Quote:
 Originally Posted by mdettweiler I expected something more along the lines of the less than half a GHz-day or so that it would take to do a leading-edge exponent to the same level...according to the calculator it would be ~.4 Ghz-days even for just a 2M exponent.
From "The Math" page: http://www.mersenne.org/various/math.php
Quote:
 One very nice property of Mersenne numbers is that any factor q of 2^P-1 must be of the form 2kp+1. Furthermore, q must be 1 or 7 mod 8.
As the exponents get bigger there are fewer and fewer possible factors to test in a given bit range; hence less time to complete.

Homework:
a. How many 2kp+1 possibilities are there at 62 bits for p=1061?
b. How many for p=2,000,001?
c. What is the ratio? i.e. How many times more work is involved?

1061 is small number in itself and so 2^1061-1 has the illusion of being small however it is over 300 digits long.

 Similar Threads Thread Thread Starter Forum Replies Last Post Anonuser Information & Answers 13 2014-09-09 01:43 Miszka Information & Answers 3 2013-08-01 04:57 Unregistered Information & Answers 4 2009-11-09 07:18 ixfd64 Software 1 2006-03-30 13:39 thomasn NFSNET Discussion 1 2004-11-04 08:42

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

Fri Jan 21 10:39:51 UTC 2022 up 182 days, 5:08, 0 users, load averages: 1.44, 1.34, 1.36