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

[BitcoinFX]

Hi

Can someone list some nodes please?

Thanks!

Sure. Herewith, gapcoin.club nodes;

Code:

addnode 45.76.140.157 add
addnode 193.233.60.184 add
addnode 37.139.15.251 add
addnode 104.236.168.125 add
addnode 138.68.172.174 add
addnode 139.59.57.170 add
addnode 139.59.103.137 add
addnode 138.197.159.202 add

For community reference 'xpoolx' operates both the "Multicurrency auto exchange mining pool" https://xpoolx.com and the newer (in development, but still highly functional) https://xequinex.com crypto Exchange service !


EDIT:

XEQUINEX Crypto Exchange Service ... Added GAP/BTC:
- https://www.xequinex.com/exchange.php?market=GAP-BTC (NEW Exchange)

Thanks! @xpoolx

[gjhiggins]

Compiling the daemon is still tricky on newer linux releases and that needs fixing with another new repo. now that Graham has also sadly gone.

The PoW-Core needs to be properly integrated, one issue being that much has changed with GitHub as well as some other factors for compiling the wallet software since the original releases.

Graham has actually done an excellent job in presenting exactly what needs to be done (in his thread posts) for anyone who picks this up.

Gapcoin needs a good 'team' of developers before much else and the much else is not really forthcoming because of this current situation.

Actually, Graham has not "sadly gone" nor have I been away so I'm not even "back". The basic truth is that I'm pushing 70 and the relative inactivity of long hours spent at the keyboard is becoming increasingly prejudicial to my overall heath, so for my own sake I'm obliged to reduce my level of engagement. This entails aggressively managing others' expectations and not allowing my schedule to be held hostage to random public misperceptions. Hence, I only report on work that has been completed ... read on ...

Gapcoin now has a community-led Github repository of its own: https://github.com/gapcoin-project which is now host to all the associated Gapcoin repos (i.e. Gapcoin, Gapminer and the submodules Gapcoin-PoWCore, Evolution and C-Utils). I strongly recommend that you sign up for a (free) Github account, at least so you can be automatically informed by email of changes to the Gapcoin project resources even if you don't wish to contribute to the project directly (e.g. by helping to maintain the project web site, see below).

On behalf of the project, I have taken advantage of Github's free static website maintenance and hosting facility (GitHub Pages) to create a community-led web site for the project - https://gapcoin-project.github.io/. The reason it's "community-led" is that the source code for the web site is maintained in a dedicated Github repository - https://github.com/gapcoin-project/gapcoin-project.github.io and can be maintained/extended/edited by any member of the project that wishes to do so. The advantage of a community-led and community-maintained approach is that the resources are no longer the responsibility of just one person but the onus is shared across the group.

In order to get things moving, I've used the Opentheme Jekyll site template (the same one I used for the mersenne forum's prime gap search group) to provide structure and functionality, it's now a matter of re-branding and adapting the example content provided. This approach has the advantage that the site can be hosted locally, edited/changed as convenient. The final changes can be committed and pushed back to the Github repos and they will then be automatically published to the project web site. It's a popular approach and all aspects are well-documented (search for "Github pages" and also "Jekyll").

