mersenneforum.org  

Go Back   mersenneforum.org > New To GIMPS? Start Here! > Information & Answers

Reply
 
Thread Tools
Old 2017-07-26, 23:55   #23
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

3·23·83 Posts
Default

Quote:
Originally Posted by chalsall View Post
Let us run a thought experiment...

Imagine that someone can factor really quickly... Perhaps by using Quantum Uncertainty...

And imagine that a few thousand dollars or so was small change.

Would they advertise that ability?
Hell yes. Many governments/organisations would be happy to pay for factoring services around the 1024/2048/4096 bit levels.
retina is offline   Reply With Quote
Old 2017-07-27, 20:28   #24
J F
 
J F's Avatar
 
Sep 2013

23×7 Posts
Default

Quote:
Originally Posted by retina View Post
Hell yes. Many governments/organisations would be happy to pay for factoring services around the 1024/2048/4096 bit levels.
Would that bring in more than the other side is paying, if I
promise NOT to factor? And what part of that income would I
need to counter the drastically lowered life expectancy?
J F is offline   Reply With Quote
Old 2017-07-28, 02:05   #25
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

3·23·83 Posts
Default

Quote:
Originally Posted by J F View Post
Would that bring in more than the other side is paying, if I
promise NOT to factor? And what part of that income would I
need to counter the drastically lowered life expectancy?
Yes, the Mafia style approach is also possible, but fragile for the people being extorted. I guess the normal market forces would come into play as always. And one could choose to do it for "legit" purposes only, or just do it for anyone willing to pay.

Anyhow, it is all academic since no one can currently do such factoring jobs in any reasonable time frame for any reasonable cost.
retina is offline   Reply With Quote
Old 2020-06-16, 02:47   #26
kriesel
 
kriesel's Avatar
 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

7·631 Posts
Default

Quote:
Originally Posted by ewmayer View Post
@KenK: Your ~15 years is about the same time estimate I get for my code running on a cutting-edge manycore Xeon server or Knights Landing workstation. (And I actually timed out some 10Kiter partial runs on the smallest several 1-Gdigit-M-number exponents at the smallest FFT length needed for such, 192M.)
A bit of an update: We're getting closer. I did a short timing run on Windows 7 in Gpuowl v6.5-84 PRP3, still not recommended at an estimated 6.3 years on a Radeon VII, and as you know, the rocm driver on linux reportedly can do better.There's been a lot of performance tuning of gpuowl's remaining fft lengths since. Maybe someday sufficiently long ffts for gigadigit PRP will return. Lessons learned from hammering on the current fft lengths could be applied to the longer lengths and bring some speedup there. Just extrapolating from V6.5-84 to v6.11-292 9M fft iteration times, reduces the estimated run time by a factor of 1.352, to 4.66 years (still Windows). Switching to linux and a Radeon Pro VII, and who knows, 3 years?

Last fiddled with by kriesel on 2020-06-16 at 02:48
kriesel is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
New Mersenne primality test Prime95 Miscellaneous Math 19 2014-08-23 04:18
A (new) old, (faster) slower mersenne-(primality) PRP test boldi Miscellaneous Math 74 2014-04-17 07:16
The fastest primality test for Fermat numbers. Arkadiusz Math 6 2011-04-05 19:39
LLT Cycles for Mersenne primality test: a draft T.Rex Math 1 2010-01-03 11:34
Mersenne Primality Test in Hardware Unregistered Information & Answers 4 2007-07-09 00:32

All times are UTC. The time now is 01:25.

Tue Sep 22 01:25:08 UTC 2020 up 11 days, 22:36, 0 users, load averages: 1.52, 1.60, 1.64

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