![]() |
![]() |
#1 |
Jun 2012
F0216 Posts |
![]()
A list of the fastest sieving composites remaining in the project. List is sorted by increasing ETA, ranging from 1-3 weeks on an older i7 Windows machine. Suggested polys attached (or build your own). Some low hanging fruit - eat up!
C182_124_110 (reserved) C179_125_59 (reserved) C187_125_61 (reserved) C179_140_37 (factored) C192_125_58 (reserved) C200_127_55 (reserved) C218_137_42 (reserved) C191_134_45 (reserved) C208_143_36 (factored) C212_121_69 (reserved) C194_132_86 (reserved) C192_130_49 (reserved) C186_145_34 (factored) C202_138_41 (reserved) C185_131_51 (reserved) C208_139_42 (factored) C214_121_71 (reserved) C173_136_43 (reserved) C171_133_48 (reserved) C172_145_36 (factored) Last fiddled with by XYYXF on 2016-04-24 at 12:08 Reason: changed status of some numbers |
![]() |
![]() |
![]() |
#2 |
"Norbert"
Jul 2014
Budapest
22·31 Posts |
![]()
How can I use this .job files in msieve, to do snfs sieving?
msieve -ns, what parameter?, file name and format for the polynomial? |
![]() |
![]() |
![]() |
#3 |
(loop (#_fork))
Feb 2006
Cambridge, England
2×7×461 Posts |
![]()
msieve is not the right tool for snfs sieving; the files are in the right format for gnfs-lasieve4I14e.
|
![]() |
![]() |
![]() |
#4 |
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
1C3516 Posts |
![]()
As far as I know, swellman uses Yafu to generate the polys, and Yafu can automate the rest of the factoring as well (rather than manually fiddling with gnfs-lasieve and then msieve).
|
![]() |
![]() |
![]() |
#5 | |
Jun 2012
2·17·113 Posts |
![]() Quote:
If you decide to use YAFU, just remember to rename the .job file of interest to nfs.job and make sure it's in the same directory as the YAFU executable. The command syntax for sieving n on the rational side is Code:
yafu "nfs(n)" -v -r -R -ns x,y I often run a small interval of spec_q of 2000, just to make sure everything is working as it should. Then run the command again with no -ns x,y flag and YAFU will run the job from the last spec_q until sieving is complete, then automatically go through the entire NFS process until factors are found. |
|
![]() |
![]() |
![]() |
#6 | |
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
3·29·83 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Conjectures with one k remaining | rogue | Conjectures 'R Us | 109 | 2017-04-29 01:28 |
5 easy pieces for davieddy | NBtarheel_33 | PrimeNet | 28 | 2012-07-28 15:26 |
Easiest Remaining Cunninghams | R.D. Silverman | Factoring | 1 | 2008-03-12 03:34 |
4 not so easy pieces? | Uncwilly | Puzzles | 35 | 2006-11-15 01:07 |
distribution of remaining candidates | thommy | 3*2^n-1 Search | 41 | 2004-04-11 22:05 |