mersenneforum.org  

Go Back   mersenneforum.org > Search Forums
Reload this Page Search Results
Register FAQ Search Today's Posts Mark Forums Read

Page 1 of 4 1 234
Showing results 1 to 25 of 99
Search took 0.02 seconds. Search: Posts Made By: Trilo
Forum: Software 2020-12-03, 22:29
Replies: 171
Views: 27,052
Posted By Trilo
Multithreaded LLR on prpnet

Hi, is there anyway to run multithreaded LLR instances using prpnet? I tried adding ThreadsPerTest=1 in llr.ini but it appears that prpnet rewrites the file upon bootup and the changes do not get...
Forum: No Prime Left Behind 2020-11-20, 17:08
Replies: 1,490
Views: 172,675
Posted By Trilo
471*2^1604233-1 is prime! (482925 digits)

471*2^1604233-1 is prime! (482925 digits)
Forum: Hardware 2020-11-03, 17:43
Replies: 28
Views: 2,451
Posted By Trilo
Thank you, this is what I originally figured. So...

Thank you, this is what I originally figured. So I'm correct in assuming the discussion about ram is only relevant because the fft is too large to fit into L3 cache for GIMPS?

If so then it seems...
Forum: Hardware 2020-11-03, 14:13
Replies: 28
Views: 2,451
Posted By Trilo
The threadripper 3960x has 128MB of L3 cache and...

The threadripper 3960x has 128MB of L3 cache and 24 cores= 5.1MB L3/core. I've heard that a rough estimate of how much an LLR test takes in memory is anywhere from 6 to 12* fftlen. So I should be...
Forum: And now for something completely different 2020-10-28, 00:36
Replies: 5
Views: 743
Posted By Trilo
Continuing Woodall-Williams from b=12000.

Continuing Woodall-Williams from b=12000.
Forum: Hardware 2019-12-26, 21:17
Replies: 46
Views: 8,410
Posted By Trilo
Thank you for the clarification I'm new to...

Thank you for the clarification I'm new to building PC's and assumed #of DIMM sockets= #of channels.

My original basis for choosing the i5 9600k is the high gflops/core scoring based on primegrid...
Forum: Hardware 2019-12-26, 19:09
Replies: 46
Views: 8,410
Posted By Trilo
Planning a build to perform LLR tests on numbers...

Planning a build to perform LLR tests on numbers from 1.5m-5m bits. With FFT's of this size (much smaller than world record sizes), would memory bandwidth be as much of a concern? Could FFT's of this...
Forum: Riesel Prime Search 2017-08-06, 07:53
Replies: 1,955
Views: 187,016
Posted By Trilo
Since we are on the subject of consecutive large...

Since we are on the subject of consecutive large primes with small n gaps, here is a pair I found a while back:

1423*2^2179023-1
1423*2^2178363-1

The most interesting thing about this pair is...
Forum: Riesel Prime Search 2017-08-02, 15:16
Replies: 543
Views: 47,843
Posted By Trilo
1448-1452 complete, 1 prime: 2745*2^1449470-1

1448-1452 complete, 1 prime: 2745*2^1449470-1
Forum: Riesel Prime Search 2017-07-27, 06:26
Replies: 482
Views: 40,771
Posted By Trilo
1324k-1332k complete, 1 prime

1324k-1332k complete, 1 prime
Forum: Riesel Prime Search 2017-07-27, 04:57
Replies: 1,955
Views: 187,016
Posted By Trilo
9075*2^1331605-1 is prime! (400,858 digits)

9075*2^1331605-1 is prime! (400,858 digits)
Forum: Riesel Prime Search 2017-07-27, 01:43
Replies: 1,000
Views: 114,359
Posted By Trilo
unreserving k=195 at n= 2.03M reserving k=...

unreserving k=195 at n= 2.03M

reserving k= 55, 59 and 75
Forum: Riesel Prime Search 2017-07-26, 21:20
Replies: 543
Views: 47,843
Posted By Trilo
1575-1585 complete, 2955*2^1582609-1 is prime. ...

1575-1585 complete, 2955*2^1582609-1 is prime.

1448-1552 soon to be done.
Forum: Riesel Prime Search 2017-07-26, 14:06
Replies: 1,955
Views: 187,016
Posted By Trilo
2955*2^1582609-1 is prime (476417 digits)

2955*2^1582609-1 is prime (476417 digits)
Forum: Riesel Prime Search 2017-07-24, 13:15
Replies: 1,955
Views: 187,016
Posted By Trilo
2745*2^1449470-1 (436338 digits)

2745*2^1449470-1 (436338 digits)
Forum: Riesel Prime Search 2017-07-16, 15:22
Replies: 543
Views: 47,843
Posted By Trilo
1452-1456k complete no primes. Reserving 1575-1585

1452-1456k complete no primes. Reserving 1575-1585
Forum: Riesel Prime Search 2017-06-21, 20:46
Replies: 482
Views: 40,771
Posted By Trilo
reserving 1324-1332k

reserving 1324-1332k
Forum: Riesel Prime Search 2016-06-23, 00:29
Replies: 543
Views: 47,843
Posted By Trilo
reserving 1452-1456

reserving 1452-1456
Forum: Riesel Prime Search 2016-06-19, 03:22
Replies: 1,000
Views: 114,359
Posted By Trilo
k=195 at n=2.03M

k=195 at n=2.03M
Forum: Riesel Prime Search 2016-06-18, 23:10
Replies: 543
Views: 47,843
Posted By Trilo
Reserving 1448-1452. I should have more regular...

Reserving 1448-1452. I should have more regular access to the computer and should get this completed much faster.
Forum: Riesel Prime Search 2016-06-18, 23:09
Replies: 543
Views: 47,843
Posted By Trilo
1444-1448 complete, no primes

1444-1448 complete, no primes
Forum: Riesel Prime Search 2015-10-23, 19:57
Replies: 1,955
Views: 187,016
Posted By Trilo
1423*22178363- 1 is prime (655,756 digits) ...

1423*22178363- 1 is prime (655,756 digits)
1423*22179023- 1 is prime (655,955 digits)

Very interesting small gap between the 2 primes with n so large. k=1423 also has a very low nash weight of...
Forum: Riesel Prime Search 2015-10-06, 03:01
Replies: 543
Views: 47,843
Posted By Trilo
This should be changed to complete. I have...

This should be changed to complete. I have submitted the Iresults in an earlier message.
Forum: Riesel Prime Search 2015-09-28, 03:34
Replies: 543
Views: 47,843
Posted By Trilo
Also reserving 1446k-1448k

Also reserving 1446k-1448k
Forum: Riesel Prime Search 2015-09-27, 23:20
Replies: 7
Views: 1,710
Posted By Trilo
I would like to reserve 1423 on to 3M, and have...

I would like to reserve 1423 on to 3M, and have started testing.
Showing results 1 to 25 of 99
Page 1 of 4 1 234

 
All times are UTC. The time now is 13:39.

Sun Jan 17 13:39:23 UTC 2021 up 45 days, 9:50, 0 users, load averages: 2.10, 2.30, 2.27

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.