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

[gatra]

Hi!

A couple of questions: doesn't proof of work verification necessary involve testing all numbers in the gap? Even using a sieve, wouldn't it become too slow?
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?
I'm really interested in seeing how would this work.

Best regards,
Gatra

[gatra]

Another thing to consider:

If expected average merit and max merit depend on the size of the primes, wouldn't I get an advantage by mining a pool using smaller primes? (restricting myself to smaller "shifts") Smaller primes mean faster computations, so more chances of getting a share, but at the expense of less changes of getting an actual block!

If this is true, then pools would have to someway incentivize larger "shifts".

[q327K091]

Another thing to consider:

If expected average merit and max merit depend on the size of the primes, wouldn't I get an advantage by mining a pool using smaller primes? (restricting myself to smaller "shifts") Smaller primes mean faster computations, so more chances of getting a share, but at the expense of less changes of getting an actual block!

If this is true, then pools would have to someway incentivize larger "shifts".

pool @Gatra simply could not handle RPC requests (changing now to stratum) also their hardware spec is not up to par, overall )and many said that) problem is so important we need more pools. I don't think artificial adjustments as to size of primes and shift in the reward calculation will be necessary if there is more than one pool, and even with one pool look at the price of GAP.. it is more than great and that given how purposefully or not people convert crypto to FIAT.. no idea why but it ain't me

ps. not convert to FIAT but convert to BTC.. because many hope that BTC to be dominant force. in years/decades to come. (I don't think it will, because it will focus too narrow but many do)

but here is where I stop

someone should elaborate on @Gatra (creator of Riecoin) more intricate questions, it is phenomenal he is looking at this development (in gap)

[Damadegyptian]

whats up with the pool @Nonce ? i keep getting Stales

and this msg: curl_easy_perform()failed: time out was reached

Yes the pool is a bit overloaded for the rpc miner, we are working on a stratum server and hope to have it ready in a couple of  days.

We will be raising the pool difficulty shortly to reduce the server load.

Note: everyone's hashrate will show lower for now until we have a chance to fix the stats. (Not that they are that accurate anyway)

ok thanks... seems ok at the moment. even tho the volume of workers is even higher than earlier.

[alicea]

start working on GPU miner (Open CL) Routines here is what is needed and fast: to combine gapcoin POW and Open CL (best would be with NVIDIA routines)

If it goes so, I'd have to buy Nvidia gpu, but anyway it's a good idea!

[dcct]

Hi!

A couple of questions: doesn't proof of work verification necessary involve testing all numbers in the gap? Even using a sieve, wouldn't it become too slow?
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?
I'm really interested in seeing how would this work.

Best regards,
Gatra

Verification is quite fast. Even a 7k gap is verified within seconds.
With O(log(p)) the max. merit is already above 256, with a larger shift difficulty can raise further. I don't see any limit here.

If expected average merit and max merit depend on the size of the primes, wouldn't I get an advantage by mining a pool using smaller primes? (restricting myself to smaller "shifts") Smaller primes mean faster computations, so more chances of getting a share, but at the expense of less changes of getting an actual block!

Its a bit of a tradeoff here. Larger shifts allow for larger, more efficient sieves, while lower ones speed up the fermat tests. I figured out the optimum is somewhere between 20 (the default value) and 26. Its only a minor improvement anyway.

[q327K091]

another gap block has arrived..

Credit: 22.xxxxxx GAP (matures in xxx more blocks)

thanks goes to you @dcct, dcct increased my block count Today

as I wrote this post another GAP block popped in! (same merit, 22.nnn GAP)

[dcct]

another gap block has arrived..

Credit: 22.xxxxxx GAP (matures in xxx more blocks)

thanks goes to you @dcct, dcct increased my block count Today

as I wrote this post another GAO block popped in!

How many instances do you use?

[q327K091]

another gap block has arrived..

Credit: 22.xxxxxx GAP (matures in xxx more blocks)

thanks goes to you @dcct, dcct increased my block count Today

as I wrote this post another GAO block popped in!

How many instances do you use?

let's not tell but let's just say process it is wonderfully random, nature of primary number distribution is perfect.... a perfect organism (a primary number)

[j0nn9]

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:

Code:

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

[AizenSou]

Oh total network hash > 60mil PPS ?
Good luck selling GAP less than 100k, dumpers

[bsunau7]

Big sieve.
Small shift.
Coins lost.
To bad.

[dcct]

Big sieve.
Small shift.
Coins lost.
To bad.

For everyone who is tuning the miner:
Max. sieve size is 2^shift

[bsunau7]

Found block.
Won't stop.
Stale logic.
Can't stop.

[hankrules]

Found block.
Won't stop.
Stale logic.
Can't stop.

Place this in Haiku form, please.

[bsunau7]

Found block.
Won't stop.
Stale logic.
Can't stop.

Place this in Haiku form, please.

Was going for a variant of Hemingway's shortest story:

For Sale:
Baby Shoes,
never worn.

Regards,

--
bsunau7

[Palmdetroit]

somebody say HAIKU!?


where is my gpu mine
palm d likes to gpu mine primes
gpu mine lets just release

[hankrules]

somebody say HAIKU!?


where is my gpu mine
palm d likes to gpu mine primes
gpu mine lets just release

How about a limerick?

I once mined a coin called the GAP
Everyone called me a sap
But amidst all the grime
We found all the primes
Then rejoiced atop coinmarketcap

 

[Trollollo]

Oh total network hash > 60mil PPS ?
Good luck selling GAP less than 100k, dumpers

They don't understand this point-"Difficulty adjusts every block and increases logarithmic (it will probably take years to get to 50)"
 

[dcct]

They don't understand this point-"Difficulty adjusts every block and increases logarithmic (it will probably take years to get to 50)"
 

Let me explain it to you:

Difficulty increases just like with every other coin. But as the effort needed to find gaps increases exponentially with higher merit, the log of actual difficulty is shown.