[ANN][GAP] Gapcoin - Prime Gap Search - New Math Algo - CPU / GPU - Zero Premine - page 66.

BitcoinFX

legendary

Activity: 2646

Merit: 1722

https://youtu.be/DsAVx0u9Cw4 ... Dr. WHO < KLF

Good work with the latest CTR GapMiner (CPU)

Initial results for:

Sandy Bridge-E - Intel Core i7 3930K CPU @ 3.20 GHz (Factory Overclocked to 4.1 GHz on all cores) with liquid cooling. 6 Cores and 12 Threads.

~~Just running with 6 threads atm.~~

~~--shift 896 --crt crt/crt-22m-896s.txt --threads 6 --fermat-threads 1 --sieve-primes 500000~~

~~Seems to be the most 'optimal' / highest pps --shift out of the full range I tested.~~

~~pps: 2100000 / (lowest)~~

~~pps: 3500000 / (avg. approx.)~~

~~pps: 5100000 / (high)~~

Have yet to test with full optimizations etc.,

Noticed that --shift multiples of 64 always seemed to yield a higher pps average on 64-bit over --shift multiples of 32 ?

EDIT: 'tested' optimizations:

Code:

--shift 512 --crt crt/crt-22m-512s.txt --threads 8 --fermat-threads 7 --sieve-primes 10000

pps: 15,000,000 (avg. approx.)

j0nn9

full member

Activity: 177

Merit: 154

Quote from: pdazzl on July 02, 2015, 02:19:21 PM

I'm not sure the table for --ctr-bits is fixed.

Example:
If you want to generate a file for shift 384

ctr-primes = 58

