mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Software

Reply
 
Thread Tools
Old 2006-11-23, 19:35   #1
Random_zh
 
Nov 2006

216 Posts
Default (may be) stupid idea for speed of mersenne-LLT

Hi all. I have an idea how to may be speed or slow down LL test. I just dont know how FFT multiplication behaves with even larger numbers.

you could test 2 or more numbers at same time:

example for the iterations with 3 exponents p,q,r:
S(0) = 4
S(n+1) = S(n)^2-2 mod (2^p-1 * 2^q-1 * 2^p-1)
test p,q,r like always:
S(p-2) mod (2^p-1)
S(q-2) mod (2^q-1)
S(r-2) mod (2^r-1)

hmm i guess it will cost more time with larger numbers, but since i'm not sure... :)
Random_zh is offline   Reply With Quote
Old 2006-11-24, 08:25   #2
akruppa
 
akruppa's Avatar
 
"Nancy"
Aug 2002
Alexandria

9A316 Posts
Default

It would be slower. The time for doing a multiplication grows faster than the size of the input number, O(n log(n) loglog(n)) for FFT multiplication, so testing two numbers at once would take more than twice as long as testing a single one. Also, the DWT will probably not work.

Alex
akruppa is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Windows 10 in Ubuntu, good idea, bad idea, or...? jasong jasong 8 2017-04-07 00:23
Stupid Windows.... petrw1 Hardware 11 2013-01-16 02:45
stupid mersenne game firejuggler Lounge 9 2011-02-20 22:07
Whose bright idea was this stupid feature? jasong Forum Feedback 20 2007-10-20 21:27
Adding RAM with different clock speed(bad idea?) jasong Hardware 8 2006-10-25 10:05

All times are UTC. The time now is 16:24.

Tue Apr 13 16:24:19 UTC 2021 up 5 days, 11:05, 1 user, load averages: 5.06, 4.73, 3.93

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.