Small n factoring

[Mystwalker]

This guide should help you.
The versions of the programs have changed to GMP 4.2.1 and ECM 6.1, though. In addition, ECM 6.1.1 will be out "soon", so maybe you want to wait. On the other hand, it's not that hard to compile a new version once you're familiar with the process...

Unfortunately, I have no AMD64-equipped PC, so I can't provide you with optimized binaries...

[Keroberts1]

ok i have it installed but what do i do when running it i selected run from the start menu and found the directory to run it from but i can't remember the format to give the inputs with. once again any help is appreciated

[Keroberts1]

qnyone all I need is the command format for calling the program I know the first is the B1 bounds thats all I'm sure about

[Mystwalker]

Sorry for my late answer - I must have overlooked your question.
It should be somewhere in this thread.
Try

echo 21181*2^^^^1148+1 | ecm.exe -c 100 -n 11e6 > result.txt

This should run 100 curves with B1=11M and the default B2 on 21181^2*1148+1.

[Keroberts1]

yeh i figured it out last night but how many curves do i need?

[Mystwalker]

When you add the "-v" parameter, you can see it. Just look at the 45 digit value.

[hhh]

I just encountered the following strange behaviour with mprime:

I put into the worktodo.ini the following line:

Pminus1=168451,2,1116,1,4294967295,4294967295,0

This should p-1 the number 168451*2^1116+1 with the maximal bounds of B1=B2=4294967295=2^32-1. (This is from PSP)

I gave mprime 300 or 400MB RAM.
The program starts factoring, but once at 100%, it immediately restarts at 0%, with the same number, without doing the GCD or what it is called.

Not enough memory? Other ideas?

H.