I found the full technical report describing the LOCKSS forerunner to bitcoin available for downloaded at [1]. Interestingly, LOCKSS used a memory bound Proof-of-Work, where both prover and verifier perform a random walk in a 1GB table. But the prover had to do this many times, to obtain some final hash with many leading zeroes. This was before the invention of asymmetric PoW systems like Cuckoo Cycle [2] where the PoW can be verified with no memory use.<p>> Nakamoto's scheme motivated early adoption by rapidly inflating the currency with large block rewards, then exponentially decreasing them, so he could claim the currency was non-inflationary (eventually). The result was that early adopters accumulated large numbers of Bitcoin, and the Gini coefficients of cryptocurrencies became extreme.<p>Technically, exponentially decreasing rewards is not necessary for a finite cap on supply. Anything reduction factor of at least n * logn * loglogn * logloglogn * ... * 2 would do, e.g. Initial_Reward / epoch^2.
That would also reduce the advantage of early adopters.<p>Nearly all cryptocurrencies, even ones with uncapped supply, suffer from outsized rewards for early miners/adopters.<p>[1] <a href="https://www.researchgate.net/publication/31869581_Preserving_Peer_Replicas_by_Rate-Limited_Sampled_Voting_in_LOCKSS" rel="nofollow">https://www.researchgate.net/publication/31869581_Preserving...</a><p>[2] <a href="https://github.com/tromp/cuckoo">https://github.com/tromp/cuckoo</a>