What size numbers are you testing with ECM?

[henryzz]

Do they need to be B1 power-smooth or something similar? Maybe there is a limit on exponent?

What language is that code? If it is python 2 then I have a few things undefined starting with ZZ.

What tweaks would be needed to the code for the other parameterizations? Non-gpu code uses parameterization 1 currently I think.

[SethTro]

Originally Posted by henryzz

Do they need to be B1 power-smooth or something similar? Maybe there is a limit on exponent?

What language is that code? If it is python 2 then I have a few things undefined starting with ZZ.

What tweaks would be needed to the code for the other parameterizations? Non-gpu code uses parameterization 1 currently I think.

Yes they need to be B1 power-smooth.

The code is sage.

Heres' the parameterization for param0, given by paul zimmerman in https://homepages.cwi.nl/~herman/Zimmermann.pdf

def GroupOrderParam0(p, sigma):
    K = GF(p)
    v = (4*sigma) * K.gen()
    u = (sigma^2 - 5) * K.gen()
    x = u^3
    b = 4*x*v
    a = (v-u)^3*(3*u+v)
    A = a/b-2
    x = x/v^3
    b = x^3 + A*x^2 + x
    return factor(EllipticCurve([0,b*A,0,b^2,0]).order())

[Nooks]

GPU-enabled ECM has been very useful as I work my way through https://stdkmd.net/nrr/3/37771.htm ; being able to bring that to bear on composites of more than 300 digits would be quite helpful.

[EdH]

Originally Posted by chris2be8

. . .
Of course being able to do QS (or even better lattice sieving) on a GPU would be *very* nice.
. . .

Have you seen my thread on GPU-GLS?

There are no instructions for use, but some hints were provided in the thread and the source code has some further command info. I got a little ways playing with it using Colab, but haven't pursued much further?

[chris2be8]

GPU-GLS would be nice, but the slowest step in the size range I'm working on is sieving. And has anyone actually got it working?

Chris

[SethTro]

I finished a script to generate random primes and verify the results from GPU
https://github.com/sethtroisi/gmp-ecm/pull/1

The end result is that changing ECM_GPU_NB_DIGITS doesn't seem to change first stage results (this could have maybe been more easily verified by just generating two save files and comparing but what you gonna do).

[SethTro]

Originally Posted by VBCurtis

Start around post 160 of the GPU-ECM thread:

https://mersenneforum.org/showthread.php?t=16480&page=4

I found that this can causes bad results

make clean
make
# Modify ECM_GPU_NB_DIGITS
make # without make clean
run_tests.sh

maybe a quick self-check at startup would be good.

[storm5510]

The last time I checked, the GPU ceiling for GMP-ECM was something like 2^1018, or similar. I stopped using GMP-ECM completely because its results format was not compatible with the Primenet server. Simply put, there was no way to submit results.

As for ECM's themselves, I keep them low by leaving the RAM settings in Prime95 at their defaults. The largest I ever see is less then 2^50000. I hammered on the infamous M1277 for about a month. I ran stage 1 on Prime95 and stage 2 on GMP-ECM.

[chris2be8]

I've managed to get ecm gpu using 512 bits working (ecm-gpu.orig contains ecm as downloaded):

chris@sirius:~$ cp -rp ecm-gpu.orig ecm-gpu.512
chris@sirius:~$ cd ecm-gpu.512/trunk/
chris@sirius:~/ecm-gpu.512/trunk$ vi ecm-gpu.h
chris@sirius:~/ecm-gpu.512/trunk$ diff ecm-gpu.h ~/ecm-gpu/trunk/ecm-gpu.h 
11c11
<   #define ECM_GPU_NB_DIGITS 16 //by default
---
>   #define ECM_GPU_NB_DIGITS 32 //by default
chris@sirius:~/ecm-gpu.512/trunk$ autoreconf -si 
chris@sirius:~/ecm-gpu.512/trunk$ ./configure --enable-gpu=sm30
chris@sirius:~/ecm-gpu.512/trunk$ make

make check produced errors though, due to trying to process numbers over 506 bits. I managed to patch test.gpuecm to bypass them so it seems to work. But I can't be sure that fully tested it.

And it's about 3 times faster:

chris@sirius:~/ecm-gpu.512/trunk$ time /home/chris/ecm-gpu.512/trunk/ecm -gpu -save test512.save 25e4 1 <c124
GMP-ECM 7.0.5-dev [configured with GMP 6.1.2, --enable-asm-redc, --enable-gpu, --enable-assert] [ECM]
Input number is 2088670024556113224297109395369395183779876369517763563228422726095769254537691675467317948724772159382494596201511204381801 (124 digits)
Using B1=250000, B2=1, sigma=3:1464808619-3:1464809002 (384 curves)
GPU: Block: 16x32x1 Grid: 12x1x1 (384 parallel curves)
Computing 384 Step 1 took 1701ms of CPU time / 19927ms of GPU time

real	0m20.098s
user	0m1.730s
sys	0m0.446s

chris@sirius:~/ecm-gpu.512/trunk$ time /home/chris/ecm-gpu/trunk/ecm -gpu -save test1024.save 25e4 1 <c124
GMP-ECM 7.0.5-dev [configured with GMP 6.1.2, --enable-asm-redc, --enable-gpu, --enable-assert] [ECM]
Input number is 2088670024556113224297109395369395183779876369517763563228422726095769254537691675467317948724772159382494596201511204381801 (124 digits)
Using B1=250000, B2=1, sigma=3:209052271-3:209052654 (384 curves)
GPU: Block: 32x32x1 Grid: 12x1x1 (384 parallel curves)
Computing 384 Step 1 took 2159ms of CPU time / 68460ms of GPU time

real	1m8.670s
user	0m2.179s
sys	0m0.660s

My text step will be to process some numbers under 506 bits and see how many factors it finds. That's the real test.

Chris

[SethTro]

If you check the SVN repo I added check_gpuecm.sage which tests finding primes vs theoretical results (it generates a bunch of small primes that can be found with B1=x, then checks that they get found correctly)
I'm on mobile but can write more later