TillKoeln
Legendary
Offline
Activity: 2058
Merit: 1050
unnamed.Exchange, join the Cool Kids!!!


November 22, 2020, 08:50:40 PM Last edit: November 22, 2020, 09:18:23 PM by TillKoeln Merited by BitcoinFX (3), MagicByt3 (1) 









Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction. Advertise here.

BitcoinFX
Legendary
Offline
Activity: 2422
Merit: 1558
https://youtu.be/DsAVx0u9Cw4 ... Dr. WHO < KLF


November 22, 2020, 11:13:29 PM 





binkchaindev
Newbie
Offline
Activity: 4
Merit: 0


December 01, 2020, 11:58:35 PM 

Is anyone using older model amd GPU's to effectively mine this thing?




BitcoinFX
Legendary
Offline
Activity: 2422
Merit: 1558
https://youtu.be/DsAVx0u9Cw4 ... Dr. WHO < KLF


December 02, 2020, 11:30:34 AM 

Is anyone using older model amd GPU's to effectively mine this thing?
I have mined Gapcoin with GPU's successfully in the past. Realize that the current GPU miner has not been tested and/or upgraded for newer GPU's and the prime sieve still utilizes CPU. GPU mining has not yet been necessitated through competition against the network difficulty. Most users are still mining with CPU's. As the network difficulty increases, Gapcoin will fine new Prime Gaps of highest merit. New development of GPU mining software and pooled mining will also enable Prime Gaps to be found in higher shifts. Gapcoin has never reached a higher network difficulty of 50. When we do, perhaps more people in crypto and mathematics will pay attention! N+1




holderwhale999
Copper Member
Newbie
Offline
Activity: 40
Merit: 0


December 11, 2020, 02:54:15 AM 

Is anyone using older model amd GPU's to effectively mine this thing?
i'm using RX480 4Gb)




CryptoInfluence
Newbie
Offline
Activity: 5
Merit: 0


December 11, 2020, 08:04:46 AM 

I definitely want to start mining some. So I can simply just do it from the Gapcoin wallet? Is it then joined into a pool or per user CPU power?





BitcoinFX
Legendary
Offline
Activity: 2422
Merit: 1558
https://youtu.be/DsAVx0u9Cw4 ... Dr. WHO < KLF


December 11, 2020, 10:11:37 AM 

I definitely want to start mining some. So I can simply just do it from the Gapcoin wallet? Is it then joined into a pool or per user CPU power?
Mining in the Gapcoin wallet is currently CPU solo mining only. At the current network difficulty you should find a block within 24 to 48 hours of mining approximately, with an average PC ...  https://gapcoin.club/windowsguisetup.phpPool mining can be done as per my guide in the link that @holderwhale999 presented in the above post. It is also possible to do GPU solo mining. Welcome! Good luck and Mind the Gap! ... I know, I have a very strange sense of humor ...




BitcoinFX
Legendary
Offline
Activity: 2422
Merit: 1558
https://youtu.be/DsAVx0u9Cw4 ... Dr. WHO < KLF


December 17, 2020, 08:02:48 AM 

FWIW: Alpha release of an implementation of the 0.16.3 reference client for the Gapcoin network: https://github.com/gjhiggins/gapcoincore/releases/tag/v0.1rcalpha, testnetonly while we test the robustness and reliability of the implementation. Linux, Windows64 and OSX binaries available. Client can be built from cloned github repos  https://github.com/gjhiggins/gapcoincore. Copy the provided gapcoin.conf into the data directory. (In order to have the mining page slider bar show the maximum threads available for your machine, comment out the genproclimit line or set a higher limit as desired). For Windows users, if you want to use a separate data directory for the 0.16.3 client such as C:\Users\<USER>\AppData\Roaming\GapcoinCore then click on "Properties" of a shortcut to the 0.16.3 client gapcoinqt.exe and add datadir=C:\Users\<USER>\AppData\Roaming\GapcoinCore at the end, e.g. C:\Program Files (x86)\Gapcoin\gapcoinqt.exe datadir=C:\Users\<USER>\AppData\Roaming\GapcoinCore. Please be advised  if not configured with testnet on the command line or testnet=1 in the config file, the 0.16.3 reference client will connect to the current mainnet and will act as a processing node but the more advanced/complex transactions created by the 0.16.3 client will not be recognized/process/broadcast by the current population on 0.9.4 clients and the originating 0.16.3 client will probably find itself on a singleton fork, necessitating zeroing of the data dir and subsequent resync (so don't try it). Cheers Graham Early indications are that changing the txindex setting requires a clearout of the datadir and a resync. Edit: I found that on Windows 10 at least, so when I created a testnetspecific shortcut, I needed to separate the arguments and surround them in double quotes (I'm using a Vagrant box VM, so I am user "Vagrant") and the entire content of the "Shortcut" field was: "C:\Program Files (x86)\Gapcoin\gapcoinqt.exe" "testnet" "datadir=C:\Users\Vagrant\AppData\Roaming\Gapcoin" gapcoin.club IMPORTANT advisory notification;Gapcoin users are reminded that the current (officially compatible) release of Gapcoin is v0.9.2 (for windows) and v.0.9.24 (for linux). It is NOT currently advisable for v0.9.x mainnet users to upgrade their Gapcoin wallets. The current 0.16.3rcalpha (testnet release candidate software) may not have full backwards compatibility with v0.9.x series wallets! An interim release might be required for users to more smoothly transition from v0.9.x wallets. Always backup your latest wallet.dat and your private keys.... Please check back for future update notifications from gapcoin.club




jvanname
Jr. Member
Offline
Activity: 100
Merit: 5


