mersenneforum.org  

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

Reply
 
Thread Tools
Old 2019-06-28, 08:10   #12
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

5·7·139 Posts
Default

With lots of RAM you could do some deep ECM on GIMPS and Fermat numbers as well.

Or use the mtsieve framework to help sieving (and testing) projects like FermatSearch and DoubleMersennes.

Or use a swarm of processors to ECM process numbers in the Brent tables using ECMNET.


Last fiddled with by ET_ on 2019-06-28 at 08:15 Reason: ECMNET
ET_ is offline   Reply With Quote
Old 2019-06-28, 14:14   #13
xilman
Bamboozled!
 
xilman's Avatar
 
"๐’‰บ๐’ŒŒ๐’‡ท๐’†ท๐’€ญ"
May 2003
Down not across

2×17×347 Posts
Default

Quote:
Originally Posted by ET_ View Post
Or use a swarm of processors to ECM process numbers in the Brent tables using ECMNET.

Or generalized Cullen & Woodall numbers or homogeneous Cunninghams for me and Jon Becker respectively.
xilman is online now   Reply With Quote
Old 2019-06-28, 14:33   #14
kriesel
 
kriesel's Avatar
 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

24·3·163 Posts
Default

Quote:
Originally Posted by Prime95 View Post
Well if every atom in the universe can hold one bit....
How many universes are there in the multiverse? I ran some numbers a while ago for a more ambitious thought experiment, storing 10 data bits per proton mass in the observable universe (including the estimated dark matter), in some combination of position, spin, and momentum. That data storage capacity allows for about 263 iterations, with some other assumptions mixed in. But the clock rate would become really slow, given that most of the mass is scattered over millions if not billions of light-years. And I for one would strenuously object to having my hydrogen content repurposed for data storage while I'm still using it for biochemistry.

https://www.mersenneforum.org/showpo...97&postcount=6

Last fiddled with by kriesel on 2019-06-28 at 14:34
kriesel is online now   Reply With Quote
Old 2019-06-28, 15:41   #15
chris2be8
 
chris2be8's Avatar
 
Sep 2009

5×17×29 Posts
Default

Quote:
Originally Posted by ET_ View Post
Or use a swarm of processors to ECM process numbers in the Brent tables using ECMNET.
If I read https://www.slideserve.com/brant/fro...-brent-factors correctly then all of the Brent tables have been factored to T60. So that's probably not worth doing, unless you plan to extend the brent tables (I've found a few easy ecm factors just above the 10^255 limit).

Chris
chris2be8 is online now   Reply With Quote
Old 2019-06-28, 19:33   #16
xilman
Bamboozled!
 
xilman's Avatar
 
"๐’‰บ๐’ŒŒ๐’‡ท๐’†ท๐’€ญ"
May 2003
Down not across

101110000101102 Posts
Default

Quote:
Originally Posted by Prime95 View Post
Well if every atom in the universe can hold one bit....
Some while back I observed that in principle a single hydrogen atom can store an arbitrarily large number of bits. Implementation is likely to be a real bugger (which is an English colloquialism meaning "non-trivial").

The secret is to store a number as the principle quantum number in a Rydberg atom.
xilman is online now   Reply With Quote
Old 2019-06-28, 19:54   #17
aurashift
 
Jan 2015

111111102 Posts
Default

Keep in mind this should also be storage and maybe networking intensive as well as CPU/RAM-wise, as that's a big aspect of this redesign I'm doing. The fact that ycruncher is writing 5-10 PB is wonderful for this, otherwise I'd have to simulate that kind of workload and get nothing out of it besides some figures that look nice in a powerpoint.
aurashift is offline   Reply With Quote
Old 2019-06-28, 20:24   #18
xilman
Bamboozled!
 
xilman's Avatar
 
"๐’‰บ๐’ŒŒ๐’‡ท๐’†ท๐’€ญ"
May 2003
Down not across

2·17·347 Posts
Default

Quote:
Originally Posted by aurashift View Post
Keep in mind this should also be storage and maybe networking intensive as well as CPU/RAM-wise, as that's a big aspect of this redesign I'm doing. The fact that ycruncher is writing 5-10 PB is wonderful for this, otherwise I'd have to simulate that kind of workload and get nothing out of it besides some figures that look nice in a powerpoint.
In that case, consider running the CADO-NFS siever. You can use as many petabytes as you wish to store the relations. As long as you run many relatively small factorizations there are people around here who can perform the subsequent matrix and square root phases. For the sort of numbers in which I am presently interested, each factorization takes up around 20-100GB which can be downloaded over my internet connection relatively easily. I'd have to think about 1TB data sets.
xilman is online now   Reply With Quote
Old 2019-06-28, 20:30   #19
aurashift
 
Jan 2015

25410 Posts
Default

Quote:
Originally Posted by xilman View Post
In that case, consider running the CADO-NFS siever. You can use as many petabytes as you wish to store the relations. As long as you run many relatively small factorizations there are people around here who can perform the subsequent matrix and square root phases. For the sort of numbers in which I am presently interested, each factorization takes up around 20-100GB which can be downloaded over my internet connection relatively easily. I'd have to think about 1TB data sets.

