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

[pdazzl]

Looks like someone else has joined in searching for big shifts, we're setting new records fairly quickly now.

Almost got into the 25000 range this morning, length 24822 ( merit 28.8 ).  The overall merit record may be found more easily in these higher ranges.
https://bchain.info/GAP/block/126548

[1714218874]

1714218874

[1714218874]

1714218874

[1714218874]

1714218874

[j0nn9]

Hi there,

just want to inform you that I submitted the current gap records from http://gapcoin.org/primegaps-length.php to Dr. Nicely.
I'll update gapcoin.org as soon as the new records are listed on http://www.trnicely.net/.

[pdazzl]

Hi there,

just want to inform you that I submitted the current gap records from http://gapcoin.org/primegaps-length.php to Dr. Nicely.
I'll update gapcoin.org as soon as the new records are listed on http://www.trnicely.net/.

Looks like they've posted on trnicely.net

Will see if we can get in the 25000 range next time

Also looks like some records show up again as improvements on themselves (on gapcoin.org) due to digits truncated on trnicely.net
EDIT: Fixed

[pdazzl]

Doing some more performance testing, here's another one that appears to yield good results if someone wants to try it out.

./gapminer-cpu -o 127.0.0.1 -p 31397 -u **** -x **** -t 8 --shift 508 --crt crt/crt-22m-512s.txt --fermat-threads 7 --sieve-primes 10000

It's a very low number of primes to sieve with but results in generating a LOT of candidate gaps in the gaplist.  The gaplist grows by 50000 every 10 seconds.  But the block percentage goes up very quickly.  The reason I think it does is because of j0nn9's algo picking the best candidate gaps from a bigger applicant pool in the heap and thus yielding block solving gaps more quickly.

You'll want to monitor your memory usage for a couple rounds at first, the high watermark for the above arguments on my machine is about 2.6gig of RAM so you'll want to make sure you're not too close to maxing out your memory.

[ph4nt0m]

gap.nonce-pool.com shuts down in 4 days. Anyone cares?

[bonosurgut]

probably not

[GreekBitcoin]

Well whenever i mine gapcoin i solo mine so... It is actually very easy to solo mine gapcoin....

[bonosurgut]

can you tell us how to do it?

[shojayxt]

Its too bad this coin ends up like this when it offers so much more than 99% of the coins out there.

[GreekBitcoin]

can you tell us how to do it?

What OS? Here is a guide: http://gapcoin.grn.cc/  Just skip the part about VPS... Generally speaking you download the qt, you run it and it downloads the blockchain, you download the latest miner, you start the miner pointing at the daemon...

Its too bad this coin ends up like this when it offers so much more than 99% of the coins out there.

Well it doesnt have the wow such coin much profit advertisement the other shitcoin have...


I had an idea lately. Let us select a random day in a month or so from now and call it "Gapcoin BreakTheRecordDay" (rename it however you like it). The idea will be that on that day we are calling miners from other coins too help us break the world record. Just a day trying... Then we spam(well some positive spamming, not too ugly) a bit the forums and social media and ask for help specific for that day. We could try to contact some crypto related news sites too. We gonna need someone to build a nice pool that can accept that traffic. Maybe we can talk with someone well known about this.  Someone should make a few images about that event. Finally we throw all the bounties that we have already gathered, plus we put a few more. I can add a few thousand gapcoins plus a few monero. The bounty will be given to whoever break the record. If a pool breaks the record i guess it can give according to shares of the spcific block. I believe we can gather a nice big bounty that can persuade people to mine gapcoin for a day. I dont know if we can succeed to break the record in a day. But a try wont be bad.

What are your thoughts? I am not sure about the technicalities. For example maybe we are going to fork the coin or whatever. But i dont think that anyone would like to destroy the coin...

Share your thoughts. If you find the idea okay lets start discussing for a few days. And then start organising it. Keep in mind that the whole thing shouldnt be utopically perfect. At least we can give it a try...

[pdazzl]

Folks who are transitioning to solo mining now that the pool is closed, don't forget to get the new Chinese remainder theorem miner (rev5).

If all the pool users transitioned to solo in the shift 500-600 range I'll bet we could find the overall merit world record fairly quickly.  Seems easier to find bigger merits in the higher ranges.

[qqqq]

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

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

[pdazzl]

Counting 936 records Gapcoin has, closing in on 1000.

[ph4nt0m]

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

[qqqq]

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

[pdazzl]

@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.

[orgi666]

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

[j0nn9]

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

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

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!

[j0nn9]

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/

[pdazzl]

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?