Commits
boinc-version
Could not load branches
Nothing to show
Could not load tags
Nothing to show
{{ refName }}
default
Name already in use
A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
Commits on May 7, 2017
Commits on Apr 3, 2017
Commits on Apr 2, 2017
-
-
Renamed enum Byte to ByteParams
To avoid naming conflicts with standard type "Byte"
Commits on Apr 1, 2017
-
And less memory used when processing large primes
Commits on Mar 30, 2017
Commits on Mar 14, 2017
-
-
-
- Use inverses instead of reciprocals in the second loop - Check MaximumSumOfDivisors3 only every 16th iteration - Cast NextPrimeShifts to unsigned int to avoid cdqe instruction
SChernykh committedMar 14, 2017 -
Compacted SumEstimates table, it's only 204 KB in size now and fits in L2.
Commits on Mar 13, 2017
-
-
Use inverses instead of reciprocals in the first loop, check max sum of divisors only on every 8th iteration.
-
Fixed a crash in SearchLargePrimes
SChernykh committedMar 13, 2017 -
Commits on Mar 12, 2017
-
-
Split the search range into 256 equal parts.
Commits on Mar 9, 2017
-
Optimized generation of amicable candidates
SChernykh committedMar 9, 2017
Commits on Mar 6, 2017
-
-
Forgot one line in previous commit
SChernykh committedMar 6, 2017 -
- Faster generation of amicable candidates - Better filtering in InitialCheck and InitialCheck128
SChernykh committedMar 6, 2017
Commits on Mar 5, 2017
Commits on Feb 15, 2017
-
Some combinations of /from and /to command line parameters caused the program to exit too early, skipping some ranges
Commits on Feb 5, 2017
-
Merge pull request #4 from SChernykh/master
Optimized the case when there are <= 3 factors left
-
Commits on Jan 28, 2017
Commits on Jan 22, 2017
Commits on Jan 20, 2017
-
-
-
Merge pull request #3 from SChernykh/master
Optimized CheckPair() a bit
-
Compare "p <= cubic root of n" instead of "p^3 <= n" on each iteration.
-
Compare "p <= cubic root of n" instead of "p^3 <= n" on each iteration.
-
-