20191021, 15:26  #1 
Random Account
Aug 2009
19·101 Posts 
Just a few problems.
Learning YAFU has been an ongoing learning project.
So, if I run this: Code:
yafu.exe "nfs(2^22731)" v Code:
10/21/19 11:11:33 v1.35beta @ DESKTOPCBJIQ5R, System/Build Info: Using GMPECM 7.0.4, Powered by GMP 6.1.2 detected Intel(R) Core(TM) i77700 CPU @ 3.60GHz detected L1 = 32768 bytes, L2 = 8388608 bytes, CL = 64 bytes measured cpu frequency ~= 3633.658040 using 1 random witnesses for RabinMiller PRP checks =============================================================== ======= Welcome to YAFU (Yet Another Factoring Utility) ======= ======= bbuhrow@gmail.com ======= ======= Type help at any time, or quit to quit ======= =============================================================== cached 78498 primes. pmax = 999983 >> nfs: checking for job file  job file found, testing for matching input nfs: number in job file matches input nfs: checking for data file nfs: no data file found nfs: commencing nfs on c685: 1742529520249056365512311353133210194868002470362733988718715702982049553878204974098095879957046832133411116918454362118733432444115935018714466786957605746348649192788820800696196515419189104683104957187774528626675040280292359797245618173808073285037449211441338460459359488199888816259777611053192701961659180955402379577469159828320928237838306141193366024320020020406550115646199896773300050762697536767502815384675215990944010597050121839365705495260405711680625463166940749616744059475821932476870841353759757688198160654803105173484222505416851352655856542995917645077182797114155482006005394666665993761527547105656127708028861905978284863688229753943906920953645204758331391 nfs: resumesieve; last_spq = 0, nfs_phases = 0 nfs: parsed lpbr = 26, lpba = 26 nfs: creating ggnfs job parameters for input of size 685 Error: m is not a common root of the polynomials: c0: 135941441485299623821377975 c1: 18442770087320538690649 c2: 1144416907608563521 c3: 42817211718353 c4: 347973258 c5: 16632 Y0: 1237038659848269396424 Y1: 551747168957 n: 1742529520249056365512311353133210194868002470362733988718715702982049553878204974098095879957046832133411116918454362118733432444115935018714466786957605746348649192788820800696196515419189104683104957187774528626675040280292359797245618173808073285037449211441338460459359488199888816259777611053192701961659180955402379577469159828320928237838306141193366024320020020406550115646199896773300050762697536767502815384675215990944010597050121839365705495260405711680625463166940749616744059475821932476870841353nfs: continuing with sieving  could not determine last special q; using default startq nfs: commencing algebraic side lattice sieving over range: 1600000  1920000 nfs: could not open output file, possibly bad path to siever fopen error: No such file or directory could not open rels0.dat for reading 
20191021, 15:46  #2  
Sep 2009
2^{2}×3×13^{2} Posts 
The critical message is:
Quote:
Try a few smaller numbers. Eg RSA100, RSA110, RSA120, ... Those should finish in a reasonable time. Numbers with a simple formula should be done with SNFS if possible, it's usually much faster than GNFS. Chris 

20191021, 16:22  #3 
"Ben"
Feb 2007
110101001100_{2} Posts 
I admit I am not even sure how you got as far as you did. This is what I saw:
Code:
nfs: checking for job file  job file found, testing for matching input nfs: number in job file does not match input nfs: checking for poly file  no poly file found nfs: commencing nfs on c685: 1742529520249056365512311353133210194868002470362733988718715702982049553878204974098095879957046832133411116918454362118733432444115935018714466786957605746348649192788820800696196515419189104683104957187774528626675040280292359797245618173808073285037449211441338460459359488199888816259777611053192701961659180955402379577469159828320928237838306141193366024320020020406550115646199896773300050762697536767502815384675215990944010597050121839365705495260405711680625463166940749616744059475821932476870841353759757688198160654803105173484222505416851352655856542995917645077182797114155482006005394666665993761527547105656127708028861905978284863688229753943906920953645204758331391 nfs: n is too large for snfs, skipping snfs poly select nfs: setting deadline of 1080000 seconds nfs: commencing polynomial search over range: 8192  8442 commencing number field sieve (338digit input) commencing number field sieve polynomial selection polynomial degree: 6 max stage 1 norm: 0.00e+000 max stage 2 norm: 0.00e+000 min Evalue: 0.00e+000 poly select deadline: 0 error: stage 1 bound not provided Anyway, try factoring something (much) smaller. 
20191021, 22:25  #4  
Random Account
Aug 2009
19·101 Posts 
Quote:
Either way, this was all simply an experiment on my part and perhaps the chance of learning something new. It was really not all that important. Thank you for the replies. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
What problems are detected  MrAskew  Information & Answers  1  20100924 13:48 
PC problems  Nimras  Information & Answers  6  20091215 21:24 
Readline problems  CRGreathouse  Software  11  20090707 05:18 
Need help with few problems  Laserjet  Hardware  1  20071013 10:59 
Two problems  gribozavr  Puzzles  11  20070205 05:46 