I have upgraded the Gapcoin codebase to Core 0.9.4 (see the branch v0.9.4-gap) (use git clone -b v0.9.4-gap https://github.com/gapcoin-project/gapcoin.git) and have added some functionality.

The client now has a built-in "block explorer" (aka a GUI presentation of data otherwise accessible via the JSON-RPC API or console)

Block display:



Transaction display:



The client now offers a dialog box showing a list of Gapcoin-held prime gap records along with the information recorded in the block data - with the aim of casting a little more illumination on mining settings:



I have edited the contents of the "About Gapcoin Core" dialog box to have two tabs, one showing the standard copyright credits (and some other stuff) and a second tab commemorating/crediting John Frey:



I've added a "Mining" tab with fields for setting values for shift, sieve size and number of primes in the sieve:



and a "Notary" tab, easing Gapcoin's (inherited-from-Bitcoin) utility to act as a blockchain-preserved notary.



I've also committed a "dumpbootstrap" command to the JSON RPC API command set - it dumps a file of linearized blocks (bootstrap.dat) which can be read back in (takes a couple of days, even on my fast-ish laptop).

I have updated the pnSeeds entries (the IP addresses first consulted by a syncing-from-zero client) so no need to hand around lists of addnode IPs, there's also a fresh working testnet and a testnet pnSeed, so clients started with -testnet should sync up very quickly.

I have added a download-and-build script for BerkeleyDB 4.8 for convenience when compiling a Gapcoin client with full wallet portability.

With respect to integrating GapCoin-PoWCore into the code, it is also a submodule for GapMiner, so rather than have to maintain two copies of the same code, I simply updated the submodule references for both Gapcoin and GapMiner.

I also recommend signing up to the created Discord server, that's where you will discover that ocminer is also working on a pool for Gapcoin.

Cheers

Graham

[BitcoinFX]

Compiling the daemon is still tricky on newer linux releases and that needs fixing with another new repo. now that Graham has also sadly gone.

The PoW-Core needs to be properly integrated, one issue being that much has changed with GitHub as well as some other factors for compiling the wallet software since the original releases.

Graham has actually done an excellent job in presenting exactly what needs to be done (in his thread posts) for anyone who picks this up.

Gapcoin needs a good 'team' of developers before much else and the much else is not really forthcoming because of this current situation.

Actually, Graham has not "sadly gone" nor have I been away so I'm not even "back". The basic truth is that I'm pushing 70 and the relative inactivity of long hours spent at the keyboard is becoming increasingly prejudicial to my overall heath, so for my own sake I'm obliged to reduce my level of engagement. This entails aggressively managing others' expectations and not allowing my schedule to be held hostage to random public misperceptions. Hence, I only report on work that has been completed ... read on ...

Apologies for any confusion. My bad. I was left under the impression from your last PM that you would be unlikely to continue with development ...

You have already more than exceeded the expectations of the Gapcoin community both with your contributions and experience herein.

Well wishes to all!

...

Updating https://gapcoin.club with the new repo. etc., and I will join the community Discord discussion soon.

Some exchanges require a second online block explorer and this is still my priority, along with a new website / design.

...

According to https://www.whois.com/whois/gapcoin.org the domain was due to expire on the 30th of May 2020 ...

However, gapcoin.org has seemingly been automatically? 'renewed' on: 2020-04-30 and until: 30th of May 2021 ...

Who knows?

[BitcoinFX]

矿池都没有发你妹！

目前沒有採礦池

您可以在錢包兄弟中挖硬幣！

> setgenerate true

 

[Ive Gone Parabolic]

@gjhiggins

U are not giggins, u are goggins. Walton Goggins u are. Listen goggins, why are u always repeating things like theres no tomorrow? I remember your saying that for the underlying mathematics which is what Gapcoin's bowels are made out of to be fully consistent with criterion of MZ (magic zero) semantics, there needs to be biparallelism implemented within the stochastic engine. Gap here, gap there who cares. Make more gaps to aid uniformity.

[BitcoinFX]

Tested gapcoind (and gapcoin-cli) branch v0.9.4 which now builds perfectly on Ubuntu 18.04 LTS server ...

Terminal window (ctrl + alt + t) - copy and paste:

Code:

sudo apt-get update && sudo apt-get dist-upgrade

Code:

sudo apt-get install build-essential libtool autotools-dev autoconf pkg-config libssl-dev libevent-dev libboost-all-dev libgmp-dev libmpfr-dev

Berkeley DB:

Code:

wget http://download.oracle.com/berkeley-db/db-4.8.30.NC.tar.gz

Code:

echo '12edc0df75bf9abd7f82f821795bcee50f42cb2e5f76a6a281b85732798364ef  db-4.8.30.NC.tar.gz' | sha256sum -c

Code:

tar -xvf db-4.8.30.NC.tar.gz

Berkeley DB compile:

Code:

cd db-4.8.30.NC/build_unix

Code:

mkdir -p build

Code:

BDB_PREFIX=$(pwd)/build

Code:

../dist/configure --disable-shared --enable-cxx --with-pic --prefix=$BDB_PREFIX

Code:

make install

Code:

cd ../..

Gapcoind (and gapcoin-cli) download and compile:

Code:

git clone --branch v0.9.4-gap https://github.com/gapcoin-project/gapcoin.git

Code:

cd gapcoin

Code:

git submodule init

Code:

git submodule update

Code:

./autogen.sh

Code:

./configure CPPFLAGS="-I${BDB_PREFIX}/include/ -O2" LDFLAGS="-L${BDB_PREFIX}/lib/" --without-gui --without-miniupnpc --disable-tests

Code:

make

Strip gapcoind and gapcoin-cli:

Code:

cd src

Code:

strip gapcoind

Code:

strip gapcoin-cli

Code:

cd

Running Gapcoind:

Code:

cd gapcoin/src && ./gapcoind

....: To use the "-server" option, you must set a rpcpassword in the configuration file:
/root/.gapcoin/gapcoin.conf
It is recommended you use the following random password:
rpcuser=gapcoinrpc
rpcpassword=
(you do not need to remember this password)
The username and password MUST NOT be the same.
If the file does not exist, create it with owner-readable-only file permissions.
.....

Copy and paste:

rpcuser=gapcoinrpc
rpcpassword=

Code:

sudo nano /root/.gapcoin/gapcoin.conf

...

New screen session:

Code:

screen -S gapcoind

Run gapcoind:

Code:

cd gapcoin/src && ./gapcoind

Crtl + A + D (to exit screen)

Code:

cd gapcoin/src && ./gapcoind getinfo

etc.,

screen -r gapcoind (returns to screen session)

 

- https://youtu.be/yndq8jeSPc8

[ocminer]

Anyone can shed some light how actually the Miner utilizes GPU as well ?

[BitcoinFX]

Anyone can shed some light how actually the Miner utilizes GPU as well ?

To my recollection the original nonce pool (the only ever working pool for gapcoin), just utilized the CPU mining function.

See:
- https://github.com/noncepool?tab=repositories

The GPU miner was a 'work in progress' when the developer sadly passed away (and the pool closed), as was the CRT (CPU) function for RPC mining.

In terms of pooled mining (and continued miner development), the following likely ensues, moving forward ...

1. Pooled CPU mining using GapMiner.

2. Pooled GPU mining using GapMiner (requires development)

3. Pooled CPU / GPU mining using GapMiner CRT function (as above)

- https://en.wikipedia.org/wiki/Chinese_remainder_theorem

N.B. at this point Quanta Magazine will likely be on the phone or we will have opened a StarGate - lol

...

"1. CPU mining using GapMiner"
- should be incredibly straight forward for yourself to get working 'ocminer', given your fantastic history in the crypto space!

Also, see:
- https://github.com/gapcoin-project/GapMiner

...

TBH I have not needed to do much myself in this regard due to lack of community involvement in recent years.

EDIT: I've gone back through the thread and here are the relevant posts ...

Modded CPU-Miner (by dcct, about 10x faster):

Windows: https://github.com/gapcoin/GapMiner/releases/download/dcct-mod/windows.zip
md5: d8b7f82ef2e325f7feff1b2630e21849

Linux: https://github.com/gapcoin/GapMiner/releases/download/dcct-mod/linux.zip
md5: 15999a95ed79174c83c92827884ee8b6

Source Code: https://bchain.info/gapminer_dcct_mod.zip

N.B. The above mining improvment was integrated into j0nn9's last wallet release i.e. the most optimized CPU miner is already in the wallet.

...

...snip...

The algorithm:

The average length of a prime gap with the starting prime p, is log(p),
which means that the average prime gap size increases with lager primes.

Instead of the pure length, Gapcoin uses the merit of a prime gap,
which is the ratio of the gap's size to the average gap size.

Let p be the prime starting a prime gap, then m = gapsize/log(p) will be the merit of this prime gap.
Also a pseudo random number is calculated from p to provide finer difficulty adjustment.

Let rand(p) be a pseudo random function with 0 < rand(p) < 1
Then, for a prime gap starting at prime p with size s,
the difficulty will be s/log(p) + 2/log(p) ∗ rand(p),
where 2/log(p) is the average distance between a gap of size s and s + 2 (the next greater gap) in the proximity of p.

When it actually comes to mining, there are two additional fields added to the Blockheader, named “shift” and “adder”.

We will calculate the prime p as sha256(Blockheader) ∗ 2^shift + adder.
As an additional criterion the adder has to be smaller than 2^shift to avoid that the PoW could be reused.


Mining:

For mining, PoWCore uses a basic prime sieve with some slightly improvements:

The sieving steps:

Calculate the first n primes.
In the actual sieve we skip all even numbers,
because we want to only sieve the odd multiplies of each prime.

So, we create an additional set of primes and multiply each with two.
Make sure the start_index of the sieve is divisible by two.

Now calculate for each prime the first odd number in the sieve,
which is divisible by that prime (called pindex).

For each prime p: mark the pindex as composite,
add 2 ∗ p to pindex and mark it as composite,
 redo till we reach the end of the sieve.

For each remaining prime candidate,
check primality with the Fermat-pseudo-prime-test as it is faster than the Miller-Rabin-test
(Fermat is not as accurate as the Miller-Rabin and maybe some valid sieve results will not be accepted, but this should be very rare)

Now scan the remaining (pseudo) primes for a big prime gap.


Additional notes:

start–index can be hash ∗ 2^shift + [0, 2^shift)

max sieve size depends on start index, and is limited by (hash + 2^shift) - start_index.

shift can theoretically be in range [14, 2^16),
but nodes can choose to only accept shifts till a given amount (e.g. 512 for the main nodes)


dcct's improvements

We do not check every remaining prime candidate with the fermat test.
Instead we look how large the gap has to be to fit the required difficulty (max_length).

Then we determine the first prime in the sieve (called pstart).
Now we scan the prime candidates in the range (pstart, pstart + max_length).
We start at the position (pstart + max_length) and scan every prime candidate in reverse order till we reach pstart.

If we find a prime within the range (pstart, pstart + max_length)
we can skip all other prime candidates within that range and set pstart to that prime.

We redo the above process till we reach the end of the sieve.



So, to sum it up:

Gapcoin is researching into the opposite problem than the one of your video above,
but the max prime gap problem and the twin prime conjecture are closely related,
so, maybe Gapcoin's prime gaps could help somehow proving it.

...

Improved GPU-Miner (experimental):

Windows: https://github.com/gapcoin/GapMiner/releases/download/gpu-miner-rev3/windows.zip
md5: 6e0fa4a4331c3758bec1fc74334aa753

Linux: https://github.com/gapcoin/GapMiner/releases/download/gpu-miner-rev3/linux.zip
md5: 85bb6f69b22de5e51388155e7b532195

Source Code: https://github.com/gapcoin/GapMiner (branch gpu-miner)


The Miner is still a bit buggy, but it produced good results for the last few hours,
so I decided to release a test version.

About the speed: I managed to get around 1,200,000 pps with a single AMD R9 280, that's a 6x speed increase to the previous GPU-Miner.

I could also reduce the memory load.
Only the Sieve still runs on the CPU.

Also the 10 and 15 gaps per hour are replaced with tests per second,
which are the number of primality tests calculated per second.


The algorithm:

The sieve is splitted into parts of the required gap size,
then simultaneously, the prime candidates from each part are tested,
starting from the end of the part and skipping those parts which have a prime in it.

When using the -e switch you'll get an info about the current average number of prime candidates of those parts
(candidates which are not tested yet).
Also the minimum number of prime candidates to test are listed.

In one gpu run, several candidates from each part are tested,
you can control these number with -n


Debugging:

For debugging there are two options added to the Makefile,
one for debugging while mining, these are some tests, which shouldn't have a great impact on the pps
and one for debugging only. Activating the second option will run several time intensive tests while mining,
which has a huge impact on the pps.

...

New GapMiner (CPU/GPU) Release

Windows: https://github.com/gapcoin/GapMiner/releases/download/gapminer-rev4/windows.zip
md5: 1e5cac5758599ab03a58a42cddcf0f82

Linux: https://github.com/gapcoin/GapMiner/releases/download/gapminer-rev4/linux.zip
md5: 71cc3cb94265adf5b4f583b05c704c06

Source Code: https://github.com/gapcoin/GapMiner (branch gpu-miner)

Changes:

• fully merged dcct's mod
• removed boost library dependency
• reworte stratum network stuff
• fixed stratum windows support

I wasn't able to fully test the GPU-Miner,
but it should work, since I only changed the stratum part.

Please use stratum if possible to reduce load for the pool.

...

New experimental GapMiner release (CPU only)

Revision 5: capable of using the Chinese Remainder Theorem to speed up mining with large shift.


windows: https://github.com/gapcoin/GapMiner/releases/download/crt-rev5/gapminer-windows-rev5.zip
md5: dbae859b1e8825f4f9b3f693004833c4

linux: https://github.com/gapcoin/GapMiner/releases/download/crt-rev5/gapminer-linux-rev5.zip
md5: 909f7fcb141a23d60b04ba8c0df1f391

source code: https://github.com/gapcoin/GapMiner/archive/crt-rev5.zip
source code PoWCore: https://github.com/gapcoin/Gapcoin-PoWCore/archive/master.zip


The usage should be pretty self explaining from the start-gapminer file.
There are different CRT files containing values optimized for a specific shift.


There are 3 new verbose outputs:

• gaps/s:  The amount of gaps scanned  per second
• gaplist:  The number of sieved gaps ready for scanning
• block:  The percent of the calculation amount of an average block

The primes per second and the block percent values are estimated using the theoretical speed improve from the CRT, so they don't have to be correct.

Mining with the CRT is optimized for solo mining.
You can mine at the pool, but you will probably mine less shares, and the pps and block values are probably incorrect, but your chance of finding a block is almost the same as when mining solo.

Mining with the CRT is splitted in sieve and primality testing using separate threads for each:

Code:

--threads 4 --fermat-threads 1

means: 3 sieve and 1 gap scan thread. So you have to use at least 2 threads.

The scan threads always pick the most promising gap from the gaplist, therefore the gaplist value should always be at least over 100, but a too high gaplist value can slow down mining, (for example over 9000). You can alter --sieve-primes, --threads or --fermat-threads to achieve this.
(--sieve-size is not used for CRT mining)
FYI: The gaplist is implemented as an heap


The is also an logging version, which produces additional output in a gapminer.log file.
If something goes wrong, you can switch versions, and look whats wrong, or at least give feedback.

...

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/

Again, It's a stark realization that Gapcoin has never been mass GPU mined and/or that the CRT mining could also be implemented into GPU (pooled) mining ...

Gapcoin 'smashed' the world prime gap record MERIT with about 20+ nodes and without a pool!  

"Imagine the ASIC's" ...


Additional ...

In terms of developing Gapcoin's Proof-of-Work function moving forward ...
we can probably count the number of true Prime Gap experts / mathematicians on just over one hand ...

Together and Alone, Closing the Prime Gap
- https://www.quantamagazine.org/mathematicians-team-up-on-twin-primes-conjecture-20131119

After Prime Proof, an Unlikely Star Rises
- https://www.quantamagazine.org/yitang-zhang-and-the-mystery-of-numbers-20150402

Prime Gap Grows After Decades-Long Lull
- https://www.quantamagazine.org/mathematicians-prove-conjecture-on-big-prime-number-gaps-20141210

Unheralded Mathematician Bridges the Prime Gap
- https://www.quantamagazine.org/yitang-zhang-proves-landmark-theorem-in-distribution-of-prime-numbers-20130519/

...

Terence Tao
- https://en.wikipedia.org/wiki/Terence_Tao

James Maynard (mathematician)
- https://en.wikipedia.org/wiki/James_Maynard_(mathematician)

Yitang Zhang
- https://en.wikipedia.org/wiki/Yitang_Zhang

Kevin Ford (mathematician)
- https://en.wikipedia.org/wiki/Kevin_Ford_(mathematician)

Ben Green (mathematician)
- https://en.wikipedia.org/wiki/Ben_Green_(mathematician)

Sergei Konyagin
- https://en.wikipedia.org/wiki/Sergei_Konyagin

[DaCryptoRaccoon]

Well it looks like things are moving well over here now good to see some solid development of this coin I keep spreading the word about it but I think a lot of people don't see the value of something like this on the surface I wonder if a nice new GUI design and some solid advertising might help gapcoin start breaking world records.

On the note of a GPU miner how close to development is this?  is this something that could be continued going forward I wonder what sort of gaps would come to fruition with X6 1080ti's trying to find them I know there have been some advances in the pollard kangaroo method on GPU's and wondered if this might be something that could be useful in this project.

Anyway great to read the updates there and keep up the good work everyone!

Magic

[BitcoinFX]

Hey @MagicByt3  

A 'working' GPU miner already exists ... It just needs a good mining developer to get to grips with it and update it!

Quote from: j0nn9 on December 05, 2014, 04:31:27 AM
- https://bitcointalk.org/index.php?topic=822498.msg9744615#msg9744615

"Improved GPU-Miner (experimental):"

"Only the Sieve still runs on the CPU."

...

Quote from: j0nn9 on January 18, 2015, 01:28:14 AM
- https://bitcointalk.org/index.php?topic=822498.msg10191388#msg10191388
"New GapMiner (CPU/GPU) Release" <<<<< Latest

...

The new Gapcoin wallet / GUI updates (and additional features) are very nice indeed ...

I compiled it for Ubuntu 18.04 Desktop today, looking very good yes.

...

Remember that Gapcoin already holds the Prime Gap of Maximum Known Merit ...
- https://gapcoin.club/new-prime-gap-of-maximum-known-merit-press-release.php

- https://faculty.lynchburg.edu/~nicely/#MaxMerit

" The Gapcoin network (Jonnie Frey, developer), a Bitcoin derivative which employs a hashing algorithm to search for prime gaps of high merit, has discovered a new prime gap of maximum known merit, a gap of G=8350 following the 87-digit prime P1=293703234068022590158723766104419463425709075574811762098588798217895728858676728143227. The merit M=G/ln(P1) of this gap is M=41.93878373153988, the largest merit of any known prime gap, and the first prime gap to be discovered with a merit exceeding 40. The endpoints of the gap have been certified as primes deterministically, using the Akiyama-Kida-O'Hara UBASIC implementation (1988-1992) of the APRCL2 test, due to Adleman, Pomerance, Rumely, Cohen, H. W. Lenstra, and A. K. Lenstra (1984-1987).

However, Bertil Nyman's maximal gap of 1132, following the prime 1693182318746371 (discovered 24 January 1999), continues to exhibit the greatest known value (0.92063858855742) of the Cramér-Shanks-Granville ratio G/ln²(p_1); this ratio is 0.210642105494715467 for the new Gapcoin gap. The limit superior of this ratio has been conjectured to be unity (or some even larger value); see the discussion in "New prime gaps between 1e15 and 5e16".

...

"Could we break any world records?

In 2017 (confirmed in early 2018) the Gapcoin network found a new prime gap of maximum known merit! The merit M=G/ln(P1) of this gap is M=41.93878373153988, the largest merit of any known prime gap, and the first prime gap to be discovered with a merit exceeding 40. Source : https://faculty.lynchburg.edu/~nicely/

We already broke more than 544 records of first known occurrence prime gaps. (Note: New record data to be updated from the blockchain).

Also, if the difficulty reaches (or spikes above) 41.94, every block will be a new world record!"

Gapcoin's highest found merits as of 10th September 2019 (Top 30)
- http://gapcoin.org/primegaps-merits.php
- https://web.archive.org/web/20200219231207/http://gapcoin.org/primegaps-merits.php

...

Star Trek "More Power"
- https://youtu.be/4k5VzDBOcpM

 

[ocminer]

Testing around a bit, should be stable soon: https://gap.suprnova.cc

[BitcoinFX]

Testing around a bit, should be stable soon: https://gap.suprnova.cc

Moving forward!

I will add a link to the https://gapcoin.club website when the pool is confirmed as 'stable' ...

Thank you!

...

Remember to keep mining in the wallets folks, where possible, to avoid mining centralization!

We are going to need at least another couple of pools and by the looks of things ASAP.

Community N.B. 'ocminer' is a long-term mining pool operator and a 'trusted' member of this forum and the crypto space.

 

[ocminer]

All stable on my side

[BitcoinFX]

All stable on my side

Great!

Oasis - Champagne Supernova ...
- https://youtu.be/tI-5uv4wryI


Herewith, notes for developers, as and when of course ...

EDIT: Ubuntu 18.04 LTS (all good) - Recommended

Ubuntu 20.04 LTS ... reporting a 'default' boost library compile issue i.e. => 1.66.0 ...

Code:

  CXX      rpcserver.o
In file included from crypter.h:10,
                 from wallet.h:9,
                 from rpcserver.cpp:14:
keystore.h: In member function ‘virtual bool CBasicKeyStore::GetKey(const CKeyID&, CKey&) const’:
keystore.h:82:30: warning: implicitly-declared ‘constexpr CKey& CKey::operator=(const CKey&)’ is deprecated [-Wdeprecated-copy]
   82 |                 keyOut = mi->second;
      |                              ^~~~~~
In file included from base58.h:18,
                 from rpcserver.cpp:8:
key.h:203:5: note: because ‘CKey’ has user-provided ‘CKey::CKey(const CKey&)’
  203 |     CKey(const CKey &secret) : fValid(secret.fValid), fCompressed(secret.fCompressed) {
      |     ^~~~
rpcserver.cpp: In instantiation of ‘void RPCListen(boost::shared_ptr<boost::asio::basic_socket_acceptor<Protocol> >, boost::asio::ssl::context&, bool) [with Protocol = boost::asio::ip::tcp]’:
rpcserver.cpp:633:54:   required from here
rpcserver.cpp:506:111: error: ‘class boost::asio::basic_socket_acceptor<boost::asio::ip::tcp>’ has no member named ‘get_io_service’
  506 |     boost::shared_ptr< AcceptedConnectionImpl<Protocol> > conn(new AcceptedConnectionImpl<Protocol>(acceptor->get_io_service(), context, fUseSSL));
      |                                                                                                     ~~~~~~~~~~^~~~~~~~~~~~~~
make[3]: *** [Makefile:900: rpcserver.o] Error 1
make[3]: Leaving directory '/root/gapcoin/src'
make[2]: *** [Makefile:922: all-recursive] Error 1
make[2]: Leaving directory '/root/gapcoin/src'
make[1]: *** [Makefile:692: all] Error 2
make[1]: Leaving directory '/root/gapcoin/src'
make: *** [Makefile:509: all-recursive] Error 1

...

Code:

libboost-filesystem-dev is already the newest version (1.71.0.0ubuntu2).
libboost-filesystem-dev set to manually installed.
libboost-system-dev is already the newest version (1.71.0.0ubuntu2).
libboost-system-dev set to manually installed.
libboost-thread-dev is already the newest version (1.71.0.0ubuntu2).
libboost-thread-dev set to manually installed.
libboost-chrono-dev is already the newest version (1.71.0.0ubuntu2).
libboost-chrono-dev set to manually installed.
libboost-test-dev is already the newest version (1.71.0.0ubuntu2).
libboost-test-dev set to manually installed.

[holderwhale999]

working ! on Ubuntu 18.04

[BitcoinFX]

...snip...


working ! on Ubuntu 18.04

Indeed.  

I've edited the version typo in my above post ...

GUI compile guide for Ubuntu 18.04 LTS desktop to follow asap ...

As well as a new how-to compile the (standalone) Gap Miner (CPU) for pooled mining!

[gjhiggins]

Ubuntu 20.04 LTS ... reporting a 'default' boost library compile issue i.e. => 1.66.0 ...

Code:

rpcserver.cpp: In instantiation of ‘void RPCListen(boost::shared_ptr<boost::asio::basic_socket_acceptor<Protocol> >, boost::asio::ssl::context&, bool) [with Protocol = boost::asio::ip::tcp]’:
rpcserver.cpp:633:54:   required from here
rpcserver.cpp:506:111: error: ‘class boost::asio::basic_socket_acceptor<boost::asio::ip::tcp>’ has no member named ‘get_io_service’
  506 |     boost::shared_ptr< AcceptedConnectionImpl<Protocol> > conn(new AcceptedConnectionImpl<Protocol>(acceptor->get_io_service(), context, fUseSSL));

Yes, the interface to boost::asio has changed. I believe I crafted a solution, I'll see if I can lay a pointer on it.

Cheers

Graham

[BitcoinFX]

Thanks Graham !

...

Tested Gapcoin Core GUI wallet - gapcoin-qt - branch v0.9.4 which now builds perfectly on Ubuntu 18.04 LTS Desktop ...

Terminal window (ctrl + alt + t) - copy and paste:

Code:

sudo apt-get update && sudo apt-get dist-upgrade

Code:

sudo apt-get install build-essential libtool autotools-dev autoconf pkg-config libssl-dev libevent-dev libboost-all-dev libgmp-dev libmpfr-dev

Qt 5 Install:

Code:

sudo apt-get install git libqt5gui5 libqt5core5a libqt5dbus5 qttools5-dev qttools5-dev-tools libprotobuf-dev protobuf-compiler

N.B. libqt5core5a not libqt5core5


QR Code Support (optional - recommended) add:

Code:

sudo apt-get install libqrencode-dev

Berkeley DB:

Code:

wget http://download.oracle.com/berkeley-db/db-4.8.30.NC.tar.gz

Code:

echo '12edc0df75bf9abd7f82f821795bcee50f42cb2e5f76a6a281b85732798364ef  db-4.8.30.NC.tar.gz' | sha256sum -c

Code:

tar -xvf db-4.8.30.NC.tar.gz

Berkeley DB compile:

Code:

cd db-4.8.30.NC/build_unix

Code:

mkdir -p build

Code:

BDB_PREFIX=$(pwd)/build

Code:

../dist/configure --disable-shared --enable-cxx --with-pic --prefix=$BDB_PREFIX

Code:

make install

Code:

cd ../..

Gapcoin-QT, gapcoind and gapcoin-cli download and compile:

Code:

git clone --branch v0.9.4-gap https://github.com/gapcoin-project/gapcoin.git

Code:

cd gapcoin

Code:

git submodule init

Code:

git submodule update

Code:

./autogen.sh

Code:

./configure CPPFLAGS="-I${BDB_PREFIX}/include/ -O2" LDFLAGS="-L${BDB_PREFIX}/lib/" --with-gui=qt5 --without-miniupnpc --disable-tests

Code:

make

Code:

make install

Strip gapcoind and gapcoin-cli:

Code:

cd src

Code:

strip gapcoind

Code:

strip gapcoin-cli

Strip gapcoin-qt:

Code:

cd qt

Code:

strip gapcoin-qt

Code:

cd

...

Running gapcoin-qt:

Terminal window (ctrl + alt + t) - copy and paste:

Code:

cd gapcoin/src/qt

Code:

./gapcoin-qt

DONE !

...

The Pi movie soundtrack is recommended listening whilst gapcoin-qt is compiling ...

- https://www.youtube.com/watch?v=k02KIOUU8Hw&list=PLD141E36B4DAC5F13

[holderwhale999]

http://dl4.joxi.net/drive/2020/06/01/0020/2282/1329386/86/e4940887e9.jpg

working )

[BitcoinFX]

Naturally, of course it's working ...  

For the non math experts, what is the advantage of solving these? This advances mathematics, and therefore technology, theories, and a general understanding of reality? How does this compare to the technology in XPM Primecoin?

The are many relations between prime numbers and our nature:
http://www.bbc.co.uk/news/magazine-14305667

In fact prime numbers are fascinating in many ways:

God may not play dice with the universe, but something strange is going on with the prime numbers.

Prime numbers are 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?

While Gapcoin searches for rare prime gaps,
Primecoin on the other hand searches for long prime chains:
http://en.wikipedia.org/wiki/Cunningham_chain
http://en.wikipedia.org/wiki/Primecoin

"Nature's hidden prime number code" ...
- https://www.bbc.co.uk/news/magazine-14305667

Prime numbers are found hidden in nature, but humans have made spectacular use of them, writes mathematician Marcus du Sautoy.

Ever since humans evolved on this planet we have been trying to make sense of the world around us.

We have attempted to explain why the world looks and behaves the way it does, to predict what the future holds. And in our search for answers we have uncovered a code that makes sense of the huge complexity that confronts us - mathematics.

By translating nature into the code of numbers we have revealed hidden structures and patterns that control our environment.

But not only that. By tapping into nature's code we have been able to change our surroundings, have built extraordinary cities, and developed amazing technology that has resulted in the modern world.

Buzzing quietly beneath the planet we inhabit is an unseen world of numbers, patterns and geometry. Mathematics is the code that makes sense of our universe.

In the forests of Tennessee this summer, part of this code literally bursts from the ground. Nashville is usually home to the sound of blue grass and honky tonk.

But every 13 years, the banjos and basses get drowned out for six weeks by the chorus of an insect that has fascinated me ever since I became a mathematician. Only found in the eastern areas of North America, this cicadas survival depends on exploiting the strange properties of some of the most fundamental numbers in mathematics - the primes, numbers that are only divisible by themselves and one.

The cicadas appear periodically but only emerge after a prime number of years. In the case of the brood appearing around Nashville this year, 13 years. The forests have been quiet for 12 years since the last invasion of these mathematical bugs in 1998 and the locals won't be disturbed by them again until 2024.

This choice of a 13-year cycle doesn't seem too arbitrary. There are another two broods across north America that also have this 13-year life cycle, appearing in different regions and different years. In addition there are another 12 broods that appear every 17 years.

You could just dismiss these numbers as random. But it's very curious that there are no cicadas with 12, 14, 15, 16 or 18-year life cycles. However look at these cicadas through the mathematician's eyes and a pattern begins to emerge.

Because 13 and 17 are both indivisible this gives the cicadas an evolutionary advantage as primes are helpful in avoiding other animals with periodic behaviour. Suppose for example that a predator appears every six years in the forest. Then a cicada with an eight or nine-year life cycle will coincide with the predator much more often than a cicada with a seven-year prime life cycle.

These insects are tapping into the code of mathematics for their survival. The cicadas unwittingly discovered the primes using evolutionary tactics but humans have understood that these numbers not just the key to survival but are the very building blocks of the code of mathematics.

Every number is built by multiplying primes together and from numbers you get mathematics and from mathematics you get the whole of science.

But humans haven't been content simply with observing the importance of these numbers to nature. By understanding the fundamental character of these numbers and exploring their properties humans have literally put them at the heart of the codes that currently protect the world's cyber-secrets.

The cryptography that keeps our credit cards secure when we shop online exploits the same numbers that protect the cicadas in North America - the primes.

Every time you send your credit card number to a website your are depending on primes to keep your details secret. To encode your credit card number your computer receives a public number N from the website, which it uses to perform a calculation with your credit card number.

This scrambles your details so that the encoded message can be sent across the internet. But to decode the message the website uses the primes which divide N to undo the calculation. Although N is public, the primes which divide N are the secret keys which unlock the secret.

The reason this is so secure is that although it is easy to multiply two prime numbers together it is almost impossible to pull them apart. For example no one has been able to find the two primes which divide the following 617-digit number:

25,195,908,475,657,893,494,027,183,240,048,398,571,429,282,126,204,

032,027,777,137,836,043,662,020,707,595,556,264,018,525,880,784,406,

918,290,641,249,515,082,189,298,559,149,176,184,502,808,489,120,072,

844,992,687,392,807,287,776,735,971,418,347,270,261,896,375,014,971,

824,691,165,077,613,379,859,095,700,097,330,459,748,808,428,401,797,

429,100,642,458,691,817,195,118,746,121,515,172,654,632,282,216,869,

987,549,182,422,433,637,259,085,141,865,462,043,576,798,423,387,184,

774,447,920,739,934,236,584,823,824,281,198,163,815,010,674,810,451,

660,377,306,056,201,619,676,256,133,844,143,603,833,904,414,952,634,

432,190,114,657,544,454,178,424,020,924,616,515,723,350,778,707,749,

817,125,772,467,962,926,386,356,373,289,912,154,831,438,167,899,885,

040,445,364,023,527,381,951,378,636,564,391,212,010,397,122,822,120,

720,357

The primes are the atoms of the arithmetic. The hydrogen and oxygen of the world of numbers.

But despite their fundamental character they also represent one of the greatest enigmas in mathematics. Because as you count through the universe of numbers it is almost impossible to spot a pattern that will help you to predict where the next prime will be found.

We know primes go on for ever but finding a pattern in the primes is one of the biggest mysteries in mathematics. A million-dollar prize has been offered to anyone who can reveal the secret of these numbers.

Despite having cracked so much of nature's code the primes are as much an enigma today as when the cicadas in the forests of Tennessee first tapped into them for their evolutionary survival.

Source: - https://www.bbc.co.uk/news/magazine-14305667

...

Miley Cyrus - Party In The U.S.A.
- https://youtu.be/M11SvDtPBhA

 

...

Gapcoin = Bitcoin + fundamental laws of nature ...

"Magic internet money" - who knew?

Periodical cicadas - Magicicada ...
- https://en.wikipedia.org/wiki/Periodical_cicadas

Cicada 3301
- https://en.wikipedia.org/wiki/Cicada_3301

*Shrugs*