thanks for your help. I am quite far with the factorization. Sieving
is now running on several Core 2 Quad machines, with several tens
milions relations reached at the moment (waiting to get more). I am
just curious about results of filtering (small amount of ideals
reached for the moment from my qty) and than algebra.
I would like to ask you if you ever tried to run this on PS3 machine.
There is quite powerful processor (3 core Power PC) with linux. I
just don't know if it is possible to port it and at the end, if it
would help in speed of sieving. PS3 is quite powerful for floating
point operations, i don't know if it is also good in integer ones,
but it could be. Accidentially, don't you have some sources of gnfs
Very best regards,
--- In firstname.lastname@example.org, Jason Papadopoulos <jasonp@...> wrote:
> Quoting Antonio Sanches <tzro47@...>:
> > I would like to ask if there is any possibility to help with
> > factorization of 512 bits number. I am trying to find somebody
> > could help me with this, by advise, software, etc.
> While it's feasible for a single person to manage a job like this,
> it still is going to be a lot of work. If you have about a dozen
> fast machines you should be able to finish in about a month.
> You will need GGNFS binaries from the GGNFS sourceforge page,
> and you should also use the latest version of msieve once you
> have finished the sieving. The files section of this newsgroup
> contains a script that will run most everything. The sourceforge
> binaries are very old by now, it would be better to build the
> latest source.
> See the newsgroup archives for more advice on getting started,
> and consider visiting the Factoring forum at www.mersenneforum.org
> This message was sent using BOO.net's Webmail.