mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Msieve

Reply
 
Thread Tools
Old 2011-05-24, 08:31   #1
Sleepy
 
May 2011

23 Posts
Default Dependencies and cycles

Hi, may i know how are the dependencies and cycles are stored in the .dep and .cyc files? thanks
Sleepy is offline   Reply With Quote
Old 2011-05-24, 15:53   #2
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

3,541 Posts
Default

This information is coming in the update to Readme.nfs that I'm writing.
jasonp is offline   Reply With Quote
Old 2011-05-26, 04:16   #3
Sleepy
 
May 2011

101112 Posts
Default

Ok nice! Around when will it be ready? =)
Sleepy is offline   Reply With Quote
Old 2011-05-26, 12:22   #4
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

3,541 Posts
Default

Around now :)
jasonp is offline   Reply With Quote
Old 2011-05-27, 06:25   #5
Sleepy
 
May 2011

278 Posts
Default

Thats awesome! Thanks! =)

Last fiddled with by Sleepy on 2011-05-27 at 06:25
Sleepy is offline   Reply With Quote
Old 2011-06-01, 07:19   #6
Sleepy
 
May 2011

23 Posts
Default

Another question, is ggnfs functionally capable of sieving a 768 or 1024 bit number to produce a small number of relations?
Sleepy is offline   Reply With Quote
Old 2011-06-01, 09:52   #7
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

10,753 Posts
Default

Quote:
Originally Posted by Sleepy View Post
Another question, is ggnfs functionally capable of sieving a 768 or 1024 bit number to produce a small number of relations?
Undoubtedly so. ggnfs was used to factor RSA-768.

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
xilman is offline   Reply With Quote
Old 2011-06-02, 01:19   #8
Christenson
 
Christenson's Avatar
 
Dec 2010
Monticello

5·359 Posts
Default

Isn't there also a problem of doing some linear algrebra on those relations to actually find the factors?
Christenson is offline   Reply With Quote
Old 2011-06-02, 02:03   #9
Sleepy
 
May 2011

278 Posts
Default

Quote:
Originally Posted by xilman View Post
Undoubtedly so. ggnfs was used to factor RSA-768.

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
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.
Sleepy is offline   Reply With Quote
Old 2011-06-02, 02:32   #10
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

36·13 Posts
Default

Quote:
Originally Posted by Sleepy View Post
..."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.
People have encountered this before, yes.
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.)
Batalov is offline   Reply With Quote
Old 2011-06-02, 03:10   #11
Sleepy
 
May 2011

23 Posts
Default

Quote:
Originally Posted by Batalov View Post
People have encountered this before, yes.
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.)
Thanks Batalov! I'll take a look at their posts!

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
Sleepy is offline   Reply With Quote
Reply



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

All times are UTC. The time now is 01:00.


Sat Jul 17 01:00:27 UTC 2021 up 49 days, 22:47, 1 user, load averages: 1.97, 1.49, 1.39

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.