mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 5 of 5
Search took 0.01 seconds.
Search: Posts Made By: paulunderwood
Forum: GpuOwl 2020-01-05, 18:12
Replies: 22
Views: 6,492
Posted By paulunderwood
WIll it build for a Linux Radeon VII? Have...

WIll it build for a Linux Radeon VII?

Have you checked Ryan's two PRPs? If so how long did each take? How does that compared to a CPU?

How does one select "fft"?

Is there a coordinated...
Forum: GpuOwl 2019-12-11, 01:55
Replies: 22
Views: 6,492
Posted By paulunderwood
@George Woltman. How hard is to write a modulo...

@George Woltman. How hard is to write a modulo for 2^p+1 as well as 2^p-1? Is it something the average programmer can do with gpuowl.cl? :unsure:
Forum: GpuOwl 2019-12-01, 02:10
Replies: 22
Views: 6,492
Posted By paulunderwood
In your "data" section you should have: ...

In your "data" section you should have:

w2=vector(N, i, exp(I*Pi*(i-1)/N)); \\ weight for negacyclic

i.e. no "-", HTH,
Forum: GpuOwl 2019-11-22, 16:29
Replies: 22
Views: 6,492
Posted By paulunderwood
Now we need someone competent to fork the source...

Now we need someone competent to fork the source code :smile:

I for one would run Wagstaff.
Forum: GpuOwl 2019-07-08, 20:10
Replies: 22
Views: 6,492
Posted By paulunderwood
:goodposting: Working mod 2^p+1 is almost as...

:goodposting:

Working mod 2^p+1 is almost as easy as 2^p-1. Then a final division by 3 to get mod (2^p+1)/3. E.g:


p=127;Mod(3,2^p+1)^2^p
Mod(9, 170141183460469231731687303715884105729)

...
Showing results 1 to 5 of 5

 
All times are UTC. The time now is 10:49.

Fri Mar 5 10:49:57 UTC 2021 up 92 days, 7:01, 0 users, load averages: 2.10, 1.94, 1.86

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.