Depending on the quantity and capacity of drives we get, lets theoretically just say 500TB of raw space, 5PBs perfectly and evenly written would only represent two days worth of rated workload. Typically enterprise drives are rated for 5 drive writes per day.
aurashift is offline   Reply With Quote
Old 2019-06-28, 20:49   #20
xilman
Bamboozled!
 
xilman's Avatar
 
"๐’‰บ๐’ŒŒ๐’‡ท๐’†ท๐’€ญ"
May 2003
Down not across

2×17×347 Posts
Default

Quote:
Originally Posted by aurashift View Post
Depending on the quantity and capacity of drives we get, lets theoretically just say 500TB of raw space, 5PBs perfectly and evenly written would only represent two days worth of rated workload. Typically enterprise drives are rated for 5 drive writes per day.
Well, if you want to raise the rate artificially to an arbitrarily large extent, just copy the files back and forth as many times as you wish. The computed data is still useful in some sense.
xilman is online now   Reply With Quote
Old 2019-06-29, 04:49   #21
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

2·11·109 Posts
Default

Assuming you can pool all the available drives, you could record the world's largest primorial ever calculated.
https://www.mersenneforum.org/showpo...0&postcount=35
It will read and write the whole set of drives constantly during the operation.
But it won't be quite as useless as the world record pi calculation though.

Last fiddled with by a1call on 2019-06-29 at 04:52
a1call is offline   Reply With Quote
Old 2019-06-29, 08:39   #22
hansl
 
hansl's Avatar
 
Apr 2019

5·41 Posts
Default

Quote:
Originally Posted by a1call View Post
But it won't be quite as useless as the world record pi calculation though.
How so?
hansl is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Some ideas regarding NFS... paul0 Factoring 3 2015-03-14 19:55
Prime search in a cloud-based server (VM)... iParadase PrimeNet 8 2013-03-06 17:13
two ideas for NPLB TimSorbet No Prime Left Behind 16 2008-03-01 23:32
GROUP IDEAS TTn 15k Search 15 2003-09-23 16:28
Domain name ideas... Xyzzy Lounge 17 2003-03-24 16:20

All times are UTC. The time now is 16:34.


Fri Jul 7 16:34:57 UTC 2023 up 323 days, 14:03, 1 user, load averages: 2.32, 2.28, 2.00

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, 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.

โ‰  ยฑ โˆ“ รท ร— ยท โˆ’ โˆš โ€ฐ โŠ— โŠ• โŠ– โŠ˜ โŠ™ โ‰ค โ‰ฅ โ‰ฆ โ‰ง โ‰จ โ‰ฉ โ‰บ โ‰ป โ‰ผ โ‰ฝ โŠ โА โŠ‘ โŠ’ ยฒ ยณ ยฐ
โˆ  โˆŸ ยฐ โ‰… ~ โ€– โŸ‚ โซ›
โ‰ก โ‰œ โ‰ˆ โˆ โˆž โ‰ช โ‰ซ โŒŠโŒ‹ โŒˆโŒ‰ โˆ˜ โˆ โˆ โˆ‘ โˆง โˆจ โˆฉ โˆช โจ€ โŠ• โŠ— ๐–• ๐–– ๐–— โŠฒ โŠณ
โˆ… โˆ– โˆ โ†ฆ โ†ฃ โˆฉ โˆช โІ โŠ‚ โŠ„ โŠŠ โЇ โŠƒ โŠ… โŠ‹ โŠ– โˆˆ โˆ‰ โˆ‹ โˆŒ โ„• โ„ค โ„š โ„ โ„‚ โ„ต โ„ถ โ„ท โ„ธ ๐“Ÿ
ยฌ โˆจ โˆง โŠ• โ†’ โ† โ‡’ โ‡ โ‡” โˆ€ โˆƒ โˆ„ โˆด โˆต โŠค โŠฅ โŠข โŠจ โซค โŠฃ โ€ฆ โ‹ฏ โ‹ฎ โ‹ฐ โ‹ฑ
โˆซ โˆฌ โˆญ โˆฎ โˆฏ โˆฐ โˆ‡ โˆ† ฮด โˆ‚ โ„ฑ โ„’ โ„“
๐›ข๐›ผ ๐›ฃ๐›ฝ ๐›ค๐›พ ๐›ฅ๐›ฟ ๐›ฆ๐œ€๐œ– ๐›ง๐œ ๐›จ๐œ‚ ๐›ฉ๐œƒ๐œ— ๐›ช๐œ„ ๐›ซ๐œ… ๐›ฌ๐œ† ๐›ญ๐œ‡ ๐›ฎ๐œˆ ๐›ฏ๐œ‰ ๐›ฐ๐œŠ ๐›ฑ๐œ‹ ๐›ฒ๐œŒ ๐›ด๐œŽ๐œ ๐›ต๐œ ๐›ถ๐œ ๐›ท๐œ™๐œ‘ ๐›ธ๐œ’ ๐›น๐œ“ ๐›บ๐œ”