Posts by Aurel
log in
1) Message boards : Number crunching : Overall project progress? (Message 4081)
Posted 1 Jan 2018 by Profile Aurel
Sorry guys, but there is not gonna come a version 0.1 or any complete version of the overall project progress. More information can be found at the CRUS forum on

Can be found here
2) Message boards : Number crunching : Sieving (Message 4077)
Posted 31 Dec 2017 by Profile Aurel
On the yoyo forum is a message that there was a error in the input files.

So you may want to have an other try.

Yep, that was me stating that. This error was only for 2 runs because the files had an non-increasing n-value due to an error by creating the input file.

@Vaughan You should now get wu´s without errors. ;)

Anway: Happy new YEAR. (soon.)
3) Message boards : Number crunching : S1027 in TOP5000 (Message 4024)
Posted 1 Dec 2017 by Profile Aurel
I took this method of calculating number of digits from submission page of PRP Top by Lifchitz

It should be possible to write an script to check at which n-value Top5000 primes are "available" using the gp-code I noted.
IF I have spare time, I´ll bring a list of it either in mersenneforum or here.
4) Message boards : Number crunching : S1027 in TOP5000 (Message 4022)
Posted 30 Nov 2017 by Profile Aurel
You can also check this with PARI/GP

gp > length(Str(75744*1027^137435+1))
5) Message boards : Number crunching : My RAC is getting killed from all these WU gaps (Message 4019)
Posted 28 Nov 2017 by Profile Aurel
I may abandon this project altogether

Sorry to hear that.
I´m alone sieving for this project since over 1 year, sometimes someone else is able so sieve an base aswell.
It´s a lot of work done my hand and scripts and its also expensive. I´m owning 3 dedicated servers only for sieving. (even if I dont have enough money to pay the monthly costs. :/ )
2 of three will end 12/2017.

Since sieving can be also done on yoyo@home for this project, it might be interesting for you to check it out.
You can also check You can find all infos how you can sieve a base in order to generate work for this project there. You can also send me a message there.
6) Message boards : Number crunching : Overall project progress? (Message 3866)
Posted 29 Sep 2017 by Profile Aurel
Yes, it is a little time consuming but mostly because srbsieve has to write the files that can be accurately determined without running all that many ranges - like it is for the trivial factors. But yes, a total sum of GFN and MOB will come, but it will be a few updates into the future - I do however expect to have all the Trivial factors counted under assumption that the Trivial pattern actually persists, when we see version 0.1 of these stats. Most of the work that involves srbsieve, can be automatized, but I still need to create ~100000 srbsieve.ini files. Thanks to predicting the correct amount of trivial factors for R280 and R15, I've been able to already remove approximately 197,000,000,000,000 (197 Trillion) k's that has up until now been part of the progress calculation.

Thanks for your feedback :)

I would like to help you, but I´m working on an own project related CRUS project.
(Will you guess it?) :)
7) Message boards : Number crunching : Overall project progress? (Message 3859)
Posted 28 Sep 2017 by Profile Aurel
Something like sum of Trivial (same for GFN and MOB) seems to be, ehm, very time consuming.

The good think is: We will get a very detailed status about not-primed-k´s!
8) Message boards : Number crunching : Overall project progress? (Message 3532)
Posted 29 May 2017 by Profile Aurel
KEP, no update last month. :( Maybe next month?
9) Message boards : News : base R523 proven (Message 3490)
Posted 9 May 2017 by Profile Aurel
On 5th of May, ERBrouwer, a member of the team Dutch Power Cows found the last prime for base R523.
The prime 126*523^222906-1 has 605973 digits and entered the TOP5000 in Chris Caldwell's The Largest Known Primes Database. The base is now proven.

Keep it up!

Congrats, ERBrouwer.
10) Message boards : Cafe : Solve a base (Message 3470)
Posted 1 May 2017 by Profile Aurel
If you have still questions about it, here is a detailed description:

srbase aims to prove the Riesel and Sierpinski-Bases (b) up to 1030.
This will give the following form: k*b^n+/-1 [Riesel -1/Sierp +1]

The k can be calculated with the "conjectured k (=Riesel/Sierpinski-Number)", that means an combination from k and b and n will never create a prime. Example: Rieselbase 9

conjectured k: 74
->Every n-value for 74*9^n-1 will give you an composite number.

The question is: Is the conjectured k the smallest Rieselnumber?

To prove that theorem we need to find primes for every k.
Notice: For odd bases you need even k´s and for even bases odd k´s. Example: R1019

ck: 4
k remain:2
->There is no prime n<400K, but maybe n>400K.

You can find detailed stats there:
11) Message boards : Number crunching : Need to reset a user Password (Message 3105)
Posted 4 Dec 2016 by Profile Aurel
How can I have a users password reset?

In your account informations change PW.

You´ll need to be loged-in. ;)
12) Message boards : Number crunching : Overall project progress? (Message 3052)
Posted 17 Nov 2016 by Profile Aurel
Yes we really have a lot of work left. We really need the 1000 core computers that has been talked about for years. Once that day come - the day of the 1000 core computer - at layman prices then we will really start to see some progress being made. However I expect at the next update, that we will see a jump of about ~4 billion k's, due to completion of my Sierpinski base 3 range :)

This brings me to a final note. If we really wanna see the progress bar jump, we need more people starting up untested ranges and untested bases. Most k's are removed for n<=25000, however those k's are also unmentionable except when completing the proof that the conjectured k is actually the smallest k possible for wich no prime excist for any n, since n<=25000 is very far even for the highest bases from Top5000 territory. So as Gary mentioned it a long time ago. Searching for n<=25000 and starting new ranges is not for the faint of heart, since there is no chance of a Top5000 prime :)

Just wanted to add an interessing point. Lets take a look at R280. We have an CK from 513 Trillion, most work is there (it´s the highest CK I noticed). Before we can test for primes we need to sieve. The p-value is low, but even that will take weeks on an high-end CPU due the amount of k´s.
It would be great to port sieving to BOINC, but I´m not sure if we have an time advantage.
Just think about some Sierp bases. More than >100k on n=100K, thats so much work. :)
Luckily sr(n)sieve has MT on linux. My new servers are hungry.

About Top5000: Just create other bases, R108755 seems to be fine, maybe Top5000 @n=50K. ;)
13) Message boards : Number crunching : Overall project progress? (Message 3021)
Posted 4 Nov 2016 by Profile Aurel
1000 core computer. xDD But, how about GPU´s? My TITAN X is not very busy.

About the untested ranges and bases. If I´m done with my two Riesel bases (R640 and R602) I´ll start an new base.
(Sadly all data have been destroyed by an fire a few weeks ago, I just restarted the computings. 2 out of 67 k´s primed, still 212K numbers to check. :( If someone wanna help, PM me!)
14) Message boards : Cafe : Science talk (Message 2417)
Posted 11 Mar 2016 by Profile Aurel
Dear contributors,

let´s make an little bit small talk about science. Any topic is allowed, feel free to join us here. :)

My main topics are Math (proving goldbachs conjecture; own programm working on an dedicated server), chemestry and physics (atomphysics, astronomy, high energy physics)

Personal about me: I´m mechanic and I´m working for an company in NPP´s, coal plants, chemical parks and high technology centres. If I earned enough money I´ll study physics. My goal is to work at the ITER-project.

Main page · Your account · Message boards

Copyright © 2014-2021 BOINC Confederation / rebirther