die erste Adresse für Distributed Computing
Unterstützen Sie uns mit
Unterstütze Rechenkraft.net e.V. |
Mit Suchkraft hier suchen:
yoyo wrote:To find a factor thousands of workunits have to be computed. This is done in parallel by hundreds of user. So if an easy factor is found it is possible, that the factor is found by many user in parallel. As fast as the server gets a found factor it cancels all not yet sent out workunits and if a client is connected it tells him to abort all not yet started workunits.
yoyo wrote:Workunits are NOT splited based on different ranges!
ECM, the eliptic curve method, is a trial factoring method. For a batch we have to run different trials, all starting with a different random seed.
So all computations are different, they are different trials. For "easy" factors it is therefore possible that with different random seeds the same factor is found.
Users browsing this forum: No registered users and 9 guests