I got 3x290 and it seems work fine but than after some time the speed starts decreasing in 400 times. It's solo mining.   The Miner currently uses the cpu for sieving, and is very memory hungry, maybe you run out of memory and parts of the program where moved onto the disk (pagefile). The memory consumption is so high, because a very lage sieve is used, with many primes, and also a queue is used to keep the cpu busy while the gpu is processing the fermat tests. You can alter a few parameters to reduce the memory load: -s --sieve-size the prime sieve size
-w --work-items gpu work items (default 2048)
-a --max-primes maximum sieve primes (for use with gpu)
-z --queue-size the gpu waiting queue size (memory intensive)
The Sieve dynamically adjusts the sieve primes, so that it opimaly generaets a new set of prime candidates while the gpu is testing a previous set. The queue must have a minimum size of 2. |
|
|
|
hi guys, can you please post a sample gapcoin.conf please?
also, has anyone with a radeon 270x tried the gpu miner? if yes, care to share your results?
rpcuser=user
rpcpassword=password
server=1
addnode=212.227.143.155
addnode=104.131.69.82
addnode=95.215.44.9
addnode=155.254.36.179
addnode=199.127.226.192
|
|
|
|
why involves only one GPU
You have to use one instance per gpu. Use --gpu-dev <id>, to select the right one. |
|
|
|
Hi there, i've managed to build a experimental gpu miner. It got me about 200,000 pps with one R9 280x without any overclocking or powertune. Currently the miner is very experimental and needs to be tested, therefore I published the source code on github. The miner is a hybrid version of eXtremals fermat test and GapMiners sieve. The sieving is calculated on the cpu and the fermat tests are running on the GPU. Currently it is very (host) memory hungry about 1GB and you have to use one instance per gpu device. You can get it with: git clone https://github.com/gapcoin/GapMiner.git -b gpu-miner
cd GapMiner
git submodule init
git submodule update
It was built against amd app sdk v2.9 but maybe works with other versions too. You can edit the Makefile to change the sdk destination directory. I will merge nonce-pools stratum changes, and probably fix some bugs at the weekend, and then create some binaries within the next week. |
|
|
|
Does anyone have a list of pools they like to use, or know of pools that are reliable and you think they would like to add/are capable of adding this coin?
I'll email them, asking to add this coin, all you have to do is post the name of the pool/operator so I can google/search for it.
I already asked ypool, but they currently don't have the ability to add a new coin. |
|
|
|
Why is there only one pool to mine Gap ?
doesn't that affect the mining process or the blockchain integrity ?
Yes, it's not a perfect situation, but consider Gapcoin is only two weeks old. More pools will follow. |
|
|
|
|
Hi there,
just wanted to inform you, that I started working on a GPU miner.
At the moment i can't say how long it will take.
Just playing around with eXtremal's (madMAx's) code.
Till now, the results are pretty promising:
On a R9 280 the fermat test gives a 30x - 40x speed increase in comparison to a single cpu core and gmp.
The sieve in Gapcoin only runs about 2-3% of the time,
so at the moment I will only port the primality testing to the GPU.
And of course I will open source it, once it's finished.
Thanks for all your great support so far,
I will keep you informed about the process.
j0nn9
|
|
|
|
diff going up and price going down  , why? this coin is not bitcoin  or ...?  Its not all about the price, some people, myself included, mine gap for pure science  OK, but amazon player don`t mine gap for pure science  Tell me please, who needs this calculations? Prime numbers are interesting for lots of mathematicians around the globe, and they're also important to every day cryptography (see RSA). Researches about prime gaps could not only lead to new breakthroughs in the bounded gap, it may also help proving the Twin Prime Conjecture and maybe even the millennium problem, the Riemann hypothesis. Who knows? |
|
|
|
doesn't proof of work verification necessary involve testing all numbers in the gap? Even using a sieve, wouldn't it become too slow?
Hey Gatra, yes, proof of work verification involves testing all numbers in the gap. It is a simple gmp call: 130 /* start has to be a prime */
131 if (!mpz_probab_prime_p(mpz_start, 25)) {
132
133 mpz_clear(mpz_start);
134 return false;
135 }
136
137 mpz_init(mpz_end);
138 mpz_nextprime(mpz_end, mpz_start);
The time for one verification is currently about 0.008 seconds (on a Intel i5-2500K) If merit is about gap size/log(p), but max gap size is O(log^2(p)), then max merit is O(log(p)). So in order to get more merit, you'll eventually need larger primes, otherwise you'll have an upper bound for the merit! How do you handle this?
This is no problem, you can control the prime bit size with the shift field within the block header. The largest prime can theoretically have a bit size of 256 + 2^16 Gapcoin also has a (compile time) opt-in restriction for the max allowed shift amount. The main nodes currently only allows shifts up to 512. Best regards, j0nn9 |
|
|
|
New GapMiner release: now supports long polling + bug fixes
Please update your miners to reduce network load for the pool.
|
|
|
|
In Gapcoin, - what happens to the reward when difficulty gets down? - why is it easier to create a pool in Gapcoin than in Primecoin? I've read http://www.gapcoin.org/, but did not get my answers Thanks This is from peercoin/primecoin forum. So j0nn9 what are the answers? I know that reward also gets down but what about the second question? When mining Primecoin, you can easily betray the pool by modifying your miner to search only for smaller prime chains. With Gapcoin, this is not possible. In detail: When you searching for prime chains, you use a sieve for filtering prime candidates. If you search for a 10 chain, you sieve 10 times and eliminate all prime chain candidates that are smaller than 10. The primecoin pool then for example credits you for submitted 10-chain candidates that are only 7,8 or 9-chains. If you now sieve only 7 times, you will get a lot more 7-chain candidates. Not only is your calculating effort less, you will also find 7-chains that would not have been 10 chain candidates. The important point is, your chance of finding 10 chains drops while your chances of finding 7 chains rises. Pool operators have to implement something to handle such "betrayers". With Gapcoin you don't have this additional effort. |
|
|
|
Can you please compile the Linux Miner too.
I'm on it. |
|
|
|
We just got our first pool!
|
|
|
|
A good pool would solve most problems...
Be patient. Development needs time, but it will come. |
|
|
|
Good work!! Thanks a lot! |
|
|
|
|
Show Posts
.
