Auteur Sujet: NFS@Home  (Lu 52503 fois)

0 Membres et 1 Invité sur ce sujet

Jaehaerys Targaryen

  • CàA
  • Messages: 10388
  • Boinc'eur devant l'éternel
  • *****
  •   
Re : NFS@Home
« Réponse #50 le: 28 juin 2010 à 14:23 »
très populaire à ce que je vois....

44 points par uts...


Twitter : devweborne // Chaine Youtube : https://www.youtube.com/channel/UCXcoCd-1UlHpYIYzNER0n1Q

al@ON

  • Messages: 11703
  • Boinc'eur devant l'éternel
  • *****
  •   
    • MySpace al@ON
Re : Re : NFS@Home
« Réponse #51 le: 28 juin 2010 à 21:58 »
très populaire à ce que je vois....
17 cruncheurs pour toute L'AF.

44 points par uts...
Ta bécane
Citer
4,952.42     4,626.52     32.42     44.00     15e Lattice Sieve v1.07
4,713.07    4,377.09    30.67    44.00    15e Lattice Sieve v1.07
5,044.04    4,695.83    32.90    44.00    15e Lattice Sieve v1.07
4,836.05    4,444.70    31.15    44.00    15e Lattice Sieve v1.07
5,486.41    5,032.05    35.26    44.00    15e Lattice Sieve v1.07

Mon 3400+ que j' :love:
Citer
3,900.91     3,524.03     16.03     44.00     15e Lattice Sieve v1.07
3,442.94    3,378.56    15.37    44.00    15e Lattice Sieve v1.07
3,252.10    3,226.94    14.68    44.00    15e Lattice Sieve v1.07
3,684.84    3,628.45    16.51    44.00    15e Lattice Sieve v1.07
3,727.23    3,623.64    16.48    44.00    15e Lattice Sieve v1.07

Mais quel est donc son secret à cette vieille machine. :siflotte:

Jaehaerys Targaryen

  • CàA
  • Messages: 10388
  • Boinc'eur devant l'éternel
  • *****
  •   
Re : NFS@Home
« Réponse #52 le: 28 juin 2010 à 22:44 »
n'oublie pas que je suis sous win 7 64 bits


Twitter : devweborne // Chaine Youtube : https://www.youtube.com/channel/UCXcoCd-1UlHpYIYzNER0n1Q

al@ON

  • Messages: 11703
  • Boinc'eur devant l'éternel
  • *****
  •   
    • MySpace al@ON
Re : Re : NFS@Home
« Réponse #53 le: 28 juin 2010 à 22:55 »
n'oublie pas que je suis sous win 7 64 bits

Hélas pour le projet :/... avec ton i7 tu serais sous GNU/Linux 64 bits tu calculerais 2x + d'UTs. :fccpu:

F5LCU

  • Messages: 782
  • Boinc'eur Respectable
  • ****
  •   
    • F5KKJ Blagnac Amateur Radio
Re : NFS@Home
« Réponse #54 le: 28 juin 2010 à 23:07 »
sniff moi nossi w7 64b!
mais bon le portable est en dual boot screu nieu nieu

17 sur 2832 membres actifs  :??:

Pas Dans Les Sommets la participation  :desole:


La violence est le dernier  refuge de l'incompétence. Isaac Asimov

Jaehaerys Targaryen

  • CàA
  • Messages: 10388
  • Boinc'eur devant l'éternel
  • *****
  •   
Re : Re : Re : NFS@Home
« Réponse #55 le: 28 juin 2010 à 23:13 »
Hélas pour le projet :/ ... avec ton i7 tu serais sous GNU/Linux 64 bits tu calculerais 2x + d'UTs. :fccpu:

qu'est ce qui bloque de calculer plus d'uts ?


Twitter : devweborne // Chaine Youtube : https://www.youtube.com/channel/UCXcoCd-1UlHpYIYzNER0n1Q

al@ON

  • Messages: 11703
  • Boinc'eur devant l'éternel
  • *****
  •   
    • MySpace al@ON
Re : Re : NFS@Home
« Réponse #56 le: 28 juin 2010 à 23:15 »
sniff moi nossi w7 64b!
mais bon le portable est en dual boot screu nieu nieu

