mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Factoring

Reply
 
Thread Tools
Old 2006-03-13, 10:48   #1
koders333
 

F8E16 Posts
Default Anyone knows about primegrid

I see the site http://primegrid.com/ . In this site they run project like NFSNET for factoring a RSA challenge number.But they are not mentinoning algorithm they are used.I hope they are using GGNFS implementations.
Anyone knows about it?
  Reply With Quote
Old 2006-03-13, 14:47   #2
R.D. Silverman
 
R.D. Silverman's Avatar
 
"Bob Silverman"
Nov 2003
North of Boston

22·1,889 Posts
Default

Quote:
Originally Posted by koders333
I see the site http://primegrid.com/ . In this site they run project like NFSNET for factoring a RSA challenge number.But they are not mentinoning algorithm they are used.I hope they are using GGNFS implementations.
Anyone knows about it?
They are using..... (drum roll please!)

TRIAL DIVISION.
R.D. Silverman is offline   Reply With Quote
Old 2006-03-13, 17:55   #3
ColdFury
 
ColdFury's Avatar
 
Aug 2002

26×5 Posts
Default

The Neo Project part 2.

I'll check back on their progress in a couple billion years.
ColdFury is offline   Reply With Quote
Old 2006-03-13, 18:34   #4
garo
 
garo's Avatar
 
Aug 2002
Termonfeckin, IE

24×173 Posts
Default

Not just <drum roll> trial division </drum roll> but
<cymbals>
trial division by all odd numbers
</cymbals>
garo is offline   Reply With Quote
Old 2006-03-13, 18:54   #5
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

5×23×31 Posts
Default

Quote:
Originally Posted by ColdFury
The Neo Project part 2.

I'll check back on their progress in a couple billion years.
I've been wondering what this project could do better. It basically is run by one guy, who has zero time and whose primary interest is building a BOINC scheduler in perl. Going after RSA numbers is just a hook to lure people.

So, the obvious question: if you need a bunch of volunteers to test your code, and you have zero time to come up with something, and the something has to be interesting, what should you do?

jasonp

PS: NFS happens not to be an option with PrimeGrid, because of the data storage needs. ECM is not an option either, because the ECM that people care about requires even more memory in the client than an NFS siever.
jasonp is offline   Reply With Quote
Old 2006-03-13, 20:53   #6
Jeff Gilchrist
 
Jeff Gilchrist's Avatar
 
Jun 2003
Ottawa, Canada

3×17×23 Posts
Default

Quote:
Originally Posted by garo
trial division by all odd numbers
Hey, that increases their search speed by cutting out half of the numbers to try right????
Jeff Gilchrist is offline   Reply With Quote
Old 2006-03-13, 21:04   #7
ewmayer
2ω=0
 
ewmayer's Avatar
 
Sep 2002
República de California

22×2,939 Posts
Default

Quote:
Originally Posted by jasonp
I've been wondering what this project could do better. It basically is run by one guy, who has zero time and whose primary interest is building a BOINC scheduler in perl. Going after RSA numbers is just a hook to lure people.

So, the obvious question: if you need a bunch of volunteers to test your code, and you have zero time to come up with something, and the something has to be interesting, what should you do?
How about trial division of Fermat or iterated Mersenne numbers with exponents > 30 bits or so? That way, even if their trial-division code sucks they at least have >= (a snowball's chance in hell) of finding a previously unknown factor. Tony Forbes' MFAC code isn't all that fast (though probably an order of magnitude faster than the app in question here), but still managed to find the first known factor of F31. With RSA challenge numbers they have what is for all intents and purposes zero chance of success. Why doom oneself from the start? The only plausible answer I can come up with is ... because one is an idiot.
ewmayer is offline   Reply With Quote
Old 2006-03-13, 21:18   #8
ColdFury
 
ColdFury's Avatar
 
Aug 2002

26·5 Posts
Default

Quote:
Originally Posted by jasonp
I've been wondering what this project could do better. It basically is run by one guy, who has zero time and whose primary interest is building a BOINC scheduler in perl. Going after RSA numbers is just a hook to lure people.

So, the obvious question: if you need a bunch of volunteers to test your code, and you have zero time to come up with something, and the something has to be interesting, what should you do?

jasonp

PS: NFS happens not to be an option with PrimeGrid, because of the data storage needs. ECM is not an option either, because the ECM that people care about requires even more memory in the client than an NFS siever.
I've heard the Dutch Power Cows are working at starting another ECCP project and are looking for developers. Perhaps he could offer his services to them?
ColdFury is offline   Reply With Quote
Old 2006-03-14, 03:23   #9
wblipp
 
wblipp's Avatar
 
"William"
May 2003
Near Grandkid

237510 Posts
Default

Quote:
Originally Posted by jasonp
ECM is not an option either, because the ECM that people care about requires even more memory in the client than an NFS siever.
He could easily generate a huge amount of small ECM work by deciding to work on Brent's factor list for bases larger than 1000. But then he would generate lots of factors, and have to spend time managing the results, another distraction for a manager already short on time. His present project will never overload him with results.
wblipp is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Primegrid > GIMPS? MooMoo2 Lounge 11 2020-08-02 20:55
The Primegrid monopoly The Carnivore Riesel Prime Search 9 2011-04-24 20:55
ROLP at PrimeGrid mdettweiler Raiders of the Lost Primes 2 2010-09-17 05:57
PrimeGrid site down :( mazadillon Prime Sierpinski Project 2 2008-12-24 00:19
PrimeGrid dump Sloth Prime Sierpinski Project 4 2008-08-02 12:38

All times are UTC. The time now is 06:28.


Mon Jun 5 06:28:14 UTC 2023 up 291 days, 3:56, 0 users, load averages: 1.31, 0.97, 0.94

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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