mersenneforum.org > Data Thinking out loud about getting under 20M unfactored exponents
 Register FAQ Search Today's Posts Mark Forums Read

 2017-07-26, 04:45 #1 petrw1 1976 Toyota Corona years forever!     "Wayne" Nov 2006 Saskatchewan, Canada 19·263 Posts Thinking out loud about getting under 20M unfactored exponents http://www.mersenne.ca/status/tf/0/0/1/0 Breaking it down I'm thinking if each 100M range has less than 2M unfactored we have the desired end result. Similarly if each 10M range has less than 200K unfactored... or each 1M range has less than 20K unfactored... or each 100K range has less than 2,000 unfactored. So I did some Excel ciphering looking at: - how many more factors are required in each range - how many exponents need to be TF'd at the current bit level to get there (could require several bit levels to complete) - how many GhzDays each assignment would take. - I stopped at the 59M range thinking current GPU TF bit levels will factor adequately (most of the time) to get below my limits of interest here. I did this for the 10M, 1M and 100K ranges. Then I added it all up and came up with very roughly 250M GhzDays of TF with some ranges requiring up to 10 more bit levels of TF. WOW. In perspective, my 1,000 per day GPUs would take 250K days: 685 years. Oh dear; that's way more than I had expected. Note: I only considered TF. I understand that in some (many?) cases ECM (on lower exponents) and P-1 could find factors much quicker. In either case it looks like this will be a very far off milestone. Code: === Process where current B1=B2 first; then lowest current B1&B2. === Even when B2>B1 the current bounds are mostly quite low and factors are plentiful. Range ToGo B1=B2 TFBits Owns 6.0 25 0 72 takahashi 7.1 65 0 72 LaurV 7.3 65 0 72 Kruoli 7.7 60 0 72 Kruoli 7.8 52 0 72 Kruoli 8.1 55 0 72 Flaukrotist 8.2 67 0 72 axn 8.7 73 0 72 linament 9.5 39 0 72 Tha 9.9 96 0 72 Tha 10.4 111 0 72 Luminescence 10.5 26 0 72 ZhangRc 11.7 59 0 72 Chris 12.1 24 0 72 Lycorn 13.1 51 0 72 petrw1 - Late April 13.2 16 0 72 ZhangRc 13.3 55 0 72 petrw1 - May ... I might release this one before I get to it 14.1 52 0 72 petrw1 - May ... I might release this one before I get to it 14.4 25 0 73 petrw1 - February & March 14.5 20 0 72 Chris 14.6 28 0 73 firejuggler 14.7 67 0 72 petrw1 - February - April 15.5 140 0 72 Denial40 P-1 ... would like some TF help 17.0 122 0 73 Chris 17.4 34 0 73 Anonymous TF 17.7 53 0 72 Masser 17.9 61 0 74 Masser 18.0 52 0 73 petrw1 - February 18.2 74 0 73 petrw1 - Early March 18.4 55 0 73 petrw1 - Mid March 18.8 59 0 73 petrw1 - Early April 19.1 22 0 73 petrw1 - March & April 19.4 62 0 73 petrw1 - April 19.5 73 0 72 axn P-1 19.9 46 0 73 petrw1 - January - Mach 20.6 13 484 74 petrw1 - January 20.8 34 504 74.4 petrw1 TF75 (needs help). my P-1 done, waiting on TF75 21.7 25 819 74 Chris 21.8 28 679 74.9 Yves TF75 and petrw1 P-1 - January & February 22.3 55 0 75 petrw1 - Late January 25.3 48 766 75 Anton Repko Last fiddled with by petrw1 on 2022-01-25 at 20:06 Reason: Keeping the "Help Wanted" updates here on post 1
 2017-07-26, 07:48 #2 0PolarBearsHere     Oct 2015 2·7·19 Posts It just means we need more GPUs. For instance if we can get 1000 high end GPUs on it, we could get it done in under a year based on your maths. We just need to find an organisation with a spare 800K USD who had a sudden urge to generously donate GPUs to anyone that requests one. Last fiddled with by 0PolarBearsHere on 2017-07-26 at 07:49
 2017-07-26, 10:43 #3 VictordeHolland     "Victor de Hollander" Aug 2011 the Netherlands 23·3·72 Posts And what would this accomplisch?