17 sur 2832 membres actifs  :??:

Pas Dans Les Sommets la participation  :desole:
Un peu comme d'hab... en pire. :D

louchio

  • Messages: 609
  • Boinc'eur Respectable
  • ****
  •   
Re : NFS@Home
« Réponse #57 le: 28 juin 2010 à 23:57 »
Vive le projet de la semaine,

Cest pour cela que j'ai suggeré de mettre un encart style déroulant ou différent sur le projet de la semaine sur le site de l'AF. Et pas seulement le forum dans la section fight. Cela aiderait peut-être.
« Modifié: 29 juin 2010 à 00:02 par louchio »

MDodier

  • Messages: 9486
  • Boinc'eur devant l'éternel
  • *****
  •   
Re : NFS@Home
« Réponse #58 le: 29 juin 2010 à 02:05 »
Bonne suggestion Louchio

Config : i7 860 2.8 Ghz, Win 7 64 bits, 16 g DDR3 de ram, 1.5 To DD, 750 watts, ATI Sapphire HD 7870, écrans 24 et 23 pouces.

lamoule

  • Messages: 891
  • Boinc'eur Respectable
  • ****
  •   
Re : NFS@Home
« Réponse #59 le: 29 juin 2010 à 08:56 »
partez pas les amis, je viens vous voir ! :lol:
E8500 farmer

fzs600

  • Animateur fanatique
  • Messages: 5966
  • Boinc'eur devant l'éternel
  • *****
  •   
Re : NFS@Home
« Réponse #60 le: 27 août 2010 à 12:32 »
Cela fait la troisieme en deux jours que nfs se detache tout seul,plus
d'ut en cours plus rien du tout.
je suis obliger de me ratacher au projet a chaque fois.
est-ce quelque chose qui arrive souvent qu'un projet se détache tout seul?  :??:
 

Utilisateur GNU-LINUX. fzs600@hub.g3l.org

cedricdd

  • Messages: 1389
  • Boinc'eur devant l'éternel
  • *****
  •   
Re : NFS@Home
« Réponse #61 le: 08 mai 2012 à 19:53 »
Citer
Help needed to factor Bernoulli(200)!
Barry Mazur and William Stein wish to include the factors of the numerator of the 200th Bernoulli number in their upcoming book, and you can help! This is a large GNFS factorization, but NFS@Home has the ability to sieve it in 2-3 months. Therefore, I am placing 2,1019- on hold for a bit. If you have the memory for it please use the lasievef application help factor B200, and let's complete it as quickly as possible!

Citer
Besoin d'aide pour factoriser Bernoulli(200)!
Barry Mazur et William Stein aimeraient inclure les facteurs du numérateur du 200ème nombre de Bernoulli dans leur prochain livre, et vous pouvez aider! Ceci est une énorme factorisation GNFS, mais NFS@Home à la possibilité de le traiter en 2-3 mois. C'est pourquoi je place 2,1019- en attente pour quelque temps. Si vous avez la mémoire nécessaire s'il vous plaît utilisez l'application lasievef (16e Lattice Sieve) pour aider à factoriser B200, finissons le le plus vite possible!
« Modifié: 08 mai 2012 à 19:56 par cedricdd »
Kill all my demons, and my angels might die too.

Jeannot Le Tazon

  • Messages: 272
  • Boinc'eur Confirmé
  • ***
  •   
Re : NFS@Home
« Réponse #62 le: 08 mai 2012 à 22:20 »
PDLS...ponts...Pentathlon...ponts...
bon, si ça dure 2 à 3 mois je pense faire un petit tour dessus. :hyperbon: :hyperbon: :hyperbon:

Jaehaerys Targaryen

  • CàA
  • Messages: 10388
  • Boinc'eur devant l'éternel
  • *****
  •   


Twitter : devweborne // Chaine Youtube : https://www.youtube.com/channel/UCXcoCd-1UlHpYIYzNER0n1Q

Prof

  • Messages: 1867
  • Boinc'eur devant l'éternel
  • *****
  •   
