![]() |
|
|
#1 |
|
May 2011
23 Posts |
Hi, may i know how are the dependencies and cycles are stored in the .dep and .cyc files? thanks
|
|
|
|
|
|
#2 |
|
Tribal Bullet
Oct 2004
3,541 Posts |
This information is coming in the update to Readme.nfs that I'm writing.
|
|
|
|
|
|
#3 |
|
May 2011
101112 Posts |
Ok nice! Around when will it be ready? =)
|
|
|
|
|
|
#5 |
|
May 2011
278 Posts |
Thats awesome! Thanks! =)
Last fiddled with by Sleepy on 2011-05-27 at 06:25 |
|
|
|
|
|
#6 |
|
May 2011
23 Posts |
Another question, is ggnfs functionally capable of sieving a 768 or 1024 bit number to produce a small number of relations?
|
|
|
|
|
|
#7 | |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
10,753 Posts |
Quote:
The problem is not getting it to produce a small number of relations. The real problem is getting it to produce a large number of relations, enough to complete the factorization. Paul |
|
|
|
|
|
|
#8 |
|
Dec 2010
Monticello
5·359 Posts |
Isn't there also a problem of doing some linear algrebra on those relations to actually find the factors?
|
|
|
|
|
|
#9 |
|
May 2011
278 Posts |
Hmm thats weird. Yeah i know that the tough part is to produce enough relations but i'm satisfied with a small handful this time. However, i keep getting a "xmalloc: cannot allocate memory" error even though i still have free memory at that point in time. Anyone encounter that before? It works fine with a 663bit number though.
|
|
|
|
|
|
#10 | |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
36·13 Posts |
Quote:
You need to be more specific for a more specific answer. 663bit number? gnfs? snfs? how much memory do you have? what's the os and the setup? For a 663bit gnfs number, you'd better be prepared to invest in a system able to finish this computation. Lookup posts by fivemack, frmky for starters. (Search :: Advanced Search :: Search by User Name :: Show posts.) |
|
|
|
|
|
|
#11 | |
|
May 2011
23 Posts |
Quote:
I am actually only interested in generating a small handful (around 10-20) of relations for academic purposes so i don't really need the computing power to complete the whole factorization. But i figured that to start the sieving step would also require some fair amount of resources. I am running it on redhat, pentium 4, 3GHz, 1.75GB ram. Btw, my gcc compiler is 4.1.2 and i also tried "ulimit -s unlimited" to remove the stack limit. CRAP! Could it be because my gcc compiler is too old? Last fiddled with by Sleepy on 2011-06-02 at 03:33 |
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Too few cycles error | cardmaker | Factoring | 4 | 2016-12-29 15:52 |
| "lanczos error: only trivial dependencies found" with massive oversieving | eigma | Msieve | 21 | 2015-05-28 03:27 |
| 3n + 1 cycles for n = 2^57,885,161-1 | Unregistered | Information & Answers | 7 | 2013-02-16 02:24 |
| Cheapest CPU cycles? | siegert81 | Hardware | 17 | 2010-12-27 18:00 |
| CPU cycles | Unregistered | Information & Answers | 0 | 2007-07-19 12:24 |