December 17, 2020, 08:36:24 PM Last edit: December 23, 2020, 06:45:29 PM by jvanname 

This is Joseph Van Name. I have a Ph.D. in mathematics, and I have been the only consistent researcher of Laver tables for the past few years. Gapcoin, Riecoin, and Primecoin are all cryptocurrencies with useful mining algorithms. But are these mining algorithms really that useful and are these mining algorithms really that efficient at producing scientific research?
These mining algorithms have some mathematical use, and computing prime number records is important, but their use is quite limited. You do not see professional mathematicians writing programs to compute the next prime number (edit: very often). Mathematics is a quite diverse discipline and most mathematicians are busy working on other things than prime numbers, and even fewer mathematicians are working on finding patterns in the set of all prime numbers. Furthermore, a cryptocurrency mining algorithm should only have one computational problem as its proof of work (for security, unless we have some advances in computer science). Therefore, mining algorithms have quite severe limitations to how they can be set up to solve important computational problems. Therefore a primebased mining algorithm will therefore have an extremely narrow scope of research advancement.
Have any mathematicians used the results of cryptocurrency mining to prove things or further research prime numbers in any way? Do the results of mining give any insight into number theory? Do the results of this computation have any practical applications? Did any professional mathematicians request for these sorts of cryptocurrencies to be created in order to enhance their research? Did mathematicians spend a significant amount of computational power computing these prime patterns before mining algorithms came along? No answers suggest that such mining algorithms are not very useful while yes answers suggest that the mining algorithms are useful. And the answers for these primebased mining algorithms are yes and no, so these mining algorithms have use in mathematical research but their use is limited.
These prime based mining algorithms are also a bit inefficient. Suppose that one has determined whether a number x is prime or not. Then the mining algorithm could be set up to determine whether x is a part of a prime constellation, but what if x is also a part of a long Cunningham chain? In that case, the computation of whether the number x is prime or not goes to waste since the mining algorithm does not reward anyone for testing whether it is a part of a Cunningham chain. This is not an insurmountable problem since one simply needs to make a mining algorithm that rewards entities for solving one out of several computational problems (and in this case one does not even have to have multiple difficulty levels for each of these individual problems).
So, the Laver tables arose from the very largest of large cardinals (large cardinals are exceedingly large levels of infinity) known as rankintorank cardinals (and also nhuge* cardinals). These large cardinals therefore since they are so far away cannot have any relevance to things we consider normal mathematics and they cannot have any practical applications. Except that Laver tables arise from these large cardinals and Laver tables are some of the most computationally intensive objects in mathematics.
So naturally, I would want to make a cryptocurrency with a Laver table based mining algorithm, but I decided not to pursue that area of research because I know that
1. not very many mathematicians are interested in Laver tables (there are no full time active researchers in this area),
2. the general public is not interested in Laver tables either, and
3. Laver tables may have some application to cryptography, but these cryptosystems have not been fully fleshed out yet, so this is only a potential application, so it is not worth spending potentially billions of dollars on a problem that may not have any practical applications.
When designing mining algorithms, one has to therefore be quite critical about the importance of the underlying computational problem.
The conclusion is that these primebased cryptocurrency mining algorithms are useful for advancing mathematics and understanding cryptocurrencies when the market capitalizations are in the millions of dollars or a hundred thousand dollars, but they are not so useful when the market capitalizations are in the billions of dollars. It would be better if the underlying problem were still very useful when the market capitalization were in the billions and the mining reward were high.




gjhiggins
Legendary
Offline
Activity: 2128
Merit: 1183

