Papers
Topics
Authors
Recent
Search
2000 character limit reached

Hopping-Proof and Fee-Free Pooled Mining in Blockchain

Published 25 Dec 2019 in cs.GT | (1912.11575v1)

Abstract: The pool-hopping attack casts down the expected profits of both the mining pool and honest miners in Blockchain. The mainstream countermeasures, namely PPS (pay-per-share) and PPLNS (pay-per-last-N-share), can hedge pool hopping, but pose a risk to the pool as well as the cost to miners. In this study, we apply the zero-determinant (ZD) theory to design a novel pooled mining which offers an incentive mechanism for motivating non-memorial and memorial evolutionary miners not to switch in pools strategically. In short, our hopping-proof pooled mining has three unique features: 1) fee-free. No fee is charged if the miner does not hop. 2) wide applicability. It can be employed in both prepaid and postpaid mechanisms. 3) fairness. Even the pool can dominate the game with any miner, he has to cooperate when the miner does not hop among pools. The fairness of our scheme makes it have long-term sustainability. To the best of our knowledge, we are the first to propose a hopping-proof pooled mining with the above three natures simultaneously. Both theoretical and experimental analyses demonstrate the effectiveness of our scheme.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.