log in

Posts by wreck2002

1) Message boards : Questions/Problems/Bugs : RAM, runtime and credits (Message 1819)
Posted 13 Dec 2017 by Profile wreck2002
Post:
14e
C231_134_79 snfs 257 lbp 32 20-400 M
680.05 MB
-c 16000 -f 104976000
2h 42min


15e
F1327 snfs 276 lpb 32 50-500 M
552.37 MB
-c 4000 -f 109520000
1h 6min


It ' s likely that C231_134_79 should use -c 8000 but not -c 16000,
that is why it takes 2 hours but not 1 hour.

In principle, F1327 should use 16e, C231_134_79 should use 15e.
NFS@Home ' s main purpose is focus on Cunningham numbers, (a^n + 1, a^n - 1).
16e is full, so F1327 use 15e.
14e is empty, so C231_134_79 use 14e.
2) Message boards : Questions/Problems/Bugs : How does the project names correspond with the numbers? (Message 1772)
Posted 6 May 2017 by Profile wreck2002
Post:
I give an example,
S3p689_734542_0
Herse S3p689 is the name of the number, it means
3^689 + 1
S means Special Number Field Sieve,
p means plus.
734542 is the start of special Q / 1000 ' s tag.

If a number is started with G, it means General Number Field Sieve.
3) Message boards : NFS Discussion : Factoring Lucas/Fibonacci numbers (Message 1516)
Posted 6 Apr 2015 by Profile wreck2002
Post:
Thanks for your reply.
I am going to factor 10^423-1 with Kurt and some others. Kurt has a 6 core 12 thread i7 with 16G memory using lpbr=32,it seems like that there is a risk of 16G memory not enough for this snfs 282.
I also curious for the next 16e candidaters of nfs@home,there is not enough gnfs Cunningham candidates left,so when switch to champion snfs ,for example snfs 350,whether 64G memory enough is a problem.
4) Message boards : NFS Discussion : Factoring Lucas/Fibonacci numbers (Message 1512)
Posted 27 Mar 2015 by Profile wreck2002
Post:
How much memory does this factorization taking?
5) Message boards : Questions/Problems/Bugs : Small issue (Message 1261)
Posted 14 Jan 2014 by Profile wreck2002
Post:
Yes, it is OK now!
Thank you!
6) Message boards : Questions/Problems/Bugs : Small issue (Message 1259)
Posted 12 Jan 2014 by Profile wreck2002
Post:
It has been a long time that the font is not showed correctly of the page:
http://escatter11.fullerton.edu/nfs/
Since my local language is Chinese, the Chinese characters are all not correct.
And the yoyo@home 's language is showed correctly,which is
http://www.rechenkraft.net/yoyo/

[/img]
7) Message boards : NFS Discussion : 3,607- factors (Message 1150)
Posted 19 May 2013 by Profile wreck2002
Post:
Here is the article title and the journal name.

Zhang Peng, and Li Chao, "POLYNOMIAL SELECTIONS IN FACTORING r^e+-s WITH NFS",
Computer Applications and Software, no. 4, Vol. 26, pp. 28-30, Apr. 2009.

Zhang Peng is a postgraduate student in
Department of Mathematics and System Science, National University of Defense Technology, Changsha 410073, China.

This article's main conclusion is,
when N is less than 40 digits, degree should be 3;
when N's digit is between 40 to 100, should degree 4;
100 to 160, be degree 5;
170 to 270, be degree 6;
280 to 350, be degree 7.
8) Message boards : NFS Discussion : 3,607- factors (Message 1149)
Posted 18 May 2013 by Profile wreck2002
Post:
OK, Here is a somewhat more detail information.
I fogot this article's title,
but it is indeed a journal article.
The author only discuss monic polynomial,
I can not understand the theory discussed in this article.
In fact I want to study polynomial selection or some other technique of factoring in my master degree,
but my tutor does not think I have the ability to do it, so I select another area in mathematics.

This article is published in a Chinese jornal, I'll find its title and journal later. After Greg deny the result, I almost forgot this thread.

I also curious about the slow progress in the study of nfs.
I find some articles in the past 3 years, but most of them are introduction,
a paper discussed multiple polynomial, and another paper discuss gnfs polynomial degree, but stopped at 6, but it does not discuss degree 7, I dont know why the max degree discussed is 6.

And Comparing with so many numbers have been factored in the past 5 years, the progress in factoring theory is slow, it is a little strange. RSA768 is degree 6, M1061 is degree 6, so if we want to factor RSA1024 ,or F12, is it possible to try to use degree 7.
9) Message boards : NFS Discussion : 3,745+ Lattice Sieve application status (Message 1122)
Posted 26 Apr 2013 by Profile wreck2002
Post:
Last 16e Lattice Sieve application wu received is at ~q=316M (goal to unknow)
Last 16e Lattice Sieve V5 application wu received is at ~q=354M (goal to unknown)
10) Message boards : Questions/Problems/Bugs : Work to do (Message 1078)
Posted 23 Jan 2013 by Profile wreck2002
Post:
How about add a new type of 16e to factor numbers between diff 275-300, and another 16e to tackle difficulty above 300. that would fill the gap.
11) Message boards : NFS Discussion : 7,355+ factors (Message 819)
Posted 30 Mar 2012 by Profile wreck2002
Post:
Is the detail log still available?
And why you not attach the log file here too beside mersenneform?
12) Message boards : News : Kilobit SNFS factorization completed! (Message 752)
Posted 10 Aug 2011 by Profile wreck2002
Post:
Congratulations!
13) Message boards : NFS Discussion : 3,607- factors (Message 621)
Posted 5 Nov 2010 by Profile wreck2002
Post:
Is this number be factored use degree 6, I notice the poly of 6,379+ is
n: 190869828061621461659863636707439059948042541397156797021935219218350398154483149591895053229379732129532332295828579589760877766171097533506965397824066533846000077988917965921258973321630437676677267014005259227990906727916564002361612266675089370791738705252309553229
type: snfs
skew: 1
c6: 6
c5: 0
c4: 0
c3: 0
c2: 0
c1: 0
c0: 1
Y1: 1
Y0: -10556714443828879617693714491135314434982743638016
alim: 250000000
rlim: 200000000
lpbr: 33
lpba: 33
mfba: 66
mfbr: 96
alambda: 2.6
rlambda: 3.6

that is a degree 6,

but I read a article which suggest using degree 7 for SNFS 280 to 350.
So what's the matter here?
14) Message boards : Questions/Problems/Bugs : Is it possible to provide the ggnfs binary link? (Message 600)
Posted 2 Oct 2010 by Profile wreck2002
Post:
Without BOINC API, Ubuntu 64 bit.
gnfs-lasieve4I14e
If possible could you send it to my email wreck2002@sina.com please?
15) Message boards : Questions/Problems/Bugs : Is it possible to provide the ggnfs binary link? (Message 598)
Posted 1 Oct 2010 by Profile wreck2002
Post:
I notice the link
http://escatter11.fullerton.edu/nfs/apps.php
give almost all the operation system's ggnfs binary list, but does not give the link to download the binary.

So is it possible to give the link.

BTW
The binary of
http://physics.fullerton.edu/gchilders/gnfs-lasieve4_64.tar.gz
can not use the option of -R.
16) Message boards : Questions/Problems/Bugs : Project recently started using too much memory? (Message 193)
Posted 29 Oct 2009 by Profile wreck2002
Post:
Is there any way to reduce the memory that the programe lasievef use?
1G seems not acceptable for most of the computer I see,but as the number grow bigger,it will be more and more number need to use 16e.




Home | My Account | Message Boards