Re : NFS@Home - appli pour Mac 64 bits
« Réponse #64 le: 03 juin 2012 à 11:16 »
Pour l'équipe:PMac bi-G4 1,83GHz 1,25Go de RAM 1 MacPro octo X5570 2.93GHz 16 24Go de RAM et 1 MacPro dodéca X5650 2.66GHz 20 32Go de RAM
Un petit proverbe qui va bien avec l'air du temps:Quand le dernier arbre sera abattu, La dernière rivière empoisonnée, Le dernier poisson pêché, Alors vous découvrirez Que l'argent ne se mange pas. A méditer...;-)

fzs600

  • Animateur fanatique
  • Messages: 5966
  • Boinc'eur devant l'éternel
  • *****
  •   
Re : NFS@Home
« Réponse #65 le: 21 juillet 2012 à 07:59 »

Utilisateur GNU-LINUX. fzs600@hub.g3l.org

JeromeC

  • CàA
  • Messages: 23335
  • Boinc'eur devant l'éternel
  • *****
  •   
Re : NFS@Home
« Réponse #66 le: 22 juillet 2012 à 11:36 »
Pointu.
Parce que c'était lui, parce que c'était moi.

Dilandau

  • Messages: 92
  • Boinc'eur Junior
  • **
  •   
Re : NFS@Home
« Réponse #67 le: 11 décembre 2012 à 18:52 »
Un petit run de 7 jours par equipe est en cours !
http://escatter11.fullerton.edu/nfs/forum_thread.php?id=397
GPU: 1 * nVidia GTX 1070 8Go
CPU: 3 * Intel Xeon E3-1225 v2 + 1 * Intel Xeon E3-1230 v5

Carlos Pinho

  • Messages: 98
  • Boinc'eur Junior
  • **
Re : NFS@Home
« Réponse #68 le: 14 décembre 2012 à 18:02 »
The goal of NFS@Home is to factor large numbers using the Number Field Sieve algorithm. After setting up two polynomials and various parameters, the project participants "sieve" the polynomials to find values of two variables, called "relations," such that the values of both polynomials are completely factored. Each workunit finds a small number of relations and returns them. Once these are returned, the relations are combined together into one large file then start the "postprocessing." The postprocessing involves combining primes from the relations to eliminate as many as possible, constructing a matrix from those remaining, solving this matrix, then performing square roots of the products of the relations indicated by the solutions to the matrix. The end result is the factors of the number.

NFS@Home is interested in the continued development of open source, publicly available tools for large integer factorization. Over the past couple of years, the capability of open source tools, in particular the lattice sieve of the GGNFS suite and the program msieve, have dramatically improved.

Integer factorization is interesting both mathematical and practical perspectives. Mathematically, for instance, the calculation of multiplicative functions in number theory for a particular number require the factors of the number. Likewise, the integer factorization of particular numbers can aid in the proof that an associated number is prime. Practically, many public key algorithms, including the RSA algorithm, rely on the fact that the publicly available modulus cannot be factored. If it is factored, the private key can be easily calculated. Until quite recently, RSA-512, which uses a 512-bit modulus (155 digits), was used. As recently demonstrated by factoring the Texas Instruments calculator keys, these are no longer secure.

NFS@Home BOINC project makes it easy for the public to participate in state-of-the-art factorizations. The project interests is to see how far we can push the envelope and perhaps become competitive with the larger university projects running on clusters, and perhaps even collaborating on a really large factorization.

The numbers are chosen from the Cunningham project. The project is named after Allan Joseph Champneys Cunningham, who published the first version of the factor tables together with Herbert J. Woodall in 1925. This project is one of the oldest continuously ongoing projects in computational number theory, and is currently maintained by Sam Wagstaff at Purdue University. The third edition of the book, published by the American Mathematical Society in 2002, is available as a free download. All results obtained since the publication of the third edition are available on the Cunningham project website.

