Re: [ANN][GAP] Gapcoin - Prime Gap Search - New Math Algo - CPU / GPU - Zero Premine
Mr. Higgins, I look forward to seeing if the Gapcoin.org so called Sept. 2019 Gap Records is accurate from your work or if we are dealing with improper records which could lead to lots of other factors surrounding other things.
When you get your work ported to your gjhiggins/gapcoin github I will update all my nodes.
Nice work sorting out the SSL 1.1 mess hope it all checks out. So your able to build using the newest Ubuntu?
It is not good that posts disappear without a trace there should be a small line with a Post has been deleted and by which user and the reason visible to everyone why it was taken down.
Hopefully someone can pay bitcoin for the blockchain explorer but buying bitcoin personally is somewhat not possible.
When you get your work ported to your gjhiggins/gapcoin github I will update all my nodes.
Nice work sorting out the SSL 1.1 mess hope it all checks out. So your able to build using the newest Ubuntu?
It is not good that posts disappear without a trace there should be a small line with a Post has been deleted and by which user and the reason visible to everyone why it was taken down.
Hopefully someone can pay bitcoin for the blockchain explorer but buying bitcoin personally is somewhat not possible.
Currently testing if Ubuntu / Debian wallets build etc.,
...
... "How is Proof of Work actually designed?
A PoW algorithm has to fit two specifications:
It must be cryptographically secure (a PoW must not be reusable)
It must be hard to calculate, but easy to verify
Verifying a prime gap is easy, you only have to check every number between the start and the end to be composite.
Calculating is harder, much harder! " ...
Source : gapcoin.org
This ^
Hard math is hard !
...
Bitcoin = Difficult to solve, easy to check !
Gapcoin = Difficult to solve, harder to calculate, easy to check !
...
Gapcoin is forefront of mathematical discovery.
No one has dismissed Gapcoin results as invalid.
Very smart folks (mathematician's) have confirmed Gapcoin's results and it's MERITS.
...
The crux of the matter remains here, as correctly identified by gjhiggins ...
fwiw Dept:
As part of my attempts to resolve the apparent contradiction between the assertions about how primes are filtered in Gapcoin [1] and how that's done in the actual PoWCore source code, I scraped j0nn9's posts to this, the Gapcoin thread, sorted them into ascending order and rendered the result as a standalone page of HTML that I have published as a github gist which can be saved and opened in a browser:
https://gist.github.com/gjhiggins/75073257527aa6304b3913688f2b46c8
[1] Gapcoin follows Riecoin's way and uses enough Miller-Rabin tests with random bases to avoid composite numbers being accepted as Prove of Work.
Added:
In an effort after greater clarity, I distilled and categorised the posts, rendering them as a page of HTML that uses jquery and semantic-ui to present the posts in a series of accordion (drop-down) sections for ease of consumption: https://gist.github.com/gjhiggins/dded25cb7a6d46531a3c8bd52074bde4
BTW, I found out what [1] was about and annotated my own copy of Gapcoin-PoWCore's PoW.cpp (https://github.com/gapcoin/Gapcoin-PoWCore/blob/06ac3fea780997232e9d5c78bfaf34d72e1b4e13/src/PoW.cpp#L130) with the docs of the gmplib functions mpz_probab_prime_p and mpz_nextprime:
(In case anyone other than me is interested.)
Cheers
Graham
As part of my attempts to resolve the apparent contradiction between the assertions about how primes are filtered in Gapcoin [1] and how that's done in the actual PoWCore source code, I scraped j0nn9's posts to this, the Gapcoin thread, sorted them into ascending order and rendered the result as a standalone page of HTML that I have published as a github gist which can be saved and opened in a browser:
https://gist.github.com/gjhiggins/75073257527aa6304b3913688f2b46c8
[1] Gapcoin follows Riecoin's way and uses enough Miller-Rabin tests with random bases to avoid composite numbers being accepted as Prove of Work.
Added:
In an effort after greater clarity, I distilled and categorised the posts, rendering them as a page of HTML that uses jquery and semantic-ui to present the posts in a series of accordion (drop-down) sections for ease of consumption: https://gist.github.com/gjhiggins/dded25cb7a6d46531a3c8bd52074bde4
BTW, I found out what [1] was about and annotated my own copy of Gapcoin-PoWCore's PoW.cpp (https://github.com/gapcoin/Gapcoin-PoWCore/blob/06ac3fea780997232e9d5c78bfaf34d72e1b4e13/src/PoW.cpp#L130) with the docs of the gmplib functions mpz_probab_prime_p and mpz_nextprime:
Code:
/* start has to be a prime */
/*
Function: int mpz_probab_prime_p (const mpz_t n, int reps)
Determine whether n is prime. Return 2 if n is definitely prime,
return 1 if n is probably prime (without being certain), or
return 0 if n is definitely non-prime.
This function performs some trial divisions, then reps
Miller-Rabin probabilistic primality tests. A higher reps value
will reduce the chances of a non-prime being identified as probably prime.
A composite number will be identified as a prime with a probability of less
than 4^(-reps). Reasonable values of reps are between 15 and 50.
*/
if (!mpz_probab_prime_p(mpz_start, 25)) {
mpz_clear(mpz_start);
return false;
}
mpz_init(mpz_end);
/*
Function: void mpz_nextprime (mpz_t rop, const mpz_t op)
Set rop to the next prime greater than op.
This function uses a probabilistic algorithm to identify primes.
For practical purposes its adequate, the chance of a composite
passing will be extremely small.
*/
mpz_nextprime(mpz_end, mpz_start);
return true;
/*
Function: int mpz_probab_prime_p (const mpz_t n, int reps)
Determine whether n is prime. Return 2 if n is definitely prime,
return 1 if n is probably prime (without being certain), or
return 0 if n is definitely non-prime.
This function performs some trial divisions, then reps
Miller-Rabin probabilistic primality tests. A higher reps value
will reduce the chances of a non-prime being identified as probably prime.
A composite number will be identified as a prime with a probability of less
than 4^(-reps). Reasonable values of reps are between 15 and 50.
*/
if (!mpz_probab_prime_p(mpz_start, 25)) {
mpz_clear(mpz_start);
return false;
}
mpz_init(mpz_end);
/*
Function: void mpz_nextprime (mpz_t rop, const mpz_t op)
Set rop to the next prime greater than op.
This function uses a probabilistic algorithm to identify primes.
For practical purposes its adequate, the chance of a composite
passing will be extremely small.
*/
mpz_nextprime(mpz_end, mpz_start);
return true;
(In case anyone other than me is interested.)
Cheers
Graham
Again, Numbers Go Up (and Down).
It still remains to be seen what Gapcoin can achieve out-of-the-box! Only very limited hashing power, relative to Bitcoin, has ever been thrown at Gapcoin and most of that was CPU based ... (again) imagine the ASIC's ...
"Difficulty adjusts every block and increases logarithmically (it will probably take years to get to 50)"
Source : gapcoin.org
In terms of Bitcoin mining difficulty we barely passed 1 .
A literal Gravity Well ...
- https://en.wikipedia.org/wiki/Gravity_well
... "Anything at the center of mass of a planet or moon is considered to be at the bottom of that celestial body's gravity well, and so escaping the effects of gravity from such a planet or moon (to enter outer space) is sometimes called "climbing out of the gravity well". The deeper a gravity well is, the more energy any space-bound "climber" must use to escape it. " ...