Recent changes to bugshttps://sourceforge.net/p/ggnfs/bugs/Recent changes to bugsenMon, 22 Oct 2007 03:57:59 -0000Memory pointers in code is wrong ?!?!?https://sourceforge.net/p/ggnfs/bugs/15/<div class="markdown_content"><p>Hi, I had several problems with matbuild/matprune/matsolve and I think I have figured the problem.<br />
</p>
<p>I'm using a 64 bits computer and every time I tried to allocate more than 2gb of ram from ggnfs suite, it failed.<br />
</p>
<p>I coded a little proggy and have been able to allocate 16+gb of ram (pagefile was at 16gb and 2gb of real ram).<br />
</p>
<p>Anyway, I checked the code and it seem that every malloc call are converted to s32 type ... exemple : (s32 *)lxmalloc(M->numCols*sizeof(s32),1);</p>
<p>The actual lxmalloc, lxcmalloc and lxrealloc code use type size_t type that is, for 32 bits computer, an unsigned int (32 bits) and for x64 cpu, a unsigned __int64 (64 bits).</p>
<p>My guess is that if you try to allocate for exemple, 2.5gb of ram, then ask for another 1gb, return value will be for exemple 0x00012345 for the first call (pointer to 2.5gb of ram) and 0x91234567 for the 2nd one (1gb pointer).</p>
<p>The (s32 *) there will convert that # to signed which will give a negative value, and fail. Is it ok to think that every pointer used in malloc calls should be converted to size_t type since it's the actual value that malloc return?</p>
<p>Is it correct to assume that limitations will be 2gb of usable ram for s32 type, 4gb for u32 and either 4gb for size_t type in 32 bits mode and something like 16tb for size_t type in 64 bits mode?</p>
<p>Any way to fix it fast?</p>
<p>Thanks</p>
<p>Alkirah</p></div>AlkirahMon, 22 Oct 2007 03:57:59 -0000https://sourceforge.net8d0098422fb0a2c046602a594f0615260beac12ffactLat.pl plots are png with .jpg extensionhttps://sourceforge.net/p/ggnfs/bugs/14/<div class="markdown_content"><p>factLat.pl plots to files named relations.jpg and <br />
xprimes.jpg, autogplot.sh sets gnuplot output format to <br />
png, results are png files with a .jpg extension.</p>
<p>suggested fix:<br />
change .jpg to .png in factLat.pl lines 854 and 860</p></div>AnonymousTue, 23 May 2006 14:31:57 -0000https://sourceforge.net6a3203eb9d924fdc02cf2aac4b5f2b36467c868dpentium2 build can use optimised lattice siever codehttps://sourceforge.net/p/ggnfs/bugs/13/<div class="markdown_content"><p>The pentium2 build currently uses the generic code <br />
for the lattice siever. This patch allows it to make <br />
use of the lasieve4/piii siever configuration. It <br />
depends on the compiler defining __SSE__ <br />
appropriately, GCC does, but I don't know if this is <br />
a standard symbol for other compilers.</p>
<p>I regularly use P2 machines with the lattice siever <br />
and pol51 tools built like this. Although I wouldn't <br />
normally do linear algebra on a P2, I have tested it <br />
with tests/snfs_small and it worked fine.</p></div>Geoffrey ReynoldsMon, 13 Mar 2006 02:51:43 -0000https://sourceforge.net67dc7e892d81fd5359620fd06bcd987fd2a4660fUnused array tmp3_n in blockLanczos64()https://sourceforge.net/p/ggnfs/bugs/12/<div class="markdown_content"><p>Memory is allocated for the tmp3_n array in <br />
blocklanczos64(), but this array is never used.</p>
<p>Deleting all referecnes to tmp3_n in blanczos64.c and <br />
blanczos64-no-mmx.c will save a little memory.</p></div>Geoffrey ReynoldsWed, 08 Mar 2006 01:31:30 -0000https://sourceforge.nete7881625e9c90566f8159db6222943148cfc3610not enough polynomialshttps://sourceforge.net/p/ggnfs/bugs/11/<div class="markdown_content"><p>Hello !</p>
<p>with the latest CVS version, compiled with the make<br />
athlon flag, under cygwin (xppro), a duron 1600, with a<br />
c131 gnfs, I obtain very often (at least 50% of the q's) :<br />
warning: not enough polynomials in mpqs with<br />
571668291787399</p>
<p>This has been formerly mentionned in the yahoo group<br />
but still remains for me.</p>
<p>Thanks<br />
Philmajax.</p>
<p>philippe.aclaire@lavache.com</p></div>AnonymousSun, 11 Sep 2005 22:50:52 -0000https://sourceforge.net63b5f9c00d46baf049af9b240516922be287950b"not enough poly.. warninghttps://sourceforge.net/p/ggnfs/bugs/10/<div class="markdown_content"><p>When running the snfs-small test i get now the warning:</p>
<p>label1 1<br />
j=6<br />
"not enough polynomials in mpqs with xxxxxxxxx" <br />
where xxxxx is a changing number.</p>
<p>The test was done with gnfs-lasieve4e.c rev 1.24<br />
which should have removed this warning. </p></div>Lars DauschSun, 04 Sep 2005 10:10:07 -0000https://sourceforge.net4a63a8480454f0a0f478e798c49b4d97115699cesegmentation fault with large data sethttps://sourceforge.net/p/ggnfs/bugs/9/<div class="markdown_content"><p>Hi,</p>
<p>I'm attempting to do a C205 SNFS factorization, but<br />
matbuild crashes in pass 32. First, I get </p>
<p>ll_catFields(): memory reallocation error!<br />
191888103 s32's requested.<br />
Old size was L->maxDataSize=189664691<br />
L->numFields = 25942739, maxShift = 2484826<br />
L->index[25942739] = 189403267<br />
numPairs=91165, numNewEntries=66</p>
<p>which is a bit puzzling since the computer has 3GB of<br />
memory, and at that time it was "only" using about<br />
1.4GB. This was followed almost immediately by the<br />
segfault. Below is the output of the successful pass<br />
31 and the problem in pass 32, followed by the output<br />
of gdb indicating where it thinks the problem is. I<br />
don't know how to diagnose this further, so hopefully<br />
someone can help!<br />
</p>
<p>Greg</p>
<p>pass 31...<br />
Before sortByNumLP()... Doing ll_verify(P)...<br />
ll_verify() reports that 'P' appears to be intact.<br />
makePass:<br />
There are 126896 relations with 0 large primes.<br />
There are 618329 relations with 1 large primes.<br />
There are 7390730 relations with 2 large primes.<br />
There are 9751011 relations with 3 large primes.<br />
There are 6628289 relations with 4 large primes.<br />
There are 1865015 relations with 5 large primes.<br />
There are 0 relations with 6 large primes.<br />
After sortByNumLP()... Doing ll_verify(P)...<br />
ll_verify() reports that 'P' appears to be intact.<br />
Deleting 115465 singleton large primes.<br />
Deleting 3880 singleton large primes.<br />
Deleting 1763 singleton large primes.<br />
Deleting 845 singleton large primes.<br />
Deleting 355 singleton large primes.<br />
Deleting 165 singleton large primes.<br />
Deleting 75 singleton large primes.<br />
Deleting 44 singleton large primes.<br />
Deleting 25 singleton large primes.<br />
Deleting 14 singleton large primes.<br />
Deleting 8 singleton large primes.<br />
Deleting 4 singleton large primes.<br />
Deleting 2 singleton large primes.<br />
Deleting 1 singleton large primes.<br />
Deleting 1 singleton large primes.<br />
Deleting 0 singleton large primes.<br />
Total: 122647 singletons deleted.<br />
makePass:<br />
There are 126896 relations with 0 large primes.<br />
There are 511369 relations with 1 large primes.<br />
There are 7387788 relations with 2 large primes.<br />
There are 9745366 relations with 3 large primes.<br />
There are 6623078 relations with 4 large primes.<br />
There are 1863126 relations with 5 large primes.<br />
There are 0 relations with 6 large primes.<br />
Doing merge on chunk 1/41 (P0=0, P1=1039761)...<br />
Doing 299338 additions...<br />
Doing merge on chunk 2/41 (P0=1039762, P1=2079524)...<br />
Doing 100141 additions...<br />
Doing merge on chunk 3/41 (P0=2079525, P1=3119287)...<br />
Doing 24114 additions...<br />
Doing merge on chunk 4/41 (P0=3119288, P1=4159050)...<br />
Doing 15463 additions...<br />
Doing merge on chunk 5/41 (P0=4159051, P1=5198813)...<br />
Doing 10431 additions...<br />
Doing merge on chunk 6/41 (P0=5198814, P1=6238576)...<br />
Doing 8247 additions...<br />
Doing merge on chunk 7/41 (P0=6238577, P1=7278339)...<br />
Doing 6216 additions...<br />
Doing merge on chunk 8/41 (P0=7278340, P1=8318102)...<br />
Doing 5108 additions...<br />
Doing merge on chunk 9/41 (P0=8318103, P1=9357865)...<br />
Doing 4031 additions...<br />
Doing merge on chunk 10/41 (P0=9357866, P1=10397628)...<br />
Doing 3607 additions...<br />
Doing merge on chunk 11/41 (P0=10397629, P1=11437391)...<br />
Doing 3051 additions...<br />
Doing merge on chunk 12/41 (P0=11437392, P1=12477154)...<br />
Doing 2598 additions...<br />
Doing merge on chunk 13/41 (P0=12477155, P1=13516917)...<br />
Doing 2316 additions...<br />
Doing merge on chunk 14/41 (P0=13516918, P1=14556680)...<br />
Doing 2004 additions...<br />
Doing merge on chunk 15/41 (P0=14556681, P1=15596443)...<br />
Doing 1817 additions...<br />
Doing merge on chunk 16/41 (P0=15596444, P1=16636206)...<br />
Doing 1496 additions...<br />
Doing merge on chunk 17/41 (P0=16636207, P1=17675969)...<br />
Doing 1472 additions...<br />
Doing merge on chunk 18/41 (P0=17675970, P1=18715732)...<br />
Doing 1272 additions...<br />
Doing merge on chunk 19/41 (P0=18715733, P1=19755495)...<br />
Doing 1209 additions...<br />
Doing merge on chunk 20/41 (P0=19755496, P1=20795258)...<br />
Doing 1085 additions...<br />
Doing merge on chunk 21/41 (P0=20795259, P1=21835021)...<br />
Doing 30442 additions...<br />
Doing merge on chunk 22/41 (P0=21835022, P1=22874784)...<br />
Doing 50287 additions...<br />
Doing merge on chunk 23/41 (P0=22874785, P1=23914547)...<br />
Doing 24305 additions...<br />
Doing merge on chunk 24/41 (P0=23914548, P1=24954310)...<br />
Doing 14350 additions...<br />
Doing merge on chunk 25/41 (P0=24954311, P1=25994073)...<br />
Doing 9754 additions...<br />
Doing merge on chunk 26/41 (P0=25994074, P1=27033836)...<br />
Doing 6705 additions...<br />
Doing merge on chunk 27/41 (P0=27033837, P1=28073599)...<br />
Doing 5428 additions...<br />
Doing merge on chunk 28/41 (P0=28073600, P1=29113362)...<br />
Doing 4259 additions...<br />
Doing merge on chunk 29/41 (P0=29113363, P1=30153125)...<br />
Doing 3504 additions...<br />
Doing merge on chunk 30/41 (P0=30153126, P1=31192888)...<br />
Doing 2960 additions...<br />
Doing merge on chunk 31/41 (P0=31192889, P1=32232651)...<br />
Doing 2606 additions...<br />
Doing merge on chunk 32/41 (P0=32232652, P1=33272414)...<br />
Doing 2187 additions...<br />
Doing merge on chunk 33/41 (P0=33272415, P1=34312177)...<br />
Doing 1867 additions...<br />
Doing merge on chunk 34/41 (P0=34312178, P1=35351940)...<br />
Doing 1593 additions...<br />
Doing merge on chunk 35/41 (P0=35351941, P1=36391703)...<br />
Doing 1520 additions...<br />
Doing merge on chunk 36/41 (P0=36391704, P1=37431466)...<br />
Doing 1348 additions...<br />
Doing merge on chunk 37/41 (P0=37431467, P1=38471229)...<br />
Doing 1197 additions...<br />
Doing merge on chunk 38/41 (P0=38471230, P1=39510992)...<br />
Doing 1131 additions...<br />
Doing merge on chunk 39/41 (P0=39510993, P1=40550755)...<br />
Doing 977 additions...<br />
Doing merge on chunk 40/41 (P0=40550756, P1=41590518)...<br />
Doing 867 additions...<br />
Doing merge on chunk 41/41 (P0=41590519, P1=42630223)...<br />
Doing 818 additions...<br />
* There are now 130856 full relations.<br />
pass 32...<br />
Before sortByNumLP()... Doing ll_verify(P)...<br />
ll_verify() reports that 'P' appears to be intact.<br />
makePass:<br />
There are 130856 relations with 0 large primes.<br />
There are 628469 relations with 1 large primes.<br />
There are 7498707 relations with 2 large primes.<br />
There are 9714844 relations with 3 large primes.<br />
There are 6476826 relations with 4 large primes.<br />
There are 1784065 relations with 5 large primes.<br />
There are 0 relations with 6 large primes.<br />
After sortByNumLP()... Doing ll_verify(P)...<br />
ll_verify() reports that 'P' appears to be intact.<br />
Deleting 117404 singleton large primes.<br />
Deleting 4741 singleton large primes.<br />
Deleting 2149 singleton large primes.<br />
Deleting 1000 singleton large primes.<br />
Deleting 463 singleton large primes.<br />
Deleting 222 singleton large primes.<br />
Deleting 110 singleton large primes.<br />
Deleting 65 singleton large primes.<br />
Deleting 30 singleton large primes.<br />
Deleting 12 singleton large primes.<br />
Deleting 3 singleton large primes.<br />
Deleting 2 singleton large primes.<br />
Deleting 2 singleton large primes.<br />
Deleting 0 singleton large primes.<br />
Total: 126203 singletons deleted.<br />
makePass:<br />
There are 130856 relations with 0 large primes.<br />
There are 521504 relations with 1 large primes.<br />
There are 7495042 relations with 2 large primes.<br />
There are 9707658 relations with 3 large primes.<br />
There are 6470500 relations with 4 large primes.<br />
There are 1782004 relations with 5 large primes.<br />
There are 0 relations with 6 large primes.<br />
Doing merge on chunk 1/40 (P0=0, P1=1065755)...<br />
Doing 299323 additions...<br />
Doing merge on chunk 2/40 (P0=1065756, P1=2131512)...<br />
Doing 91787 additions...<br />
Doing merge on chunk 3/40 (P0=2131513, P1=3197269)...<br />
Doing 24088 additions...<br />
Doing merge on chunk 4/40 (P0=3197270, P1=4263026)...<br />
Doing 14974 additions...<br />
Doing merge on chunk 5/40 (P0=4263027, P1=5328783)...<br />
Doing 11072 additions...<br />
Doing merge on chunk 6/40 (P0=5328784, P1=6394540)...<br />
Doing 7966 additions...<br />
Doing merge on chunk 7/40 (P0=6394541, P1=7460297)...<br />
Doing 6376 additions...<br />
Doing merge on chunk 8/40 (P0=7460298, P1=8526054)...<br />
Doing 5290 additions...<br />
Doing merge on chunk 9/40 (P0=8526055, P1=9591811)...<br />
Doing 4123 additions...<br />
Doing merge on chunk 10/40 (P0=9591812, P1=10657568)...<br />
Doing 3465 additions...<br />
Doing merge on chunk 11/40 (P0=10657569, P1=11723325)...<br />
Doing 2961 additions...<br />
Doing merge on chunk 12/40 (P0=11723326, P1=12789082)...<br />
Doing 2442 additions...<br />
Doing merge on chunk 13/40 (P0=12789083, P1=13854839)...<br />
Doing 2180 additions...<br />
Doing merge on chunk 14/40 (P0=13854840, P1=14920596)...<br />
Doing 1890 additions...<br />
Doing merge on chunk 15/40 (P0=14920597, P1=15986353)...<br />
Doing 1629 additions...<br />
Doing merge on chunk 16/40 (P0=15986354, P1=17052110)...<br />
Doing 1559 additions...<br />
Doing merge on chunk 17/40 (P0=17052111, P1=18117867)...<br />
Doing 1457 additions...<br />
Doing merge on chunk 18/40 (P0=18117868, P1=19183624)...<br />
Doing 1302 additions...<br />
Doing merge on chunk 19/40 (P0=19183625, P1=20249381)...<br />
Doing 1112 additions...<br />
Doing merge on chunk 20/40 (P0=20249382, P1=21315138)...<br />
Doing 1064 additions...<br />
Doing merge on chunk 21/40 (P0=21315139, P1=22380895)...<br />
Doing 60436 additions...<br />
Doing merge on chunk 22/40 (P0=22380896, P1=23446652)...<br />
Doing 33554 additions...<br />
Doing merge on chunk 23/40 (P0=23446653, P1=24512409)...<br />
Doing 18551 additions...<br />
Doing merge on chunk 24/40 (P0=24512410, P1=25578166)...<br />
Doing 11442 additions...<br />
Doing merge on chunk 25/40 (P0=25578167, P1=26643923)...<br />
Doing 8147 additions...<br />
Doing merge on chunk 26/40 (P0=26643924, P1=27709680)...<br />
Doing 5868 additions...<br />
Doing merge on chunk 27/40 (P0=27709681, P1=28775437)...<br />
Doing 4783 additions...<br />
Doing merge on chunk 28/40 (P0=28775438, P1=29841194)...<br />
Doing 3892 additions...<br />
Doing merge on chunk 29/40 (P0=29841195, P1=30906951)...<br />
Doing 3199 additions...<br />
Doing merge on chunk 30/40 (P0=30906952, P1=31972708)...<br />
Doing 2757 additions...<br />
Doing merge on chunk 31/40 (P0=31972709, P1=33038465)...<br />
Doing 2372 additions...<br />
Doing merge on chunk 32/40 (P0=33038466, P1=34104222)...<br />
Doing 1924 additions...<br />
Doing merge on chunk 33/40 (P0=34104223, P1=35169979)...<br />
Doing 1786 additions...<br />
Doing merge on chunk 34/40 (P0=35169980, P1=36235736)...<br />
Doing 1598 additions...<br />
Doing merge on chunk 35/40 (P0=36235737, P1=37301493)...<br />
Doing 1338 additions...<br />
Doing merge on chunk 36/40 (P0=37301494, P1=38367250)...<br />
Doing 1236 additions...<br />
Doing merge on chunk 37/40 (P0=38367251, P1=39433007)...<br />
Doing 1161 additions...<br />
Doing merge on chunk 38/40 (P0=39433008, P1=40498764)...<br />
Doing 1017 additions...<br />
Doing merge on chunk 39/40 (P0=40498765, P1=41564521)...<br />
Doing 945 additions...<br />
Doing merge on chunk 40/40 (P0=41564522, P1=42630223)...<br />
Doing 821 additions...<br />
* There are now 135003 full relations.<br />
pass 33...<br />
Before sortByNumLP()... Doing ll_verify(P)...<br />
ll_verify() reports that 'P' appears to be intact.<br />
makePass:<br />
There are 135003 relations with 0 large primes.<br />
There are 638383 relations with 1 large primes.<br />
There are 7603253 relations with 2 large primes.<br />
There are 9671968 relations with 3 large primes.<br />
There are 6325517 relations with 4 large primes.<br />
There are 1706236 relations with 5 large primes.<br />
There are 0 relations with 6 large primes.<br />
After sortByNumLP()... Doing ll_verify(P)...<br />
ll_verify() reports that 'P' appears to be intact.<br />
Deleting 119095 singleton large primes.<br />
Deleting 5523 singleton large primes.<br />
Deleting 2580 singleton large primes.<br />
Deleting 1162 singleton large primes.<br />
Deleting 560 singleton large primes.<br />
Deleting 250 singleton large primes.<br />
Deleting 121 singleton large primes.<br />
Deleting 54 singleton large primes.<br />
Deleting 34 singleton large primes.<br />
Deleting 12 singleton large primes.<br />
Deleting 5 singleton large primes.<br />
Deleting 1 singleton large primes.<br />
Deleting 1 singleton large primes.<br />
Deleting 0 singleton large primes.<br />
Total: 129398 singletons deleted.<br />
makePass:<br />
There are 135003 relations with 0 large primes.<br />
There are 531251 relations with 1 large primes.<br />
There are 7598867 relations with 2 large primes.<br />
There are 9663665 relations with 3 large primes.<br />
There are 6318281 relations with 4 large primes.<br />
There are 1703895 relations with 5 large primes.<br />
There are 0 relations with 6 large primes.<br />
Doing merge on chunk 1/40 (P0=0, P1=1065755)...<br />
Doing 299332 additions...<br />
Doing merge on chunk 2/40 (P0=1065756, P1=2131512)...<br />
Doing 91165 additions...<br />
ll_catFields(): memory reallocation error!<br />
191888103 s32's requested.<br />
Old size was L->maxDataSize=189664691<br />
L->numFields = 25942739, maxShift = 2484826<br />
L->index[25942739] = 189403267<br />
numPairs=91165, numNewEntries=66</p>
<p>Program received signal SIGSEGV, Segmentation fault.<br />
0x5564ac2e in free () from /lib32/libc.so.6</p>
<p>(gdb) where<br />
#0 0x5564ac2e in free () from /lib32/libc.so.6<br />
#1 0x757ed000 in ?? ()<br />
#2 0x015fe000 in ?? ()<br />
#3 0x5e98fc7c in ?? ()<br />
#4 0x00000003 in ?? ()<br />
#5 0x757ed008 in ?? ()<br />
#6 0x0809226e in merge (R=0xffff83b0, P=0x813ca28,<br />
revP=0xffff8200, <br />
P0=1065756, P1=2131512, level=72) at combparts.c:424<br />
#7 0x08092574 in makePass (R=0xffff83b0, P=0x813ca28)<br />
at combparts.c:513<br />
#8 0x08093518 in combParts (R=0xffff83b0, P=0x813ca28,<br />
maxRelsInFF=48, <br />
minFF=1938702) at combparts.c:870<br />
#9 0x0804c85d in doRowOps3 (P=0xffff83dc,<br />
R=0xffff83b0, prelF=0xffffb4a0, <br />
maxRelsInFF=48) at matbuild.c:753<br />
#10 0x0804c91c in getCols (colName=0x80946b5 "cols",<br />
prelF=0xffffb4a0, <br />
lpF=0xffffb450, FB=0xffffb4f0, minFull=1938702,<br />
maxRelsInFF=48)<br />
at matbuild.c:780<br />
#11 0x0804e8ab in main (argC=5, args=0xffffbcc4) at<br />
matbuild.c:1293</p></div>AnonymousThu, 11 Aug 2005 03:02:08 -0000https://sourceforge.net9b6859e68ea803be91b24856030aa0b100c444b1c+0 typo in ggnfs-doc.texhttps://sourceforge.net/p/ggnfs/bugs/8/<div class="markdown_content"><p>c+0+c_1x+... should be c_0+c_1x+... in ggnfs-doc.tex.<br />
Patch attached.</p></div>Geoffrey ReynoldsWed, 13 Jul 2005 06:25:02 -0000https://sourceforge.net42ee82307592369c1bc9371801910f627e413c3eclsieve runs out of memory on the non-monic regressionhttps://sourceforge.net/p/ggnfs/bugs/7/<div class="markdown_content"><p>If the test example in branch_0/tests/non-monic is run<br />
with the Perl script with $DO_CLASSICAL set to 1,<br />
sieve.exe will crash. This is with a MinGW32 binary<br />
run on a Pentium M under Windows XP.</p>
<p>This seems to happen immediately after line 1882 of<br />
clsieve.c:</p>
<p>if (entry->num_used==entry->num_alloc) {<br />
entry->num_alloc *= 2;<br />
entry->list = (update_t *)realloc(entry->list,<br />
entry->num_alloc*sizeof(update_t));<br />
}<br />
entry->list[entry->num_used++] = new_update;</p>
<p>The realloc() of entry->list failed. And no wonder, my<br />
debugger says entry->num_alloc was set to 131072000,<br />
and sizeof(update_t) is 8, meaning it was trying to<br />
realloc a gigabyte of memory.</p>
<p>Under Linux, it doesn't crash, though perhaps it's<br />
because I haven't let it run long enough... it does<br />
however start using the swapfile excessively, bogging<br />
down the whole system.</p></div>Sam ChongWed, 06 Jul 2005 22:02:26 -0000https://sourceforge.net3e02e1a0d8f90beec77b6ed288971cb3bba41438non-monic regression fails consistentlyhttps://sourceforge.net/p/ggnfs/bugs/6/<div class="markdown_content"><p>Filed under sqrt, though it could very well be an error<br />
in procrels/matbuild/matsolve. Going into the<br />
branch_0/tests/non-monic directory and running</p>
<p>../factLat.pl snfs</p>
<p>using binaries compiled from current repository<br />
versions (as of 5 Jul 2005) will result (after several<br />
minutes) in 32 sqrt runs which all fail saying<br />
something like:</p>
<p>Error: Odd exponent found: AFB[x] has exponent y!</p>
<p>where y is, sure enough, odd. This occurs in the<br />
following environments:</p>
<p>* MinGW32 binaries compiled with mingw-gcc-3.4.2 on a<br />
Pentium M under Windows XP<br />
* Gentoo Linux 2.6 system compiled with gcc-3.4.3 on a<br />
Pentium 3<br />
* Gentoo Linux 2.4 system compiled with gcc-3.3.4 on a<br />
Pentium 2</p>
<p>This happens with or without compiler optimizations and<br />
with maxRelsInFF=28 or 32, so I hope it shouldn't be<br />
hard to replicate....</p>
<p>Nothing abnormal was reported in ggnfs.log or screen<br />
output.</p>
<p>Excerpted screen output follows:<br />
final weight is: 71419.<br />
Before deleting relation sets heavier than wt 32, there<br />
were:<br />
Wt | # R-S | Cum. R-S | Cum. wt.<br />
---------------------------------<br />
1 | 2422| 2422|2422<br />
2 | 3292| 5714|9006<br />
3 | 2309| 8023|15933<br />
4 | 2232| 10255|24861<br />
5 | 1791| 12046|33816<br />
6 | 1400| 13446|42216<br />
7 | 1057| 14503|49615<br />
8 | 699| 15202|55207<br />
9 | 539| 15741|60058<br />
10 | 329| 16070|63348<br />
11 | 222| 16292|65790<br />
12 | 161| 16453|67722<br />
13 | 87| 16540|68853<br />
14 | 52| 16592|69581<br />
15 | 41| 16633|70196<br />
16 | 23| 16656|70564<br />
17 | 16| 16672|70836<br />
18 | 6| 16678|70944<br />
19 | 10| 16688|71134<br />
20 | 6| 16694|71254<br />
21 | 3| 16697|71317<br />
24 | 1| 16698|71341<br />
25 | 1| 16699|71366<br />
26 | 1| 16700|71392<br />
27 | 1| 16701|71419<br />
--------------------------------------------------------------<br />
Wt = Weight<br />
# R-S = Number of relation-sets with this weight.<br />
Cum. R-S = # of relation-sets with at most this weight.<br />
Cum. wt. = cumulative weight of relation-sets upto here.<br />
--------------------------------------------------------------<br />
After removing heavy rel-sets, weight is 71419.<br />
After re-scanning files and building column indicies,<br />
numFF=16701.<br />
Creating 16701 matrix columns...</p>
<p>readRelList : [ 100% done] <br />
Re-read 296487 relations from rels.bin.0 : [0, 296487).<br />
Loading matrix into RAM...<br />
Matrix scanned: it should be 10319 x 16701.<br />
Found 4 dense blocks. Re-reading matrix...<br />
The dense blocks consist of the following sets of rows:<br />
[10255, 10318]<br />
[0, 63]<br />
[64, 127]<br />
[5133, 5196]<br />
Matrix loaded: it is 10319 x 16701.<br />
Initial matrix is 10319 x 16701 with sparse part having<br />
weight 506353.<br />
(total weight is 1315081)<br />
Matrix pruned to 8468 x 8583 with weight 178630.....<br />
</p>
<p>Sanity check: M.numCols = 8583 = C.numFields. passed.<br />
`depinf' written. You can now run matsolve.<br />
Total elapsed time: 4.42 seconds.<br />
-> Doing matrix step...<br />
=><br />
"c:/mingw/msys/1.0/home/SamAdmin/dev/ggnfs/branch_0/src/matsolve.exe"</p>
<p>__________________________________________________________</p>
<p>| This is the matsolve program for GGNFS. <br />
|<br />
| Version: 0.77.1 <br />
|<br />
| This program is copyright 2004, Chris Monico, and<br />
subject|<br />
| to the terms of the GNU General Public License<br />
version 2.|<br />
|__________________________________________________________|<br />
Using PRNG seed=2039360796.<br />
Verifying column map...done.<br />
Matrix loaded: it is 8468 x 8583.<br />
Original matrix had 16701 columns.<br />
Matrix difficulty is about 28.56<br />
Doing block Lanczos...<br />
First matrix product test passed.<br />
Second matrix product test passed.<br />
Lanczos: Estimate 97.2% complete (0.5 seconds / 0.5<br />
seconds)... <br />
Block Lanczos used 133 iterations.<br />
After Block Lanczos iteration, Vm is nonzero. Finishing...<br />
Found 63 dependencies for A=(B^T)B.<br />
Getting dependencies for original matrix, B...<br />
Found 30 dependencies for 'B'. Verifying...<br />
Verified.<br />
Returned 30. Block Lanczos took 0.75 seconds.<br />
Writing dependencies to file deps.<br />
Total elapsed time: 0.78 seconds.</p>
<p>=><br />
"c:/mingw/msys/1.0/home/SamAdmin/dev/ggnfs/branch_0/src/sqrt.exe"<br />
-fb snfs.fb -deps deps -depnum 0 <br />
__________________________________________________________</p>
<p>| This is the sqrt program for GGNFS. <br />
|<br />
| Version: 0.77.1 <br />
|<br />
| This program is copyright 2004, Chris Monico, and<br />
subject|<br />
| to the terms of the GNU General Public License<br />
version 2.|<br />
|__________________________________________________________|<br />
Setting up nf_t object...<br />
F_1 = -1-2X + 1X^2 + 1X^3<br />
F_2 = -3211838877954855105157370 + 1792160394037X<br />
Reading dependency 0 from file deps...<br />
NUMCOLS = 16701<br />
COLNAME = cols.index<br />
MAXRELS = 296487<br />
RELPREFIX = rels.bin<br />
RELFILES = 1<br />
LPFPREFIX = lpindex<br />
LPFFILES = 0<br />
There are 6415 columns in this dependency. Getting<br />
corresponding (a,b) pairs...<br />
This dependency consists of 15021 (a,b) pairs.<br />
-2 + 1X + 1X^2<br />
1 + 1X<br />
There are 0 special prime ideals:<br />
Found 167222 large primes total.<br />
fix_for_cd(): c_d factored.<br />
The zeros of f have been computed as:<br />
z0 = -1.801937735804838 + I*0.000000000000000<br />
z1 = -0.445041867912629 + I*0.000000000000000<br />
z2 = 1.246979603717467 + I*0.000000000000000<br />
Reading relations and computing initial <gamma><br />
factorization...<br />
depSize = 15021.<br />
Reading relations from rels.bin.0...<br />
The final square should be:<br />
107797127208747271806028244788588549863656691074368529103151555043<br />
We used 15021 (a,b) pairs.<br />
Error: Odd exponent found: AFB[0] has exponent 1!<br />
=><br />
"c:/mingw/msys/1.0/home/SamAdmin/dev/ggnfs/branch_0/src/sqrt.exe"<br />
-fb snfs.fb -deps deps -depnum 1 <br />
__________________________________________________________</p>
<p>| This is the sqrt program for GGNFS. <br />
|<br />
| Version: 0.77.1 <br />
|<br />
| This program is copyright 2004, Chris Monico, and<br />
subject|<br />
| to the terms of the GNU General Public License<br />
version 2.|<br />
|__________________________________________________________|<br />
Setting up nf_t object...<br />
F_1 = -1-2X + 1X^2 + 1X^3<br />
F_2 = -3211838877954855105157370 + 1792160394037X<br />
Reading dependency 1 from file deps...<br />
NUMCOLS = 16701<br />
COLNAME = cols.index<br />
MAXRELS = 296487<br />
RELPREFIX = rels.bin<br />
RELFILES = 1<br />
LPFPREFIX = lpindex<br />
LPFFILES = 0<br />
There are 6398 columns in this dependency. Getting<br />
corresponding (a,b) pairs...<br />
This dependency consists of 15067 (a,b) pairs.<br />
-2 + 1X + 1X^2<br />
1 + 1X<br />
There are 0 special prime ideals:<br />
Found 167222 large primes total.<br />
fix_for_cd(): c_d factored.<br />
The zeros of f have been computed as:<br />
z0 = -1.801937735804838 + I*0.000000000000000<br />
z1 = -0.445041867912629 + I*0.000000000000000<br />
z2 = 1.246979603717467 + I*0.000000000000000<br />
Reading relations and computing initial <gamma><br />
factorization...<br />
depSize = 15067.<br />
Reading relations from rels.bin.0...<br />
The final square should be:<br />
2500303992553709729452007189116494144246474250079912620708245237056<br />
We used 15067 (a,b) pairs.<br />
Error: Odd exponent found: AFB[0] has exponent -5!<br />
...</p>
<p>s73-snfs.txt follows:<br />
Number: snfs<br />
N=6336348260440219970725096108505792822584894566369686935367355504409<br />
( 67 digits)<br />
SNFS difficulty: 73 digits.<br />
Divisors found:<br />
Version: GGNFS-0.77.1<br />
Total time: 0.14 hours.<br />
Scaled time: 0.08 units (timescale=0.548).<br />
Factorization parameters were as follows:<br />
# This is a small test case for non-monic linear<br />
polynomials.<br />
name: snfs<br />
type: snfs<br />
n:<br />
6336348260440219970725096108505792822584894566369686935367355504409<br />
deg: 3<br />
c3: 1<br />
c2: 1<br />
c1: -2<br />
c0: -1<br />
Y0: -3211838877954855105157370<br />
Y1: 1792160394037<br />
skew: 3.000</p>
<p>rlim: 50000<br />
alim: 50000<br />
lpbr: 25<br />
lpba: 25<br />
mfbr: 43<br />
mfba: 43<br />
rlambda: 2.2<br />
alambda: 2.2<br />
qintsize: 5000<br />
Factor base limits: 50000/50000<br />
Large primes per side: 3<br />
Large prime bits: 25/25<br />
Max factor residue bits: 43/43<br />
Sieved algebraic special-q in [25000, 35001)<br />
Primes: RFBsize:5133, AFBsize:5122, largePrimes:371317<br />
encountered<br />
Relations: rels:296487, finalFF:16701<br />
Max relations in full relation-set: 32<br />
Initial matrix: 10319 x 16701 with sparse part having<br />
weight 506353.<br />
Pruned matrix : 8468 x 8583 with weight 178630.<br />
Total sieving time: 0.12 hours.<br />
Total relation processing time: 0.01 hours.<br />
Matrix solve time: 0.00 hours.<br />
Time per square root: 0.00 hours.<br />
Prototype def-par.txt line would be:<br />
snfs,73,3,0,0,0,0,0,0,0,0,50000,50000,25,25,43,43,2.2,2.2,10000<br />
total time: 0.14 hours.<br />
--------- CPU info (if available) ----------</p></div>Sam ChongWed, 06 Jul 2005 06:52:53 -0000https://sourceforge.net1b7a8c6d83276246a0512b82af2fbd9f79b2874f