Concerning target size there are four sievers applications available (http://escatter11.fullerton.edu/nfs/prefs.php?subset=project:):

lasieved - app for RSALS subproject, uses less than 0.5 GB memory: yes or no
lasievee - work nearly always available, uses up to 0.5 GB memory: yes or no
lasievef - used for huge factorizations, uses up to 1 GB memory: yes or no
lasieve5f - used for huge factorizations, uses up to 1 GB memory: yes or no

How's the credit distributed per target wu?

lasieved - 36
lasievee - 44
lasievef - 65
lasieve5f - 65

Why the difference in credits?

The more valuable calculation gets more credit. Especially for 16e (lasievef+lasieve5f), the extra credit also awards for the large memory usage.

What project uses what application?

lasieved - Oddperfect, n^n+(n+1)^(n+1), Fibonacci, Lucas, Cunningham, Cullen and Woodall for SNFS difficulty below 250.
lasievee - Cunningham, Oddperfect or other for SNFS difficulty above 250 to ~280.
lasievef - push the state of art for very difficulty factorizations, above SNFS difficulty of 280
lasieve5f - push the state of art for very difficulty factorizations, above SNFS difficulty of 280

The limits depends upon the boundaries chosen for the poly and characteristics of the number being factored. It's advanced math related.

For a (much) more technical description of the NFS, see the Wikipedia article or Briggs' Master's thesis.

Carlos Pinho

  • Messages: 98
  • Boinc'eur Junior
  • **
Number Field Sieve (NFS) References
« Réponse #69 le: 14 décembre 2012 à 18:03 »
From msieve readme.txt file:

Citer
Matthew Briggs' 'An Introduction to the Number Field Sieve' is
a very good introduction; it's heavier than C&P in places
and lighter in others

Michael Case's 'A Beginner's Guide to the General Number Field
Sieve' has more detail all around and starts to deal with
advanced stuff

Per Leslie Jensen's thesis 'Integer Factorization' has a lot of
introductory detail on NFS that other references lack

Peter Stevenhagen's "The Number Field Sieve" is a whirlwind
introduction the algorithm

Steven Byrnes' "The Number Field Sieve" is a good simplified
introduction as well.

Lenstra, Lenstra, Manasse and Pollard's paper 'The Number Field
Sieve' is nice for historical interest

'Factoring Estimates for a 1024-bit RSA Modulus' should be required
reading for anybody who thinks it would be a fun and easy project to
break a commercial RSA key.

'On the Security of 1024-bit RSA and 160-bit Elliptic Curve
Cryptography' is a 2010-era update to the previous paper

Brian Murphy's thesis, 'Polynomial Selection for the Number Field
Sieve Algorithm', is simply awesome. It goes into excruciating
detail on a very undocumented subject.

Thorsten Kleinjung's 'On Polynomial Selection for the General Number
Field Sieve' explains in detail a number of improvements to
NFS polynomial selection developed since Murphy's thesis.

Kleinjung's latest algorithmic ideas on NFS polynomial selection
are documented at the 2008 CADO Factoring Workshop:
http://cado.gforge.inria.fr/workshop/abstracts.html

Jason Gower's 'Rotations and Translations of Number Field Sieve
Polynomials' describes some very promising improvements to the
polynomial generation process. As far as I know, nobody has actually
implemented them.

D.J. Bernstein has two papers in press and several slides on
some improvements to the polynomial selection process, that I'm
just dying to implement.

Aoki and Ueda's 'Sieving Using Bucket Sort' described the kind of
memory optimizations that a modern siever must have in order to
be fast

Dodson and Lenstra's 'NFS with Four Large Primes: An Explosive
Experiment' is the first realization that maybe people should
be using two large primes per side in NFS after all

Franke and Kleinjung's 'Continued Fractions and Lattice Sieving' is
the only modern reference available on techniques used in a high-
performance lattice siever.

Bob Silverman's 'Optimal Parametrization of SNFS' has lots of detail on
parameter selection and implementation details for building a line
siever

Ekkelkamp's 'On the amount of Sieving in Factorization Methods'
goes into a lot of detail on simulating NFS postprocessing

Cavallar's 'Strategies in Filtering in the Number Field Sieve'
is really the only documentation on NFS postprocessing

My talk 'A Self-Tuning Filtering Implementation for the Number
Field Sieve' describes research that went into Msieve's filtering code.

Denny and Muller's extended abstract 'On the Reduction of Composed
Relations from the Number Field Sieve' is an early attempt at NFS
filtering that's been almost forgotten by now, but their techniques
can work on top of ordinary NFS filtering

Montgomery's 'Square Roots of Products of Algebraic Numbers' describes
the standard algorithm for the NFS square root phase

Nguyen's 'A Montgomery-Like Square Root for the Number Field Sieve'
is also standard stuff for this subject; I haven't read this or the
previous paper in great detail, but that's because the convetional
NFS square root algorithm is still a complete mystery to me

David Yun's 'Algebraic Algorithms Using P-adic Constructions' provided
a lot of useful theoretical insight into the math underlying the
simplex brute-force NFS square root algorithm that msieve uses


Decio Luiz Gazzoni Filho adds:

The collection of papers `The Development of the Number Field
Sieve' (Springer Lecture Notes In Mathematics 1554) should be
absolutely required reading -- unfortunately it's very hard to get
ahold of. It's always marked `special order' at Amazon.com, and I
figured I shouldn't even try to order as they'd get back to me in a
couple of weeks saying the book wasn't available. I was very lucky to
find a copy available one day, which I promptly ordered. Again, I
cannot recommend this book enough; I had read lots of literature on
NFS but the first time I `got' it was after reading the papers here.
Modern expositions of NFS only show the algorithm as its currently
implemented, and at times certain things are far from obvious. Now
this book, being a historical account of NFS, shows how it progressed
starting from John Pollard's initial work on SNFS, and things that
looked out of place start to make sense. It's particularly
enlightening to understand the initial formulation of SNFS, without
the use of character columns.
[NOTE: this has been reprinted and is available from bn.com, at least   -JP]

As usual, a very algebraic and deep exposition can be found in Henri
Cohen's book `A Course In Computational Algebraic Number Theory'.
Certainly not for the faint of heart though. It's quite dated as
well, e.g. the SNFS section is based on the `old' (without character
columns) SNFS, but explores a lot of the underlying algebra.

In order to comprehend NFS, lots of background on algebra and
algebraic number theory is necessary. I found a nice little
introductory book on algebraic number theory, `The Theory of
Algebraic Numbers' by Harry Pollard and Harold Diamond. It's an old
book, not contaminated by the excess of abstraction found on modern
books. It helped me a lot to get a grasp on the algebraic concepts.
Cohen's book is hard on the novice but surprisingly useful as one
advances on the subject, and the algorithmic touches certainly help.

As for papers: `Solving Sparse Linear Equations Over Finite Fields'
by Douglas Wiedemann presents an alternate method for the matrix
step. Block Lanczos is probably better, but perhaps Wiedemann's
method has some use, e.g. to develop an embarassingly parallel
algorithm for linear algebra (which, in my opinion, is the current
holy grail of NFS research).

Carlos Pinho

  • Messages: 98
  • Boinc'eur Junior
  • **
Factoring an integer using NFS - from msieve readme.nfs file Part 1
« Réponse #70 le: 14 décembre 2012 à 18:04 »
Factoring an integer using NFS has 3 main steps:

1. Select Polynomial
2. Collect Relations via Sieving (NFS@Home is dedicated to this step)
3. Combine Relations


1. Polynomial Selection


Step 1 of NFS involves choosing a polynomial-pair (customarily shortened to 'a polynomial') to use in the other NFS phases. The polynomial is completely specific to the number you need factored, and there is an  effectively infinite supply of polynomials that will work. The quality of the polynomial you select has a dramatic effect on the sieving time; a *good* polynomial can make the sieving proceed two or three times faster compared to an average polynomial. So you really want a *good* polynomial, and for large problems should be prepared to spend a fair amount of time looking for one.

Just how long is too long, and exactly how you should look for good polynomials, is currently an active research area. The approximate consensus is that you should spend maybe 3-5% of the anticipated sieving time looking for a good polynomial.

We measure the goodness of a polynomial primarily by its Murphy E score; this is the probability, averaged across all the  possible relations we could encounter during the sieving, that an 'average' relation will be useful for us. This is usually a very small number, and the E score to expect goes down as the number to be factored becomes larger. A larger E score is better.

Besides the E score, the other customary measure of polynomial goodness is the 'alpha score', an approximate measure of how much of an average relation is easily 'divided out' by dividing by small primes. The E score computation requires that we know the approximate alpha value, but alpha is also of independent interest. Good alpha values are negative, and negative alpha with large abo****e value is better. Both E and alpha were first  formalized in Murphy's wonderful dissertation on NFS polynomial selection.

With that in mind, here's an example polynomial for a 100-digit input of no great significance:

R0: -2000270008852372562401653
R1:  67637130392687
A0: -315744766385259600878935362160
A1:  76498885560536911440526
A2:  19154618876851185
A3: -953396814
A4:  180
skew 7872388.07, size 9.334881e-014, alpha -5.410475, combined = 1.161232e-008

As mentioned, this 'polynomial' is actually a pair of polynomials, the Rational polynomial R1 * x + R0 and the 4-th degree Algebraic polynomial

   A4 * x^4 + A3 * x^3 + A2 * x^2 + A1 * x + A0

The algebraic polynomial is of degree 4, 5, or 6 depending on the size of the input. The 'combined' score is the Murphy E value for this polynomial, and is pretty good in this case. The other thing to note about this polynomial-pair is that the leading algebraic coefficient is very small, and each other coefficient looks like it's a fixed factor larger than the next higher- degree coefficient. That's because the algebraic polynomial expects the sieving region to be 'skewed' by a factor equal to the reported skew above.
The polynomial selection determined that the 'average size' of relations drawn from the sieving region is smallest when the region is 'short and wide' by a factor given by the skew. The big advantage to skewing the  polynomial is that it allows the low-order algebraic coefficients to be large, which in turn allows choosing them to optimize the alpha value. The modern algorithms for selecting NFS polynomials are optimized to work when the skew is very large.

NFS polynomial selection is divided into two stages. Stage 1 chooses the leading algebraic coefficient and tries to find the two rational polynomial coefficients so that the top three algebraic coefficients are small. Because stage 1 doesn't try to find the entire algebraic polynomial, it can use powerful sieving techniques to speed up this portion of the search. When stage 1 finds a 'hit', composed of the rational and the leading algebraic polynomial coefficient, Stage 2 then finds the complete polynomial pair and tries to optimize both the alpha and E values. A single stage 1 hit can generate many complete polynomials in stage 2. You can think of stage 1 as a very compute-intensive net that tries to drag in something good, and stage 2 as a shorter but still compute-intensive process that tries to polish things.

Carlos Pinho

  • Messages: 98
  • Boinc'eur Junior
  • **
part 2
« Réponse #71 le: 14 décembre 2012 à 18:04 »
Factoring an integer using NFS has 3 main steps:

1. Select Polynomial
2. Collect Relations via Sieving (NFS@Home is dedicated to this step)
3. Combine Relations


2. Sieving for Relations

The sieving step is not the theoretically most complex part of the algorithm of factorization, but it is the most time consuming part because it iterates over a large domain with some expensive calculations like division and modulo, although some of these can be avoided by using logarithms.
In general optimization of the sieving step will give the biggest reduction in actual running time of the algorithm. It is easy to use a large amount of memory in this step, and one should be aware of this and try to reuse arrays and use the smallest possible data types. The factor bases can for record factorizations contain millions of elements, so one should try to obtain the best on-disk/in-memory tradeoff.

The purpose of the sieving step is to find usable relations, i.e. elements (a, b) with the following properties
• gcd(a, b) = 1
• a + bm is smooth over the rational factor base
• b^deg(f)*f(a/b) is smooth over the algebraic factor base

Finding elements with these properties can be done by various sieving methods like the classical line sieving or the faster lattice sieving, the latter being used at NFS@Home.

The lattice sieving was proposed by John Pollard in "Lattice sieving, Lecture Notes in Mathematics 1554 (1991), 43–49.". The factor bases are split into smaller sets and then the elements which are divisible by a large prime q are sieved. The sizes of the factor bases have to be determined empirically, and are dependent on the precision of the sieving code, if all smooth elements are found or if one skips some by using special-q methods.

One advantage the lattice siever has is the following. The yield rate for the line siever decreases over time because the norms get bigger as the sieve region moves away from the origin. The lattice siever brings the sieve region "back to the origin" when special-q's are changed. This might be its biggest advantage (if there is one).

3. Combine Relations

The last phase of NFS factorization is a group of tasks collectively referred to as 'NFS postprocessing'. You need the factor base file described in the sieving section (only the polynomial is needed, not the actual factor base entries), and all of the relations from the sieving. If you have performed sieving in multiple steps or on multiple machines, all of the relations that have been produced need to be combined into a single giant file. And by giant I mean *really big*; the largest NFS jobs that I know about currently have involved relation files up to 100GB in size.
Even a fairly small 100-digit factorization generates perhaps 500MB of disk files, so you are well advised to allow plenty of space for relations. Don't like having to deal with piling together thousands of files into one? Sorry, but disk space is cheap now.

With the factor base and relation data file available, is is time to perform NFS postprocessing.However, for larger jobs or for any job where data has to be moved from machine to machine, it is probably necessary to divide the postprocessing into its three fundamental tasks. These are described below:

NFS Filtering
-------------

The first phase of NFS postprocessing is the filtering step. This analyzes the input relation file, sets up the rest of the filtering to ignore relations  that will not be useful (usually 90% of them or more), and produces  a 'cycle file' that describes the huge matrix to be used in the next  postprocessing stage.

To do that, every relation is assigned a unique number, corresponding to its line number in the relation file. Relations are numbered starting from zero, and part of the filtering also adds 'free relations' to the dataset. Free relations are so-called because it does not require any sieving to find them; these are a unique feature of the number field sieve, although there will never be very many of them. Filtering is a very complex process. If you do not have enough relations for filtering to succeed, no output  is produced other than complaints to that effect. If there are 'enough'  relations for filtering to succeed, the result is a 'cycle file'.

How many relations is 'enough'? This is unfortunately another hard question, and answering it requires either compiling large tables of factorizations of similar size numbers, running the filtering over and over again, or  performing simulations after a little test-sieving. There's no harm in  finding more relations than you strictly need for filtering to work at  all, although if you mess up and find twice as many relations as you need  then getting the filtering to work can also be difficult. In general the  filtering works better if you give it somewhat more relations than it stricly needs, maybe 10% more. As more and more relations are added, the size of the generated matrix becomes smaller and smaller, partly because the filtering can throw away more and more relations to keep only the 'best' ones.

NFS Linear Algebra
------------------

The linear algebra step constructs the matrix that was generated from the filtering, and finds a group of vectors that lie in the nullspace of that matrix. Finding nullspace vectors for a really big matrix is an enormous amount of work. To do the job, Msieve uses the block Lanczos algorithm with a large number of performance optimizations. Even with fast code like that, solving the matrix can take anywhere from a few minutes (factoring a 100-digit input leads to a matrix of size ~200000) to several months  (using the special number field sieve on 280-digit numbers from the  Cunningham Project usually leads to matrices of size ~18 million). Even worse, the answer has to be *exactly* correct all the way through; there's no throwing away intermediate results that are bad, like the other NFS phases can do. So solving a big matrix is a severe test of both your computer and your patience.

Multithreaded Linear Algebra
----------------------------

The linear algebra is fully multithread aware. Note that the solver is primarily memory bound, and using as many threads as you have cores on your multicore processor will probably not give the best performance. The best number of threads to use depends on the underlying machine; more recent processors have much more powerful memory controllers and can continue speeding up as more and more threads are used. A good rule of thumb to start off is to try two threads for each physical package on your motherboard; even if it's not the fastest choice, just two or four threads gets the vast majority of the potential speedup for the vast majority of machines.

Finally, note that the matrix solver is a 'tightly parallel' computation, which means if you give it four threads then the machine those four threads run on must be mostly idle otherwise. The linear algebra will soak up most of the memory bandwidth your machine has, so if you divert any of it away to something else then the completion time for the linear algebra will suffer.

As for memory use, solving the matrix for a 512-bit input is going to  require around 2GB of memory in the solver, and a fast modern processor running  the solver with four threads will need about 36 hours. A slow, less modern processor that is busy with other stuff could take up to a week!

NFS Square Root
---------------

With the solution file from the linear algebra in hand, the last phase of  NFS postprocessing is the square root.
'an NFS square root' is actually two square roots, an easy one over the integers and a very complex one over the algebraic number field described by the NFS polynomial we selected. Traditionally, the best algorithm for the algebraic part of the NFS square root is the one described by Montgomery and Nguyen, but that takes some quite sophisticated algebraic number theory smarts.
Every solution generated by the linear algebra is called 'a dependency', because it is a linearly dependent vector for the matrix we built.
The square root in Msieve proceeds one dependency at a time; it requires all the relations from the data file, the cycle file from the filtering, and the dependency file from the linear algebra. Technically the square root can be speed up if you process multiple dependencies in parallel, but doing one at a time makes it possible to adapt the precision of the numbers used to save a great deal of memory toward the end of each dependency.
Each dependency has a 50% chance of finding a nontrivial factorization of the input.

msieve is the client used for post-processing phase

Carlos Pinho

  • Messages: 98
  • Boinc'eur Junior
  • **
NFS@Home Project Goals
« Réponse #72 le: 14 décembre 2012 à 18:05 »
Factoring an integer using NFS has 3 main steps:

1. Select Polynomial

External to NFS@Home project. If number is GNFS then polynomial search is necessary using GPU or CPU.

2. Collect Relations via Sieving

Made via NFS@Home, only CPU sievers available.

3. Combine Relations

Done by NFS@Home in part, the relations obtained by sieving effort are stored on NFS@Home server. The post-processing phase is done or by external members or in clusters to take advantage of Multithreaded Linear Algebra phase. The latter can be done by using msieve MPI.

Carlos Pinho

  • Messages: 98
  • Boinc'eur Junior
  • **
Re : NFS@Home
« Réponse #73 le: 14 décembre 2012 à 18:06 »
Hi there! Sorry for posting in English.

I think with my five previously post you can get to know very well what NFS@Home does.
Now to the challenge numbers and figures:

To get the most credits you should run the 16e (lasievef) or 16e V5 (lasieve5f) applications. These applications are sieving a number called 2,1037-. For linux users with more than 1.2GB per thread set

lasieved - app for RSALS subproject, uses less than 0.5 GB memory: no
lasievee - work nearly always available, uses up to 0.5 GB memory: no
lasievef - used for huge factorizations, uses up to 1 GB memory: no
lasieve5f - used for huge factorizations, uses up to 1 GB memory: yes

in "http://escatter11.fullerton.edu/nfs/prefs.php?subset=project".

For windows users set "yes" instead or "no" for "lasievef". 1.35 GB per thread is needed to run "lasievef" application. If you don't have it chose lasievee or lasieved application. lasieve5f is not available for windows OS.

In terms of points per application the situation is like this:

lasieved - 36 points per wu
lasievee - 44 points per wu
lasievef - 65 points per wu
lasieve5f - 65 points per wu

In global settings at "http://escatter11.fullerton.edu/nfs/prefs.php?subset=global" set

Swap space: use at most:  98% of total
Memory: when computer is in use, use at most: 100% of total
Memory: when computer is not in use, use at most: 100% of total


Carlos Pinho

PS( Windows users with more than 2GB/thread of memory with Ubuntu x64 installed under Virtual Box will get the most of it instead of only running NFS@Home under Windows environment)
« Modifié: 14 décembre 2012 à 18:08 par Carlos Pinho »

Carlos Pinho

  • Messages: 98
  • Boinc'eur Junior
  • **
Re : NFS@Home
« Réponse #74 le: 14 décembre 2012 à 18:07 »
Any doubts please ask me.
Thank you for the cores added to the challenge but I was hoping for more from L'Alliance Francophone.  Let's try to finish 2,1037- sieve until the end of the year.

Best regards,

Carlos Pinho
(Post-processing helper of NFS@Home Boinc Project)

Edit: Anyway, those long five posts have important information. The BOINC client is only doing the second stage of the factoring process. After BOINC sieves 2,1037- integer the wu's are gathered in a file called relations. This file is then put on big cluster with a university granted to be processed in parallel. Can't be via BOINC. I'm talking about being processed on a 512 core cluster during 15 days in a row.
« Modifié: 14 décembre 2012 à 18:09 par Carlos Pinho »