Kudos to Jason for the new version. I have had a number of snfs factorings, which have bombed out immediately with the previous version. Now I started a...
... For practical purposes, infinity. See http://mersenneforum.org/showthread.php?t=12125 for a discussion of factoring a 1536 bit general number. And 2048...
Hello, I've tested the matrix solving step with 1 vs 2 threads on a single core CPU with hyperthreading. It runs *faster* with 1 thread than with 2. Lattice...
Hi dear group ,after downlouding ggnfs 340 and extracting and downlouding  CYGWIN and install , on double clicking CYGWIN I get a flash window only and on...
... The ggnfs binaries are command line tools so you can double click on them, you need to run them from either a cygwin shell or from a command prompt...
... Great find, this has been updated in the SVN code so it will not longer produce that output. ... That is a very good question. I'm not sure if anyone here...
Hello, Everyone ... What was the sort of garbage seen? ... wrong. We have: printf("%d %lu %u ",x,qx,ulqx); x here is of type i16_t qx - u64_t ulqx - u32_t The...
... That wouldn't work for the Windows build because the Microsoft compiler doesn't support most of the C99 stuff and has no stdint.h header file. We could...
... Hello Anton I haven't tried the one you reference above but I have had trouble with earlier attempts to add inttypes.h to Visual Studio. In fact this might...
Dear Chris, Did you have time to make it work? We will gladly help to hammer on it and try to find and (possibly try to help to) fix some bugs. Block Wiedemann...
dear all I would be thankful if someone provide me the estimated time to run GGNFS on different integers. You can fix any machine, for example core2 due 2.ghz....
... You can get good estimates from these graphs here: http://homepage2.nifty.com/m_kamada/math/graphs.htm There are total time graphs for both GNFS and SFNS,...
Hi all, As inferred from the subject I am interested in factoring an ~150 digit composite (p*q where p and q are prime; p != q). It is my understanding that by...
Freddie Witherden
freddie@...
Nov 18, 2009 5:13 pm
2474
150 digits should not be too difficult on the resources you describe. A quad-core system should be able to handle the workload in 10-12 days. Even the...
... Yes, I think I remember seeing that when I ran msieve --help (the [X,Y] range). However, how should one go about determining the overall range (is it 0..Y...
Freddie Witherden
freddie@...
Nov 18, 2009 7:33 pm
2476
On Wed, Nov 18, 2009 at 2:28 PM, Freddie Witherden ... Freddie, You can always use the 'kill -STOP <pid>' and 'kill -CONT <pid>' commands at a unix shell...
Hi, ... Yes, that seems to be just what I need! I've been playing around with some smaller numbers first -- just to get my bearings. It seems simple to divide...
Freddie Witherden
freddie@...
Nov 20, 2009 10:47 pm
2478
I have a load of polynomials (produced by msieve and then concatenated) along with 'n', but can not work out the correct calling convention for the program. ...
... Okay. So my current plan is to run a load of msieve instances (one-per-core- per-system). However, msieve auto-selects a range between [0,n] for me for a ...
Freddie Witherden
freddie@...
Nov 21, 2009 6:09 pm
2481
... Msieve's poly selector does not randomize anything when given a range of coefficients to search, so you will crunch the same numbers multiple times. For...
Jason Papadopoulos
jasonp@...
Nov 21, 2009 6:29 pm
2482
... I have 12 AMD Opteron cores averaging 2.3 GHz, and I run 64-bit Linux so as to use the faster 64-bit lattice sievers and GMP-ECM. The C158 was not bad: ...
Hello, ... In order to help resolve your problem we are going to require some more information. Firstly, what file is giving you compiler errors and what form...
Freddie Witherden
freddie@...
Nov 21, 2009 7:17 pm
2484
... Does GMP-ECM help with polynomial selection? I thought it was just used to knock-out small factors? Finally, when selecting the range to sieve did you just...
Freddie Witherden
freddie@...
Nov 21, 2009 7:46 pm
2485
... Great! Hello, this is the Juno stating that I am currently factoring a 150-digit composite number for the form 10^420 + 1 and I understood the point of...