![]() |
[QUOTE=R.D. Silverman;357071]I suspect that the data needed to answer this question does not exist.
It is highly dependent on the GPU hardware (which may force constraints on the lattice sieving). It is also implementation and compiler dependent. Has anyone actually done a full port of GGNFS to a GPU??[/QUOTE]Not that I know of. It would be a major undertaking. |
[QUOTE=xilman;357073]Not that I know of. It would be a major undertaking.[/QUOTE]
NSS :smile: |
[QUOTE=R.D. Silverman;355525]This appears to be an extremely plausible suggestion!
Would anyone like to put together a betting pool as to when they will obtain their next factorization? Brownie points to the winner.[/QUOTE] Has anyone heard how they are progressing? It seems now that they do not have a new method or we would have heard from them. They reserved 16 very difficult factorizations about 2 months ago. My prediction of 4+ years may not be so wrong..... |
[QUOTE=R.D. Silverman;357284]My prediction of 4+ years may not be so wrong.....[/QUOTE]
If your prediction comes true, then we expect the first number around Christmas. And if it is true 16 numbers reservation seems a bit greedy. I bet that half of the numbers should be done before the New Years Eve if there is an advance in the hardware+distribution of the task. Otherwise it does not make sense for them to be allowed to have such a reservation. |
[QUOTE=R.D. Silverman;357284]Has anyone heard how they are progressing? It seems now that they
do not have a new method or we would have heard from them. They reserved 16 very difficult factorizations about 2 months ago. My prediction of 4+ years may not be so wrong.....[/QUOTE] I happened to come across the after-action report on factoring RSA768; in Cluster Computing, "heterogeneous computing environment to solve the 768-bit RSA Challenge" (Leyland, et. al., Springer, Dec, 2010). The concluding section says that it's just a matter of getting better access to current (2010) HPC resources. For example, a couple of weeks on the full "Ranger" XSEDE computer at UT Austin for gnfs768, c. gnfs233. -Bruce |
[QUOTE=bdodson;358563]I happened to come across the after-action report on factoring
RSA768; in Cluster Computing, "heterogeneous computing environment to solve the 768-bit RSA Challenge" (Leyland, et. al., Springer, Dec, 2010). The concluding section says that it's just a matter of getting better access to current (2010) HPC resources. For example, a couple of weeks on the full "Ranger" XSEDE computer at UT Austin for gnfs768, c. gnfs233. -Bruce[/QUOTE] I applaud their efforts (and yours). I imagine, however, that a 'a couple of weeks on the full "Ranger" XSEDE computer at UT Austin ' would be expensive and hard to come by. Such resources are in demand for real world problems. Factoring Cunningham numbers isn't all that important. I was [b]really[/b] hoping that they had found an algorithmic improvement..... |
[QUOTE=R.D. Silverman;358564]I applaud their efforts (and yours). I imagine, however, that a 'a couple of weeks on the full "Ranger" XSEDE computer at UT Austin '
would be expensive and hard to come by. Such resources are in demand for real world problems. Factoring Cunningham numbers isn't all that important. I was [b]really[/b] hoping that they had found an algorithmic improvement.....[/QUOTE]What's the phrase you use? Something like "Assuming facts not in evidence"? You may be right in this instance but it is far from clear to me. Just because we used a sentence a few years ago doesn't mean that your present hopes are necessarily dashed. That said, I'm not privy to the reasoning behind EPFL's reservation strategy and you may well be completely correct. Even if I was privy and not just pretending to be, I may not be able to reveal much more. Feeling paranoid yet? :wink: |
[QUOTE=bdodson;358563]I happened to come across the after-action report on factoring
RSA768; in Cluster Computing, "heterogeneous computing environment to solve the 768-bit RSA Challenge" (Leyland, et. al., Springer, Dec, 2010). The concluding section says that it's just a matter of getting better access to current (2010) HPC resources. For example, a couple of weeks on the full "Ranger" XSEDE computer at UT Austin for gnfs768, c. gnfs233. -Bruce[/QUOTE]Ok, so ResearchGate has its uses ... |
[QUOTE=xilman;358565]What's the phrase you use? Something like "Assuming facts not in evidence"?
[/QUOTE] What facts did I assume? That supercomputers are in demand? |
[QUOTE=xilman;358565]
That said, I'm not privy to the reasoning behind EPFL's reservation strategy and you may well be completely correct. Even if I was privy and not just pretending to be, I may not be able to reveal much more. Feeling paranoid yet? :wink:[/QUOTE] Paranoid? No. But I've never known you to be furtive. |
[QUOTE=R.D. Silverman;358567]What facts did I assume? That supercomputers are in demand?[/QUOTE]That EPFL are usign supercomputers rather than new algorithms
|
| All times are UTC. The time now is 21:49. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.