mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Data

Reply
 
Thread Tools
Old 2017-07-26, 04:45   #1
petrw1
1976 Toyota Corona years forever!
 
petrw1's Avatar
 
"Wayne"
Nov 2006
Saskatchewan, Canada

477010 Posts
Default 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.
=== Judger is still systematically TF'ing to 75 bits where 20+ to go.   
=== I'd suggest not doing P1 on any ranges lower than TF75 beyond the first section below.

Range	ToGo	B1=B2	TFBits	Owns

=== Any in this group will clear with relatively low P1 bounds.
=== Something like 1M/30M should be more than enough.
24.9	2	757	75	Chris
24.2	6	616	75	
28.1	7	679	74	Kruoli
25.7	9	739	75	Chris
23.4	10	12	75	Chris
25.9	11	799	75	
24.1	14	643	75    Luminescence	
29.0	14	718	75	
24.4	15	577	75	
27.8	15	818	75	
26.2	23	792	75	
26.9	25	793	75	
28.0	28	538	75	
26.8	31	848	75	

=== Starting about here consider about 1.5M/45M though 1M/30M might do it.
24.7	39	700	75	
26.4	43	812	75	

=== There are getting a little more dicey.
=== I'd be tempted to wait for Judger to TF75
=== But if you are ambitious consider 2M/60M as minimal bounds; even more near the end of this list.
27.2	61	835	75	
26.5	62	800	75	
27.0	72	848	75	
25.3	77	766	75	
29.8	91	796	75

Last fiddled with by petrw1 on 2021-10-23 at 16:32 Reason: Keeping the "Help Wanted" updates here on post 1
petrw1 is online now   Reply With Quote
Old 2017-07-26, 07:48   #2
0PolarBearsHere
 
0PolarBearsHere's Avatar
 
Oct 2015

2×7×19 Posts
Default

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
0PolarBearsHere is offline   Reply With Quote
Old 2017-07-26, 10:43   #3
VictordeHolland
 
VictordeHolland's Avatar
 
"Victor de Hollander"
Aug 2011
the Netherlands

49816 Posts
Default

And what would this accomplisch?
VictordeHolland is offline   Reply With Quote
Old 2017-07-26, 16:03   #4
petrw1
1976 Toyota Corona years forever!
 
petrw1's Avatar
 
"Wayne"
Nov 2006
Saskatchewan, Canada

2·32·5·53 Posts
Default

Quote:
Originally Posted by VictordeHolland View Post
And what would this accomplisch?
Absolutely nothing of consequence.
Nothing more than another milestone of interest to some.
petrw1 is online now   Reply With Quote
Old 2017-07-26, 19:48   #5
S485122
 
S485122's Avatar
 
"Jacob"
Sep 2006
Brussels, Belgium

5×349 Posts
Default

If your best tool is a factoring machine you view everything as as entities to be factored. :-)

Jacob
S485122 is offline   Reply With Quote
Old 2017-07-26, 20:03   #6
chalsall
If I May
 
chalsall's Avatar
 
"Chris Halsall"
Sep 2002
Barbados

7·1,423 Posts
Default

Quote:
Originally Posted by S485122 View Post
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
chalsall is online now   Reply With Quote
Old 2017-07-26, 20:35   #7
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

3·1,993 Posts
Default

Quote:
Originally Posted by VictordeHolland View Post
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.
CRGreathouse is offline   Reply With Quote
Old 2017-07-26, 23:01   #8
Gordon
 
Gordon's Avatar
 
Nov 2008

3·167 Posts
Default

Quote:
Originally Posted by VictordeHolland View Post
And what would this accomplisch?
because they are there and because we can :-)
Gordon is offline   Reply With Quote
Old 2017-07-26, 23:25   #9
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

203008 Posts
Default

Quote:
Originally Posted by VictordeHolland View Post
And what would this accomplisch?
if done high enough, in theory, it could deplete the candidate factors for larger mersenne numbers a bit.
science_man_88 is offline   Reply With Quote
Old 2017-07-26, 23:52   #10
chalsall
If I May
 
chalsall's Avatar
 
"Chris Halsall"
Sep 2002
Barbados

233518 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
if done high enough, in theory, it could deplete the candidate factors for larger mersenne numbers a bit.
Yeah... In theory....
chalsall is online now   Reply With Quote
Old 2017-07-27, 04:40   #11
storm5510
Random Account
 
storm5510's Avatar
 
Aug 2009

3×661 Posts
Default

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
Click image for larger version

Name:	gimps_factor_table.JPG
Views:	536
Size:	54.6 KB
ID:	16538  
storm5510 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Thinking of Joining GPU to 72 jschwar313 GPU to 72 3 2016-01-31 00:50
Thinking about lasieve5 Batalov Factoring 6 2011-12-27 22:40
Thinking about buying a panda jasong jasong 1 2008-11-11 09:43
Loud thinking on irregular primes devarajkandadai Math 4 2007-07-25 03:01
Question on unfactored numbers... WraithX GMP-ECM 1 2006-03-19 22:16

All times are UTC. The time now is 18:55.


Sun Oct 24 18:55:28 UTC 2021 up 93 days, 13:24, 0 users, load averages: 1.07, 1.09, 1.16

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.