Quote Originally Posted by pinhodecarlos View Post
Applications available (sievers available) from http://escatter11.fullerton.edu/nfs/...ubset=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

Credit per wu?

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

Why the difference in credits?

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.

Great to have you here Carlos and thank you for joining us.

Great info on this project. One question, how long does it take to complete a work unit from the different projects on an I7? If you have that data available, if not I'll crunch some and post it.

If you can post this in the NFS forum we'll make it a Sticky for all to view and understand.