![]() |
![]() |
#1 |
Apr 2005
13 Posts |
![]()
Hi,
I am trying to factor a c129 from the xyyxf project. (The number is 689248390756594092329903555441060933187672009587156714157714459911067848381094129751231275207217559323589590068177837430265561551) However, when I run the sqrt program, I either get the trivial factorization 1*N, or the error message posted beneath. Any idea on how I can fix this? ggnfs/Version reads: 0.77.1-20060513 Sun May 14 09:18:57 UTC 2006 The system is a Pentium 4 running Ubuntu 6.06. Cheers, Hallstein -------------------------------- ... Reading relations from rels.bin.23... The final square should be: 130680677895632184865139317000365589321504868538119170411575793060617878224349779001039329223849671202761057909376525885051074735 We used 2277256 (a,b) pairs. Error: Odd exponent found: AFB[11] has exponent 1! |
![]() |
![]() |
![]() |
#2 | |
"Bob Silverman"
Nov 2003
North of Boston
22·1,877 Posts |
![]() Quote:
I don't use GGNFS, but I strongly suspect that this is a linear algebra error and not a sqrt error. Is there a way to verify the LA solution sets? |
|
![]() |
![]() |
![]() |
#3 | |
May 2003
Warsaw
3·5 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#4 |
Jul 2003
So Cal
72·53 Posts |
![]()
It can also be completed using the latest version of msieve. See
this post for details: http://www.mersenneforum.org/showpos...&postcount=403 Greg |
![]() |
![]() |
![]() |
#5 | |
Apr 2005
158 Posts |
![]() Quote:
I tried this just now. But when I ran msieve, I got an enormous amount of errors messages: 90% of the error messages were on the form "error -10 reading relation X" The remaining were "error -5..." Then, in the linear algebra stage, it segfaulted. The last message to be written to the log was "using 32 quadratic characters above 134217362" |
|
![]() |
![]() |
![]() |
#6 |
Jul 2003
So Cal
1010001001012 Posts |
![]()
This is a large GNFS factorization, isn't it? Version 1.19 doesn't support 64-bit a values, which you have in abundance. The next version of msieve, hopefully due any day now, will support 64-bit a values and therefore should work.
![]() Greg |
![]() |
![]() |
![]() |
#7 | |
(loop (#_fork))
Feb 2006
Cambridge, England
2×7×461 Posts |
![]() Quote:
I haven't had a segfault in linalg from msieve, though that may be something to look forward to when my C200 SNFS finally accumulates enough relations to build a matrix. ggnfs is failing on that run: procrels dies during the make-more-files step roughly at the point where the total size of the rels.bin.* files exceeds 2^32 bytes, in such a way as to destroy the rels.bin.*. Thankfully, I save unprocessed relations. |
|
![]() |
![]() |
![]() |
#8 |
Tribal Bullet
Oct 2004
355510 Posts |
![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
New GGNFS problem | 10metreh | Factoring | 65 | 2008-12-06 21:14 |
127*Sqrt(62) | XYYXF | Math | 2 | 2007-12-08 12:31 |
How do you get around the |a|<2^31 problem in ggnfs? | fivemack | Factoring | 4 | 2007-03-22 01:00 |
SQRT Problem | R.D. Silverman | NFSNET Discussion | 11 | 2006-07-20 17:04 |
P(n+1)<(sqrt(P(n))+1)^2 | Crook | Math | 3 | 2005-10-26 21:29 |