This is Joseph Van Name. I have a Ph.D. in mathematics, and I have been the only consistent researcher of Laver tables for the past few years.
And you choose to make a challenging post to an online SIG  you seem to be spoiling for an intellectual dustup  or at least a fine bonfire of straw men Gapcoin, Riecoin, and Primecoin are all cryptocurrencies with useful mining algorithms. But are these mining algorithms really that useful and are these mining algorithms really that efficient at producing scientific research?
Openly and clearly not  because the application's primary purpose is, and always has been, to act as a cryptocurrency. You do not see professional mathematicians writing programs to compute the next prime number.
You seem to be unaware of the work of the mersenne forum. OTOH, perhaps you're not unaware of them but your research has ruled them out as they universally fail to pass your undefined (and illconceived) criterion of "professional mathematician". Therefore, mining algorithms have quite severe limitations to how they can be set up to solve important computational problems. Therefore a primebased mining algorithm will therefore have an extremely narrow scope of research advancement.
In which, despite the liberal use of "therefore", the characterisations "quite severe", "important" and "extremely narrow" are baldly presented as unsupported opinion or even casual conjecture. As ever, you need to show your workingsout. Have any mathematicians used the results of cryptocurrency mining to prove things or further research prime numbers in any way?
You seem to misunderstand Gapcoin's approach  the proofofwork is based on searching for prime gaps of superior merit and Gapcoin currently holds the world record for the best merit, as published by the late Dr Tom Nicely of Lynchburg U a "professional mathematician" who in his time curated the list of first occurrence prime gaps, the list now maintained by a community of interested mathematicians (I cannot vouch for their professional status, alas) https://primegaplistproject.github.io/ Do the results of mining give any insight into number theory?
For Gapcoin, yes  it holds the world record ( https://en.wikipedia.org/wiki/Prime_gaps). For further information, see the Prime Gap Search Group section of the Mersenne Forum. These prime based mining algorithms are also a bit inefficient.
Well obviously. It's a nuanced use of a proofofwork calculation that is less wasteful that pure hashing. It's never pretended to be anything else. Suppose that one has determined whether a number x is prime or not. ... the mining algorithm does not reward anyone for testing whether it is a part of a Cunningham chain.
Not relevant to Gapcoin's prime gap PoW. So naturally, I would want to make a cryptocurrency with a Laver table based mining algorithm, but I decided not to pursue that area of research because I know that
Let me add another, courtesy of your good self: These mining algorithms have some mathematical use ... but their use is quite limited.
So, what was your purpose in posting this here? Cheers Graham





jvanname
Jr. Member
Offline
Activity: 100
Merit: 5


December 23, 2020, 09:24:10 PM 

gjhigginsThanks for the criticism and for the mathematical links. I consider Primecoin, Gapcoin, and Riecoin to be interesting and worthwhile projects that we can learn from both by studying the mathematical computations that arose from these projects and also by studying what it takes to make a useful cryptocurrency mining algorithm (for example, I have learned about Primecoin back in 2017 here https://www.youtube.com/watch?v=TipGy2bOVL4). My purpose in posting is not to discourage people from using these coins nor is it to be anything other than constructive. I currently want more people to mine Gapcoin. I realize that these coins are in a sense better than just pure hashing, but I am also pointing that these coins may be improved by making the miners work on several prime related problems simultaneously (but this is risky since a complicated algorithm could have bugs that present a security weakness). I want mining algorithms to be optimal at not just establishing consensus but also at solving important computational problems without compromising security. I want mathematicians and cryptographers to continue to research scientific mining algorithms, and this research starts by highlighting the positive aspects and potential pitfalls of Gapcoin and related cryptocurrencies. And you choose to make a challenging post to an online SIG  you seem to be spoiling for an intellectual dustup  or at least a fine bonfire of straw men \Smiley
I do not condone violence against straw men. They are people too. They have feelings. They feel pain. And I hope you know that you are supposed to end your sentence with a period instead of a smiley face. Openly and clearly not  because the application's primary purpose is, and always has been, to act as a cryptocurrency.
By 'useful', I clearly meant useful in other ways than simply establishing consensus. I decided to trade a thorough explanation of what I meant by 'useful' in exchange for brevity. In which, despite the liberal use of "therefore", the characterisations "quite severe", "important" and "extremely narrow" are baldly presented as unsupported opinion or even casual conjecture. As ever, you need to show your workingsout.
You are free to report my choice of words to the Modern Language Association. They may even send me to take a four hour word choice course or get points added my grammar record. But the joke is on you, because in that course, I will finally get to meet Donald Trump in that class. After all, Donald Trump uses words such as "tremendously", "huge" (I also use the word 'huge' since huge cardinals are a thing), "beautiful", and "best", so he will definitely be there. The main thing that you should have taken away from my post is that Gapcoin will do a decent job at advancing understanding when the market cap and mining reward for Gapcoin are low. However, if the market cap for Gapcoin were hundreds of billions of dollars and the mining reward as a result was very high, then Gapcoin will not longer do a good job at advancing understanding since the principle of diminishing returns applies to scientific cryptocurrency mining algorithms as well https://en.wikipedia.org/wiki/Diminishing_returns. From my post, you should have also gotten a better appreciation for the diversity of mathematical research. It is not fair for a single type of computational problem in mathematics to be highlighted at the expense of all the other areas of mathematics, and if Gapcoin becomes really popular, then Gapcoin will do just that.




wizz13150
Jr. Member
Offline
Activity: 38
Merit: 5


December 24, 2020, 11:42:45 AM Last edit: December 24, 2020, 12:17:12 PM by wizz13150 

Hey, Be sure gjhiggins, BitcoinFX and the weak community are well aware of the limitations / issues / major stake that you are talking about. Unfortunately, we are experiencing a lack of GPU developers and mathematicians [...] at this point, despite the best wishes in the world... If you knew the history of Gapcoin, its developer and its community, it's true that your post would have been different, I think. But in general, although there are some better ideas than others, there are rarely bad ones. What you are saying here is true, but a fact already known and has been thought out. It's obvious to some. However, I disagree easily with some points like the market cap and mining reward, people are just and simply venal and just don't give a s**t until there is money on the table [...] This is a lot of information that you have unpacked here, just understand that each of them needs to be discussed in depth. If you want to discuss further, it's here : The thing is, (not a criticism, just a selfevident fact that falls on you one day or another) this is an 'open source' project. If you want to/can participate, you can freely and we will thank you for that. https://github.com/gapcoinprojectOtherwise, the ideas just go to the pile of ideas. And there is a BIG one. I'm not trying to be on the defensive, or to justify gjhiggins' answer, but just to replace the Gapcoin's situation. Give gjhiggins a real bone to chew on and he'll do miracles. We're just little monkeys randomly typing on typewriters, hoping to produce Shakespeare. Unfortunately, for the moment, the g is sticked. (cf Gapcoin Core 0.16.3 > About) People like you are necessary for this kind of project, but it's a lot of work. Thanks for your time, your efforts are still appreciated, don't give up ! Nice catch ! 1500$ Free




gjhiggins
Legendary
Offline
Activity: 2128
Merit: 1183


December 24, 2020, 05:22:21 PM Last edit: December 24, 2020, 07:47:44 PM by gjhiggins Merited by xandry (2), BitcoinFX (1) 

Thanks for the criticism and for the mathematical links.
And in return, thanks for your refreshingly mature response. I consider Primecoin, Gapcoin, and Riecoin to be interesting and worthwhile projects that we can learn from ... My purpose in posting is not to discourage people from using these coins nor is it to be anything other than constructive. I currently want more people to mine Gapcoin.
Oh good, thanks for clarifying that. I realize that these coins are in a sense better than just pure hashing, but I am also pointing that these coins may be improved by making the miners work on several prime related problems simultaneously (but this is risky since a complicated algorithm could have bugs that present a security weakness).
That's an interesting suggestion. Although bereft of the mathematical coherence of your particular suggestion, the approach of multialgo PoW has been adopted by a number of altcoins ( Myriadcoin is perhaps the most wellknown and there are other less wellknown examples such as Unitus) and it's possible that the engineering solutions to a multialgo (and multidifficulty) PoW approach might be adaptable to an approach that integrated the different prime search approaches of Gapcoin, Riecoin, Primecoin and their derivatives (e.g. Datacoin which uses Primecoin's PoW algo). Your concerns about securing the public ledger are indeed valid  Jonnie Frey, original developer of Gapcoin articulated his concerns about the thenextant implementation of Primecoin ... Gapcoin follows Riecoin’s way and uses enough MillerRabin tests with random bases to avoid composite numbers being accepted as Proof of Work, like Primecoin mistakenly could.
Not being an able, or even capable, mathematician, I'm not in a position to verify that his criticism of Primecoin is accurate, nor does Jonnie Frey provide any detail, so we're obliged to take that statement on trust. fwiw, Sunny King provided an accessible description of his approach in the stillavailable Primecoin white paperIn practice, the main issues seemed to revolve around pool mining as Jonnie Frey observed ... In Primecoin, which is searching for long prime chains, you can easily modify your miner to search for smaller chains. In fact, it is mostly about a simple onelineediting. As an example, just turn a 10 into a 7 in xolominer and you will get scads of 7chains, but your chance to find a block has diminished.
To avoid this, pools supply better payment for shares with longer chainlengths.
In Riecoin, it is even worse. Riecoin searches for prime tuples of length 6. Pools do accept tuples with less primes, but a 6tuple only can occur in certain places. (Look at this post for a detailed explanation.) 4tuples, by comparison, are more frequent. There are places, where a 4tuple can occur, but no 6tuple, which Riecoin truly needs. So pools have to check every submitted share whether the miner really searches for 6tuples or not. Those facts are what make it so hard to create a Prime or Riecoin pool.
I haven't researched these issues in detail because they apparently haven't presented significant impairement to the coins. Riecoin is currently in the process of migrating from a minimum of 6tuples to a minimum of 7tuples  details on the difference between versions are welldescribed on the Riecoin web site. BTW, the Riecoin Discord server is quite active and contains useful uptodate information  https://discord.gg/2sJEayCI want mining algorithms to be optimal at not just establishing consensus but also at solving important computational problems without compromising security. I want mathematicians and cryptographers to continue to research scientific mining algorithms, and this research starts by highlighting the positive aspects and potential pitfalls of Gapcoin and related cryptocurrencies.
As I understand it, Primecoin's contribution to number theory is very slight (this from Sunny King's white paper): “Primecoin is the first cryptocurrency on the market with nonhashcash proofofwork, generating additional potential scientific value from the mining work. This research is meant to pave the way for other proofofwork types with diverse scientific computing values to emerge.”Riecoin is less slight in that it offers an indirect contribution (according to Newscientist) by attempting to prove the null hypothesis: “Riecoin ... might find an example of a constellation that doesn’t fit with Riemann and so offer clues as to how to disprove it”As for Gapcoin, Jonnie Frey provides the following rationale: “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?”Unfortunately, I'm obliged to confess that I don't get why the prime gap search effort is being undertaken nor how it is a potential contribution to helping prove either the Twin Prime Conjecture or the Reimann Hypothesis. I do get that “many questions and conjectures remain unanswered” but I haven't yet encountered a straightforward explanation of the purpose of calculating record prime gaps and merits, there's not even an agreed null hyopthesis to prove. What's the point of the continual recordseeking? I can conjecture that the results might inform a statistical analysis that might in turn feed into an advance in number theory but that doesn't seem to be the way that number theorists are tackling the issue of formal characterisation (Terry Tao describes what I assume is a fairly typical approach in “Long Gaps between Primes: What's New”). Edit: but see postscriptMy lack of understanding has consequences. Setting higher shift values for the Gapcoin miner results in the calculation of fewer gaps but larger prime numbers as opposed to lower shift values resulting in more gaps between smaller primes. My naive view suggests that as merit is the key factor, more gaps with (potentially) greater merit are the most obvious target. More confusingly, I can't readily discern any size effect in the various conjectures  it's not as if anyone's saying “the really interesting results will start to appear when we start to use really big primes”  because the principle of calculating a gap's merit is explicitly designed to factor out the effect of prime digit size. Aaanyway, back to your suggestion ... By 'useful', I clearly meant useful in other ways than simply establishing consensus. I decided to trade a thorough explanation of what I meant by 'useful' in exchange for brevity.
Not at all unreasonable, there's a lot of room for discussion there and again, thanks for clarifying. Leaving aside the fact that from my diminished perspective (as I describe above) "usefulness" is rather opaque, am I correct in understanding that your suggestion implies the potential construction of a mapping between the pairs of primes produced by Gapcoin and both Primecoin's chains and Riecoin's prime constellations? I hope you'll forgive my ignorance but I can't even begin to hallucinate any common numerical ground between them, you'll need to provide some concrete math to connect them up. The main thing that you should have taken away from my post is that Gapcoin will do a decent job at advancing understanding when the market cap and mining reward for Gapcoin are low. However, if the market cap for Gapcoin were hundreds of billions of dollars and the mining reward as a result was very high, then Gapcoin will not longer do a good job at advancing understanding since the principle of diminishing returns applies to scientific cryptocurrency mining algorithms as well https://en.wikipedia.org/wiki/Diminishing_returns. It's not been demonstrated that the principle of diminishing returns applies to  let's be specific here  PoW algos based on prime number calculation. In this you are at odds with Jonny Frey who maintained that more mining = higher difficulty = more records: “if the difficulty reaches 35.4245, every block will be a new world record”. It is not fair for a single type of computational problem in mathematics to be highlighted at the expense of all the other areas of mathematics, and if Gapcoin becomes really popular, then Gapcoin will do just that.
That's a pretty big (and in the current context, rather unlikely) “if”. Gapcoin has had quite a long trajectory and successive halvings have brought down the perblock reward to just 2.73 GAP, that's going to be a challenging place from which to start attracting large numbers of new miners. Cheers Graham Edit: Aha, Tom Nicely's list of prime gaps is credited in Kourbatov's 2018 paper “On the nth Record Gap Between Primes in an Arithmetic Progression” published in the International Mathematical Forum ( http://www.mhikari.com/imf/imf2018/142018/p/kourbatovIMF142018.pdf) which does include statistical analysis ... “We will attempt to answer these questions using heuristics and statistical analysis of numerical results.” So there is some support for viewing the list of prime gaps as a usable dataset which is usefully extended.




BitcoinFX
Legendary
Offline
Activity: 2422
Merit: 1558
https://youtu.be/DsAVx0u9Cw4 ... Dr. WHO < KLF


December 28, 2020, 06:29:53 PM Last edit: January 03, 2021, 04:44:38 PM by BitcoinFX Merited by TheGodFather (2) 

...snip... Edit: Aha, Tom Nicely's list of prime gaps is credited in Kourbatov's 2018 paper “On the nth Record Gap Between Primes in an Arithmetic Progression” published in the International Mathematical Forum ( http://www.mhikari.com/imf/imf2018/142018/p/kourbatovIMF142018.pdf) which does include statistical analysis ... “We will attempt to answer these questions using heuristics and statistical analysis of numerical results.” So there is some support for viewing the list of prime gaps as a usable dataset which is usefully extended. Excerpt: "Reality check. Computations of Oliveira e Silva, Herzog and Pardi [16] and, more recently, Jacobsen, Nair, and others [15] established the actual size of the nth record prime gap ... The actual prime gaps indeed turn out to satisfy."Interesting reading, as well as the Referenced sources; " [1] B. C. Arnold, N. Balakrishnan, H. N. Nagaraja, Records, John Wiley and Sons, Inc. 1998. https://doi.org/10.1002/9781118150412
[2] R. C. Baker, G. Harman, J. Pintz, The difference between consecutive primes, II, Proceedings of the London Mathematical Society, 83 (2001), no. 3, 532–562. https://doi.org/10.1112/plms/83.3.532
[3] H. Cram ́er, On the order of magnitude of the difference between consecutive prime numbers, Acta Arith., 2 (1936), 23–46. https://doi.org/10.4064/aa212346
[4] P. G. L. Dirichlet, Beweis des Satzes, dass jede unbegrenzte arithmetische Progression, deren erstes Glied und Differenz ganze Zahlen ohne gemeinschaftlichen Factor sind, unendlich viele Primzahlen enth ̈alt, Abhandlungen der K ̈oniglichen Preußischen Akademie der Wissenschaften zu Berlin, 48(1837), 45–71. English translation: http://arxiv.org/abs/0808.1408
[5] K. Ford, B. Green, S. Konyagin, J. Maynard, T. Tao, Long gaps between primes, Journal of the American Mathematical Society, 31 (2017), 65105. https://doi.org/10.1090/jams/876
[6] J. B. Friedlander and D. A. Goldston, Variance of distribution of prime sin residue classes, Quart. J. Math., 47 (1996), 313–336. https://doi.org/10.1093/qmath/47.3.313
[7] A. Granville, Harald Cram ́er and the distribution of prime numbers, Scandinavian Actuarial Journal, 1995 (1995), 12–28. https://doi.org/10.1080/03461238.1995.10413946
[8] E. J. Gumbel, Statistics of Extremes, Columbia University Press, 1958.
[9] A. Kourbatov, Maximal gaps between prime ktuples: a statistical approach, Journal of Integer Sequences, 16 (2013), Article 13.5.2. http://arxiv.org/abs/1301.2242
[10] A. Kourbatov, Is there a limiting distribution of maximal gaps between primes? Poster presentation at DIMACS Conference on Challenges of Identifying Integer Sequences, 2014. http://www.javascripter.net/math/publications/AKourbatovOEIS50poster.pdf
[11] A. Kourbatov, The distribution of maximal prime gaps in Cram ́er’s probabilistic model of primes, Int. Journal of Statistics and Probability, 3 (2014), no. 2, 18–29. https://doi.org/10.5539/ijsp.v3n2p18
[12] A. Kourbatov, On the distribution of maximal gaps between primes in residue classes, (2016), arXiv preprint. http://arxiv.org/abs/1610.03340
[13] J. Krug, Records in a changing world, J. Stat. Mech.: Theory and Experiment, 2007 (2007), P07001. https://doi.org/10.1088/17425468/2007/07/p07001
[14] J. Li, K. Pratt, G. Shakan, A lower bound for the least prime in anarithmetic progression, The Quarterly Journal of Mathematics, 68 (2017), 729758. https://doi.org/10.1093/qmath/hax001
[15] T. R. Nicely, First Occurrence Prime Gaps, preprint, 2017. Available at hxxp://www.trnicely.net/gaps/gaplist.html  https://faculty.lynchburg.edu/~nicely/gaps/gaplist.html
[16] T. Oliveira e Silva, S. Herzog and S. Pardi, Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4·1018, Math. Comp., 83 (2014), 20332060. https://doi.org/10.1090/s002557182013027871
[17] J. Pintz, Cram ́er vs Cram ́er: On Cram ́er’s probabilistic model of primes, Functiones et Approximatio Commentarii Mathematici, 37 (2007), no. 2,361–376. https://doi.org/10.7169/facm/1229619660
[18] S. I. Resnick, Record values and maxima, The Annals of Probability, 1 (1973), 650–662. https://doi.org/10.1214/aop/1176996892
[19] S. I. Resnick, Limit laws for record values, Stochastic Processes and Their Applications, 1 (1973), 67–82. https://doi.org/10.1016/03044149(73)900331
[20] C. Rivera (ed.), Conjecture 77. Gaps between primes of the form p = q n + r, 2016. http://www.primepuzzles.net/conjectures/conj077.htm
[21] D. Shanks, On maximal gaps between successive primes, Math. Comp.,18 (1964), 646–651. https://doi.org/10.1090/s00255718196401674728
[22] N. J. A. Sloane (ed.), The OnLine Encyclopedia of Integer Sequences,2015. Published electronically at http://oeis.org/ Sequences A005250, A084162, A268799, A268925, A268928, A268984, A269234, A269238, A269261, A269420, A269424, A269513, A269519.
[23] M. Wolf, Some heuristics on the gaps between consecutive primes, (2011), arXiv preprint. http://arxiv.org/abs/1102.0481
[24] M. Wolf, Nearest neighbor spacing distribution of prime numbers and quantum chaos, Phys. Rev. E,89 (2014), 022922. https://doi.org/10.1103/physreve.89.022922 "
In terms of Gapcoin's results ("the list of prime gaps as a usable dataset"), we can see that certain shifts have been mined much more extensively than others. See Help (tab) > Record prime gaps in the v0.9.4 release, for example. This is due to the original and established efficient 'default' settings for the builtin CPU (and GPU) miners ... namely ... Shifts 20, 25, 32, 64, 512, 896, 1024 ... Ignoring the coin part of Gapcoin and just looking at the gap records, the shift determines the size of the primes examined. Shift 25 is finding gaps in the 5k6k range, which Gapcoin has done a lot of work in. Shift 512 in the 12k17k range. Shift 896 18k24k. Shift 1024 20k28k. Ranges very approximate.
The higher gap lengths have lower merits, making records easier to find, but take longer to calculate and find. Other shift amounts, especially larger than 25, are more likely to find new records since the threshold is lower. Presumably one doesn't want to do this at the expense of coin return however (there are tools that are much better than Gapcoin at finding records, but they don't have coins).
Generally, less blocks will be mined at the higher shifts. Whilst the network difficulty is comparatively low and we work towards new mining software it may be interesting to set proof of work at a variety of slightly lower shifts ... herewith some examples for single core (or more) CPU systems ... Note optimal 'default': Header shift 25 , Sieve size: 33554432 , Primes in sieve: 900000 > setgenerate true 1 1048576 900000 20 low gapsperday > setgenerate true 1 2097152 900000 21 low gapsperday > setgenerate true 1 4194304 900000 22> setgenerate true 1 8388608 900000 23> setgenerate true 1 16777216 900000 24> setgenerate true 1 33554432 900000 25 > setgenerate true 1 67108864 900000 26> setgenerate true 1 134217728 900000 27etc., ... Higher shifts are best with the ctr, as per Jonnie Frey's original documentation / recommended sets ... :: Mining with the Chinese Remainder Theorem
fig. 1
:: 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: :: :: :: calcctr Indicates that we want to calculate a ctr file. :: :: ctrstrength This is used to variate the computing time spend :: within the greedy algorithm. Higher strength :: can yield better results. :: :: ctrprimes 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). :: :: ctrevolution Whether to use the evolutionary algorithm or not. :: :: ctrfixed 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. :: :: ctrivs The number of individuals used in the evolutionary algorithm. :: More increases computing time but mostly also the :: result quality. :: :: ctrrange Percent deviation from the number of primes. :: Useful if you don't want to look for a specific number :: of primes. :: :: ctrbits 256 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). :: :: ctrmerit The target merit (while testing the ctr it seamed that :: sieving for targetmerit  1 yields the best results) :: :: ctrfile 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. :: :: :: Example settings which were used to calculate the current ctr files: :: gapminercpu.exe calcctr ctrevolution ctrfixed 8 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 10 ctrprimes 14 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 8 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 13 ctrprimes 19 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 10 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 13 ctrprimes 24 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 10 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 12 ctrprimes 29 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 11 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 9 ctrprimes 34 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 11 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 12 ctrprimes 38 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 11 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 14 ctrprimes 42 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 11 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 15 ctrprimes 46 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 12 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 16 ctrprimes 50 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 12 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 9 ctrprimes 55 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 12 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 16 ctrprimes 58 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 12 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 16 ctrprimes 62 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 12 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 15 ctrprimes 66 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 12 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 13 ctrprimes 70 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 13 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 11 ctrprimes 74 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 13 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 9 ctrprimes 78 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 13 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 15 ctrprimes 81 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 13 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 12 ctrprimes 85 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 13 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 17 ctrprimes 88 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 13 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 14 ctrprimes 92 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 14 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 10 ctrprimes 96 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 14 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 15 ctrprimes 99 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 14 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 10 ctrprimes 103 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 14 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 15 ctrprimes 106 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 14 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 10 ctrprimes 110 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 14 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 14 ctrprimes 113 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 14 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 9 ctrprimes 117 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 15 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 13 ctrprimes 120 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 15 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 17 ctrprimes 122 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 15 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 11 ctrprimes 127 t 4 ctrfile myctrfile.txt :: gapminercpu.exe calcctr ctrevolution ctrfixed 15 ctrstrength 150000 ctrmerit 22 ctrivs 1000 ctrrange 0 ctrbits 15 ctrprimes 130 t 4 ctrfile myctrfile.txt
fig. 2
::::::::::::::::::::::::::::::::::::::: :: choose your preferred mining method: :: :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: :: Mining with the Chinese Remainder Theorem (solo mining examles) :: :: Shift 64 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 64 crt crt/crt22m64s.txt threads 4 fermatthreads 1 sieveprimes 50000 :: :: Shift 96 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 96 crt crt/crt22m96s.txt threads 4 fermatthreads 1 sieveprimes 50000 :: :: Shift 128 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 128 crt crt/crt22m128s.txt threads 4 fermatthreads 1 sieveprimes 50000 :: :: Shift 160 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 160 crt crt/crt22m160s.txt threads 4 fermatthreads 1 sieveprimes 100000 :: :: Shift 192 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 192 crt crt/crt22m192s.txt threads 4 fermatthreads 1 sieveprimes 100000 :: :: Shift 224 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 224 crt crt/crt22m224s.txt threads 4 fermatthreads 1 sieveprimes 100000 :: :: Shift 256 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 256 crt crt/crt22m256s.txt threads 4 fermatthreads 1 sieveprimes 100000 :: :: Shift 288 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 288 crt crt/crt22m288s.txt threads 4 fermatthreads 1 sieveprimes 300000 :: :: Shift 320 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 320 crt crt/crt22m320s.txt threads 4 fermatthreads 1 sieveprimes 300000 :: :: Shift 352 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 352 crt crt/crt22m352s.txt threads 4 fermatthreads 1 sieveprimes 300000 :: :: Shift 384 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 384 crt crt/crt22m384s.txt threads 4 fermatthreads 1 sieveprimes 500000 :: :: Shift 416 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 416 crt crt/crt22m416s.txt threads 4 fermatthreads 1 sieveprimes 500000 :: :: Shift 448 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 448 crt crt/crt22m448s.txt threads 4 fermatthreads 1 sieveprimes 500000 :: :: Shift 480 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 480 crt crt/crt22m480s.txt threads 4 fermatthreads 1 sieveprimes 500000 :: :: Shift 512 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 512 crt crt/crt22m512s.txt threads 4 fermatthreads 1 :: :: Shift 544 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 544 crt crt/crt22m544s.txt threads 4 fermatthreads 1 :: :: Shift 576 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 576 crt crt/crt22m576s.txt threads 4 fermatthreads 1 :: :: Shift 608 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 608 crt crt/crt22m608s.txt threads 4 fermatthreads 1 :: :: Shift 640 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 640 crt crt/crt22m640s.txt threads 4 fermatthreads 1 :: :: Shift 672 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 672 crt crt/crt22m672s.txt threads 4 fermatthreads 1 :: :: Shift 704 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 704 crt crt/crt22m704s.txt threads 4 fermatthreads 1 :: :: Shift 736 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 736 crt crt/crt22m736s.txt threads 4 fermatthreads 1 :: :: Shift 768 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 768 crt crt/crt22m768s.txt threads 4 fermatthreads 1 :: :: Shift 800 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 800 crt crt/crt22m800s.txt threads 4 fermatthreads 1 :: :: Shift 832 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 832 crt crt/crt22m832s.txt threads 4 fermatthreads 1 :: :: Shift 864 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 864 crt crt/crt22m864s.txt threads 4 fermatthreads 1 :: :: Shift 896 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 896 crt crt/crt22m896s.txt threads 4 fermatthreads 1 :: :: Shift 928 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 928 crt crt/crt22m928s.txt threads 4 fermatthreads 1 :: :: Shift 992 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 992 crt crt/crt22m992s.txt threads 4 fermatthreads 1 :: :: Shift 1024 :: gapminercpu.exe localhost p 31397 u <rpcuser> x <rpcpassword> shift 1024 crt crt/crt22m1024s.txt threads 4 fermatthreads 1 :: :: ::::::::::::::::::::::::::::::::::::::::::::::: :: Mining without the Chinese Remainder Theorem :: :: stratum (recommend) :: gapminercpu.exe o yourpool . club p 3385 u user.worker x password t 4 stratum :: :: getwork :: gapminercpu.exe o http:// yourpool . club p 4200 u user.worker x password t 4 :: :: solo mining :: gapminercpu.exe o 127.0.0.1 p 31397 u <rpc user> x <rpc password> t 4
...
More on this soon ...
... If we don't see additional community interest and an increase in hashing power in 2021 and beyond then it maybe prudent to create a mining consortium to see what additional prime gap records Gapcoin will acheive. If this is going to be a Prime Gap of maximum known merit vs an Economic Tragedy of the commons type of affair, then so BTCe it! ...  https://en.wikipedia.org/wiki/Prime_gap#Numerical_results https://en.wikipedia.org/wiki/Tragedy_of_the_commons... *Satire* Pi (10/12) Movie CLIP  We Got the Gun (1998) HD *NSFW* https://www.youtube.com/watch?v=XobjkWljkXw




minerja


January 23, 2021, 06:44:21 PM 

Hi, I'm trying to make the linux wallet on Ubuntu 20.10 When i get to this bit sudo aptget install softwarepropertiescommon sudo addaptrepository ppa:bitcoin/bitcoin sudo aptget update sudo aptget install libdb4.8dev libdb4.8++dev It fails sudo addaptrepository ppa:bitcoin/bitcoin Repository: 'deb http://ppa.launchpad.net/bitcoin/bitcoin/ubuntu/ groovy main' Description: NOT MAINTAINED. The OSlibrary linking packages here had a series of issues. PLEASE DOWNLOAD DIRECTLY FROM bitcoincore.org (and verify the signatures of said files). IF YOU WANT AUTOUPDATES, please see the officiallymaintained snap package  https://github.com/bitcoincore/packaging/tree/master/snapMore info: https://launchpad.net/~bitcoin/+archive/ubuntu/bitcoinAdding repository. Press [ENTER] to continue or Ctrlc to cancel. Found existing deb entry in /etc/apt/sources.list.d/bitcoinubuntubitcoingroovy.list Adding deb entry to /etc/apt/sources.list.d/bitcoinubuntubitcoingroovy.list Found existing debsrc entry in /etc/apt/sources.list.d/bitcoinubuntubitcoingroovy.list Adding disabled debsrc entry to /etc/apt/sources.list.d/bitcoinubuntubitcoingroovy.list Adding key to /etc/apt/trusted.gpg.d/bitcoinubuntubitcoin.gpg with fingerprint C70EF1F0305A1ADB9986DBD8D46F45428842CE5E Ign:1 cdrom://Ubuntu 20.10 _Groovy Gorilla_  Release amd64 (20201022) groovy InRelease Hit:2 cdrom://Ubuntu 20.10 _Groovy Gorilla_  Release amd64 (20201022) groovy Release Hit:3 http://gb.archive.ubuntu.com/ubuntu groovy InRelease Ign:4 http://ppa.launchpad.net/bitcoin/bitcoin/ubuntu groovy InRelease Get:5 http://security.ubuntu.com/ubuntu groovysecurity InRelease [110 kB] Get:6 http://gb.archive.ubuntu.com/ubuntu groovyupdates InRelease [115 kB] Err:7 http://ppa.launchpad.net/bitcoin/bitcoin/ubuntu groovy Release 404 Not Found [IP: 91.189.95.85 80] Get:9 http://gb.archive.ubuntu.com/ubuntu groovybackports InRelease [101 kB] Reading package lists... Done E: The repository ' http://ppa.launchpad.net/bitcoin/bitcoin/ubuntu groovy Release' does not have a Release file. N: Updating from such a repository can't be done securely, and is therefore disabled by default. N: See aptsecure( manpage for repository creation and user configuration details. Can anyone give me some simple instructions to follow? Thanks J




BitcoinFX
Legendary
Offline
Activity: 2422
Merit: 1558
https://youtu.be/DsAVx0u9Cw4 ... Dr. WHO < KLF


January 25, 2021, 12:21:12 PM Last edit: February 02, 2021, 05:42:49 PM by BitcoinFX 

Hey minerja, Remember that we are very much between historical Bitcoin builds in terms of Gapcoin releases at the moment. Running Gapcoin and mining on Ubuntu 18.04 LTS would currently be my recommendation.However, I will get around to testing / adding updated build instructions for Ubuntu 20. Have you tried building the Berkley DB for yourself ?  https://bitcointalk.org/index.php?topic=822498.msg54524230#msg54524230Bear in mind that the current repos might need fixes for Ubuntu 20.10 sudo aptget install libdbdev sudo aptget install libdb++dev The above will install the current Berkley DB for your OS (a higher / incompatible version e.g. BerkeleyDB 5.1 or later), so be careful and ... Always backup your wallet.dat and your private keys!




gjhiggins
Legendary
Offline
Activity: 2128
Merit: 1183


January 25, 2021, 12:37:04 PM 

I'm trying to make the linux wallet on Ubuntu 20.10 It fails sudo addaptrepository ppa:bitcoin/bitcoin Repository: 'deb http://ppa.launchpad.net/bitcoin/bitcoin/ubuntu/ groovy main' Description: NOT MAINTAINED. The OSlibrary linking packages here had a series of issues. Can anyone give me some simple instructions to follow? Ubuntu and Debian have their own `libdbdev` and `libdb++dev` packages, but these will install BerkeleyDB 5.1 or later. This will break binary wallet compatibility with the distributed executables, which are based on BerkeleyDB 4.8. If you do not care about wallet compatibility, pass `withincompatiblebdb` to configure.
There are two main ways to proceed. If you need to preserve wallet compatibility with distributed Gapcoin executables, then do a "depends" build, following the instructions in depends/README.md, using HOST=x86_64linuxgnu, i.e: cd depends make HOST=x86_64linuxgnu cd .. ./autogen.sh CONFIG_SITE=$PWD/depends/x86_64linuxgnu/share/config.site ./configure prefix=/ make
Otherwise, if you're just building for yourself, use sudo apt install libdbdev libdb++dev and add withincompatiblebdb to the options to configure. Cheers Graham




BitcoinFX
Legendary
Offline
Activity: 2422
Merit: 1558
https://youtu.be/DsAVx0u9Cw4 ... Dr. WHO < KLF


January 25, 2021, 01:30:21 PM 

This ^ Thanks Graham! and for only gapcoind and gapcoincli (without QT/GUI and UPNP) ... Example; cd depends make NO_QT=1 NO_UPNP=1 cd .. ./autogen.sh ./configure withoutgui withoutminiupnpc disabletests make
withincompatiblebdb etc.,