ctr-bits = shift - log2(p1*p2*..*pn) - 256
...
ctr-bits = 384 - log2(58#) - 256
...
ctr-bits = 384 -64 - 256 = 64

Yet the table shows the ctr-bits set to 16 for primes=58.

It's:

ctr-bits = shift - log2(p1*p2*..*pn)
...
ctr-bits = 384 - log2(58#)
...
ctr-bits = 384 - 368 = 16

The ctr-bits in the original file were 256 bits to high.

pdazzl

newbie

Activity: 45

Merit: 0

I'm not sure the table for --ctr-bits is fixed.

Example:
If you want to generate a file for shift 384

ctr-primes = 58

ctr-bits = shift - log2(p1*p2*..*pn) - 256
...
ctr-bits = 384 - log2(58#) - 256
...
ctr-bits = 384 -64 - 256 = 64

Yet the table shows the ctr-bits set to 16 for primes=58.

pdazzl

newbie

Activity: 45

Merit: 0

This should be decent, took almost 2 days to generate:

|== ChineseSet ==|
n_primes: 62
size: 10242
n_candidates: 765
offset: 1146441612406461563657892639195504712824084356280432767521872923137076875201036 461817017569202830059679582232394065759000

pdazzl

newbie

Activity: 45

Merit: 0

Quote from: j0nn9 on June 30, 2015, 02:19:41 PM

Quote from: j0nn9 on June 26, 2015, 12:30:28 PM

CTR GapMiner Update

New Feature: Creating custom ctr files

The ctr algorithm is divided into 2 parts. The first part,
is a simple greedy algorithm which ties to find offsets
for each involved prime, so that the desired number range
has at least prime candidates as possible.

The second part is an evolutionary algorithm, which tries to improve the
results form the greedy algorithm. Therefor the greedy algorithm
will be executed several times with slightly different parameters, to produce
ctrs which differs in quality, which than can be used by the evolutionary algorithm.

The output is a text file which can be used by gapminer as an input for ctr sieving.

Parameter description:

Code:

--calc-ctr Indicates that we want to calculate a ctr file.

--ctr-strength This is used to variate the computing time spend
   within the greedy algorithm. Higher strength
   can yield better results.

--ctr-primes The number of primes to use in the ctr file. The more
   primes the better the ctr result, but the shift
   also increases. Minimum shift can be calculated as
   the binary logarithm of the product of all primes:
   log2(p1 * p2 * ... *pn).

--ctr-evolution Whether to use the evolutionary algorithm or not.

--ctr-fixed This number indicates the number of starting primes
   which wound get touched by the evolutionary algorithm
   the offsets for the primes 2,3,5,7,11... are mostly
   perfect computed by the greedy algorithm, and changing
   them only declines the result.

--ctr-ivs The number of individuals used in the evolutionary algorithm.
   More increases computing time but mostly also the
   result quality.

--ctr-range Percent deviation from the number of primes.
   Useful if you don't want to look for a specific number
   of primes.

--ctr-bits The shift value you later use for sieving has to be greater
   than log2(p1*p2*..*pn). With this flag you can fine tune a specific
   shift by setting this to shift - log2(p1*p2*..*pn).

--ctr-merit The target merit (while testing the ctr it seamed that
   sieving for target-merit - 1 yields the best results)

--ctr-file The target ctr output file. You can open this with a
   text editor. Look for the n_candidates value, the smaller
   it is the better the ctr file.

windows: https://github.com/gapcoin/GapMiner/releases/download/crt-rev5.1/windows.zip
md5: 50b506c6fdacbe36dd2d87e6f2c296d9

linux: https://github.com/gapcoin/GapMiner/releases/download/crt-rev5.1/linux.zip
md5: 88f0a3975df728566d3500b69475a78a

source code: https://github.com/gapcoin/GapMiner/

I'm sorry to inform you, that I made mistake within the example commands.
At the --ctr-bits flag you have to subtract 256 from the given value.

The links above were updated.
Any already generated ctr files can still be used, but they are targeting a 0.25 (130 primes) till 4.7 (14 primes) times greater merit.

I was wondering why a shift 1024 was taking multiple days and counting

though I had set the ivs to 10000 and the target shift to 20.

j0nn9

full member

Activity: 177

Merit: 154

Quote from: j0nn9 on June 26, 2015, 12:30:28 PM

CTR GapMiner Update

New Feature: Creating custom ctr files

The ctr algorithm is divided into 2 parts. The first part,
is a simple greedy algorithm which ties to find offsets
for each involved prime, so that the desired number range
has at least prime candidates as possible.

The second part is an evolutionary algorithm, which tries to improve the
results form the greedy algorithm. Therefor the greedy algorithm
will be executed several times with slightly different parameters, to produce
ctrs which differs in quality, which than can be used by the evolutionary algorithm.

The output is a text file which can be used by gapminer as an input for ctr sieving.

Parameter description:

Code:

--calc-ctr Indicates that we want to calculate a ctr file.

--ctr-strength This is used to variate the computing time spend
   within the greedy algorithm. Higher strength
   can yield better results.

--ctr-primes The number of primes to use in the ctr file. The more
   primes the better the ctr result, but the shift
   also increases. Minimum shift can be calculated as
   the binary logarithm of the product of all primes:
   log2(p1 * p2 * ... *pn).

--ctr-evolution Whether to use the evolutionary algorithm or not.

--ctr-fixed This number indicates the number of starting primes
   which wound get touched by the evolutionary algorithm
   the offsets for the primes 2,3,5,7,11... are mostly
   perfect computed by the greedy algorithm, and changing
   them only declines the result.

--ctr-ivs The number of individuals used in the evolutionary algorithm.
   More increases computing time but mostly also the
   result quality.

--ctr-range Percent deviation from the number of primes.
   Useful if you don't want to look for a specific number
   of primes.

--ctr-bits The shift value you later use for sieving has to be greater
   than log2(p1*p2*..*pn). With this flag you can fine tune a specific
   shift by setting this to shift - log2(p1*p2*..*pn).

--ctr-merit The target merit (while testing the ctr it seamed that
   sieving for target-merit - 1 yields the best results)

--ctr-file The target ctr output file. You can open this with a
   text editor. Look for the n_candidates value, the smaller
   it is the better the ctr file.

windows: https://github.com/gapcoin/GapMiner/releases/download/crt-rev5.1/windows.zip
md5: 50b506c6fdacbe36dd2d87e6f2c296d9

linux: https://github.com/gapcoin/GapMiner/releases/download/crt-rev5.1/linux.zip
md5: 88f0a3975df728566d3500b69475a78a

source code: https://github.com/gapcoin/GapMiner/

I'm sorry to inform you, that I made mistake within the example commands.
At the --ctr-bits flag you have to subtract 256 from the given value.

The links above were updated.
Any already generated ctr files can still be used, but they are targeting a 0.25 (130 primes) till 4.7 (14 primes) times greater merit.

j0nn9

full member

Activity: 177

Merit: 154

Quote from: agran on June 29, 2015, 01:40:36 PM

Soon I'll try to return pages on coinia.net

Thanks! That are great news!

agran

hero member

Activity: 910

Merit: 1000

Soon I'll try to return pages on coinia.net

pdazzl

newbie

Activity: 45

Merit: 0

Quote from: nskythe on June 28, 2015, 11:34:47 AM

It will be a new pool ?

nscythe, same one that has all the cpu power? If you're still mining on shift 25 you may mine faster on the higher shifts (400-600).

It's still solo mining but the second release of the chinese remainder theorem, this latest release let's you build custom crt files.

nskythe

newbie

Activity: 3

Merit: 0

It will be a new pool ?

j0nn9

full member

Activity: 177

Merit: 154

Quote from: pdazzl on June 26, 2015, 03:07:20 PM

Trying the new miner and generating a new crt file. Can you post an example command to mine after the ctr file is generated? Do we still use --sieve-primes? Is ctr-evolution used in the ctr generation and the mining command?

ctr-evolution and ctr-primes are only necessary for generating the ctr file. --sieve-primes will still be used for mining.

Mining still works the same way as in the previous ctr-miner version:

Code:

./gapminer-cpu localhost -p 31397 -u -x --shift 1024 --crt my-ctr-file.txt --threads 4 --fermat-threads 1

pdazzl

newbie

Activity: 45

Merit: 0

Trying the new miner and generating a new crt file. Can you post an example command to mine after the ctr file is generated? Do we still use --sieve-primes? Is ctr-evolution used in the ctr generation and the mining command?

j0nn9

full member

Activity: 177

Merit: 154

CTR GapMiner Update

New Feature: Creating custom ctr files

The ctr algorithm is divided into 2 parts. The first part,
is a simple greedy algorithm which ties to find offsets
for each involved prime, so that the desired number range
has at least prime candidates as possible.

The second part is an evolutionary algorithm, which tries to improve the
results form the greedy algorithm. Therefor the greedy algorithm
will be executed several times with slightly different parameters, to produce
ctrs which differs in quality, which than can be used by the evolutionary algorithm.

The output is a text file which can be used by gapminer as an input for ctr sieving.

Parameter description:

Code:

--calc-ctr Indicates that we want to calculate a ctr file.

--ctr-strength This is used to variate the computing time spend
within the greedy algorithm. Higher strength
can yield better results.

--ctr-primes The number of primes to use in the ctr file. The more
primes the better the ctr result, but the shift
also increases. Minimum shift can be calculated as
the binary logarithm of the product of all primes:
log2(p1 * p2 * ... *pn).

--ctr-evolution Whether to use the evolutionary algorithm or not.

--ctr-fixed This number indicates the number of starting primes
which wound get touched by the evolutionary algorithm
the offsets for the primes 2,3,5,7,11... are mostly
perfect computed by the greedy algorithm, and changing
them only declines the result.

--ctr-ivs The number of individuals used in the evolutionary algorithm.
More increases computing time but mostly also the
result quality.

--ctr-range Percent deviation from the number of primes.
Useful if you don't want to look for a specific number
of primes.

--ctr-bits The shift value you later use for sieving has to be greater
than log2(p1*p2*..*pn). With this flag you can fine tune a specific
shift by setting this to shift - log2(p1*p2*..*pn).

--ctr-merit The target merit (while testing the ctr it seamed that
sieving for target-merit - 1 yields the best results)

--ctr-file The target ctr output file. You can open this with a
text editor. Look for the n_candidates value, the smaller
it is the better the ctr file.

windows: https://github.com/gapcoin/GapMiner/releases/download/crt-rev5.1/windows.zip
md5: 50b506c6fdacbe36dd2d87e6f2c296d9

linux: https://github.com/gapcoin/GapMiner/releases/download/crt-rev5.1/linux.zip
md5: 88f0a3975df728566d3500b69475a78a

source code: https://github.com/gapcoin/GapMiner/

j0nn9

full member

Activity: 177

Merit: 154

Quote from: pdazzl on June 24, 2015, 09:53:11 AM

@j0nn9 - Are you going to submit the next batch of new records?

Yes, I'll do it within the next few days.

Quote from: pdazzl on June 24, 2015, 09:53:11 AM

There's a thread on mersenneforum where gapcoin is starting to get noticed by other gap hunters and number theorists. There's a lot of cpu resources with folks who follow that forum, getting involvement from that community would benefit gapcoin.

Thanks for the hint!

orgi666

sr. member

Activity: 280

Merit: 250

Wow,the new cpu miner is great....

pdazzl

newbie

Activity: 45

Merit: 0

@j0nn9 - Are you going to submit the next batch of new records?

There's a thread on mersenneforum where gapcoin is starting to get noticed by other gap hunters and number theorists. There's a lot of cpu resources with folks who follow that forum, getting involvement from that community would benefit gapcoin.

qqqq

legendary

Activity: 1596

Merit: 1011

I don't see any working block explorer of GAP. It's sad.

ph4nt0m

hero member

Activity: 591

Merit: 501

Scavenger of Crypto Sorrow

Can anyone who speaks Chinese reach out those most popular Chinese exchanges like btc38.com, bter.com, jubi.com?

pdazzl

newbie

Activity: 45

Merit: 0

Counting 936 records Gapcoin has, closing in on 1000.

qqqq

legendary

Activity: 1596

Merit: 1011

Are you noticed that gapcoin has been forked i guess? I mean blockchain.

Sorry guys, it's a false alarm of my wallet.

Topic: [ANN][GAP] Gapcoin - Prime Gap Search - New Math Algo - CPU / GPU - Zero Premine - page 66. (Read 287669 times)