{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T19:16:42Z","timestamp":1778786202970,"version":"3.51.4"},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T00:00:00Z","timestamp":1548374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2019,1,25]]},"abstract":"<jats:p>In proof of work blockchain systems, there are strong incentives towards designing hardware that can mine faster and\/or with less power consumption. There are two ways of taking advantage of such devices: one can use them to mine more coins with less power, or he can sell it to other miners. The two strategies are not independent, of course: if everybody has the boosting technology, the difficulty will rise, and it won't be an advantage anymore. On the other hand, if the boost is above a certain threshold, being used only by a small subset of miners might mean centralizing the system, with potentially dangerous consequences on the platform credibility. In this paper we analyse the impact of different strategies to exploit a significant increase in mining hardware efficiency. To do so, we developed a multi-agent based simulator, that mimics the relevant mechanics of the mining ecosystem, as well as some features of the miners as economic actors. We then characterized different significant sell-it-or-mine-with-it strategies, and observed the simulated outcome.<\/jats:p>","DOI":"10.1145\/3308897.3308954","type":"journal-article","created":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T14:01:39Z","timestamp":1548684099000},"page":"127-130","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Mine with it or sell it"],"prefix":"10.1145","volume":"46","author":[{"given":"Francesco","family":"Bruschi","sequence":"first","affiliation":[{"name":"Politecnico di Milano, Milan, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"Rana","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Milan, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorenzo","family":"Gentile","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Milan, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donatella","family":"Sciuto","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Milan, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,1,25]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Advances in Cryptology | CRYPTO' 92, Ernest F","author":"Dwork Cynthia","unstructured":"Cynthia Dwork and Moni Naor . 1993. Pricing via Processing or Combatting Junk Mail . In Advances in Cryptology | CRYPTO' 92, Ernest F . Brickell (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 139--147. Cynthia Dwork and Moni Naor. 1993. Pricing via Processing or Combatting Junk Mail. In Advances in Cryptology | CRYPTO' 92, Ernest F. Brickell (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 139--147."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSPEC.2017.8048837"},{"key":"e_1_2_1_3_1","unstructured":"L. Gentile V. Rana and F. Bruschi. 2018. Incentive network simulator. (2018). https:\/\/github.com\/ lorenzogentile404\/incentive-network-simulator  L. Gentile V. Rana and F. Bruschi. 2018. Incentive network simulator. (2018). https:\/\/github.com\/ lorenzogentile404\/incentive-network-simulator"},{"key":"e_1_2_1_4_1","unstructured":"J. Kazil and N. Verzemnieks. 2018. MESA. (2018). https:\/\/github.com\/projectmesa\/mesa  J. Kazil and N. Verzemnieks. 2018. MESA. (2018). https:\/\/github.com\/projectmesa\/mesa"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2018.2861423"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"M. Sivanesan A. Chattopadhyay and R. Bajaj. 2018. Accelerating Hash Computations Through Efficient Instruction-Set Customisation. In 2018 31st International Conference on VLSI Design and 2018 17th International Conference on Embedded Systems (VLSID). 362--367.  M. Sivanesan A. Chattopadhyay and R. Bajaj. 2018. Accelerating Hash Computations Through Efficient Instruction-Set Customisation. In 2018 31st International Conference on VLSI Design and 2018 17th International Conference on Embedded Systems (VLSID). 362--367.","DOI":"10.1109\/VLSID.2018.91"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2017.3571056"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3308897.3308954","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3308897.3308954","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:58:03Z","timestamp":1750208283000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3308897.3308954"}},"subtitle":["the superhashing power dilemma"],"short-title":[],"issued":{"date-parts":[[2019,1,25]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,1,25]]}},"alternative-id":["10.1145\/3308897.3308954"],"URL":"https:\/\/doi.org\/10.1145\/3308897.3308954","relation":{},"ISSN":["0163-5999"],"issn-type":[{"value":"0163-5999","type":"print"}],"subject":[],"published":{"date-parts":[[2019,1,25]]},"assertion":[{"value":"2019-01-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}