2017-07-26, 16:03   #4
petrw1
1976 Toyota Corona years forever!

"Wayne"
Nov 2006

19×263 Posts

Quote:
 Originally Posted by VictordeHolland And what would this accomplisch?
Absolutely nothing of consequence.
Nothing more than another milestone of interest to some.

 2017-07-26, 19:48 #5 S485122     "Jacob" Sep 2006 Brussels, Belgium 177710 Posts If your best tool is a factoring machine you view everything as as entities to be factored. :-) Jacob
2017-07-26, 20:03   #6
chalsall
If I May

"Chris Halsall"
Sep 2002

100111110100112 Posts

Quote:
 Originally Posted by S485122 If your best tool is a factoring machine you view everything as as entities to be factored. :-)
Just to reflect Jacob... Sometimes it is worth the effort to think about what other people are thinking about...

In addition to the Philips, are you familiar with the Roberson? The hex?

I have actually watched people slam screws into wood using a hammer, because the Philips screws' heads were stripped with a screw driver which was too small.

I actually learned some new words (containing many symbols, including (!*%\$@***!!!)) from men who should have understood the simplicity of the situation.

For what that is worth....

Last fiddled with by chalsall on 2017-07-26 at 20:07

2017-07-26, 20:35   #7
CRGreathouse

Aug 2006

3·1,993 Posts

Quote:
 Originally Posted by VictordeHolland And what would this accomplisch?
I'm not sure what the OP has in mind, but I know that full factorizations of small Mersenne numbers are very useful. For example, they greatly speed up the non-sqrt-smooth part (which dominates computationally) of Feitsma's algorithm for listing 2-pseudoprimes. I've heard interest in extending his work beyond 2^64 so this isn't just academic.

As for finding individual factors, I don't know... I guess it just gives simpler/shorter certificates of compositeness.

2017-07-26, 23:01   #8
Gordon

Nov 2008

50110 Posts

Quote:
 Originally Posted by VictordeHolland And what would this accomplisch?
because they are there and because we can :-)

2017-07-26, 23:25   #9
science_man_88

"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts

Quote:
 Originally Posted by VictordeHolland And what would this accomplisch?
if done high enough, in theory, it could deplete the candidate factors for larger mersenne numbers a bit.

2017-07-26, 23:52   #10
chalsall
If I May

"Chris Halsall"
Sep 2002

5·2,039 Posts

Quote:
 Originally Posted by science_man_88 if done high enough, in theory, it could deplete the candidate factors for larger mersenne numbers a bit.
Yeah... In theory....

 2017-07-27, 04:40 #11 storm5510 Random Account     Aug 2009 111110110012 Posts I believe just about everyone here recognizes the image I have attached. This ends at 280. I suppose some here could comfortably TF to this level in a reasonable period of time. Of course, I do not know what most would consider "reasonable." The last I heard, a computer "generation" was in the area of 18 months. It is probably less now. It would take many generations of tech growth to get to the level the OP was writing about. Point: Let us do now what needs to be done now, and not think about the future. Attached Thumbnails

 Similar Threads Thread Thread Starter Forum Replies Last Post jschwar313 GPU to 72 3 2016-01-31 00:50 Batalov Factoring 6 2011-12-27 22:40 jasong jasong 1 2008-11-11 09:43 devarajkandadai Math 4 2007-07-25 03:01 WraithX GMP-ECM 1 2006-03-19 22:16

All times are UTC. The time now is 21:05.

Tue Jan 25 21:05:30 UTC 2022 up 186 days, 15:34, 0 users, load averages: 1.19, 1.30, 1.39