Cobalt: Optimizing Mining Rewards in Proof-of-Work Network Games
- URL: http://arxiv.org/abs/2307.04695v1
- Date: Mon, 10 Jul 2023 16:50:58 GMT
- Title: Cobalt: Optimizing Mining Rewards in Proof-of-Work Network Games
- Authors: Arti Vedula, Abhishek Gupta and Shaileshh Bojja Venkatakrishnan
- Abstract summary: A key factor affecting mining rewards earned is the connectivity between miners in the peer-to-peer network.
We formulate the problem of deciding whom to connect to for miners as a bandit problem.
A key contribution of our work is the use of network coordinates based model for learning the network structure within the bandit algorithm.
- Score: 6.052883613180156
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Mining in proof-of-work blockchains has become an expensive affair requiring
specialized hardware capable of executing several megahashes per second at huge
electricity costs. Miners earn a reward each time they mine a block within the
longest chain, which helps offset their mining costs. It is therefore of
interest to miners to maximize the number of mined blocks in the blockchain and
increase revenue. A key factor affecting mining rewards earned is the
connectivity between miners in the peer-to-peer network. To maximize rewards a
miner must choose its network connections carefully, ensuring existence of
paths to other miners that are on average of a lower latency compared to paths
between other miners. We formulate the problem of deciding whom to connect to
for miners as a combinatorial bandit problem. Each node picks its neighbors
strategically to minimize the latency to reach 90\% of the hash power of the
network relative to the 90-th percentile latency from other nodes. A key
contribution of our work is the use of a network coordinates based model for
learning the network structure within the bandit algorithm. Experimentally we
show our proposed algorithm outperforming or matching baselines on diverse
network settings.
Related papers
- Manifoldchain: Maximizing Blockchain Throughput via Bandwidth-Clustered Sharding [8.782016890474873]
Bandwidth limitation is the major bottleneck that hinders scaling throughput of proof-of-work blockchains.
We propose Manifoldchain, a sharding protocol that alleviates the impact of slow miners to maximize blockchain throughput.
arXiv Detail & Related papers (2024-07-23T08:52:51Z) - The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.
Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol.
We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
arXiv Detail & Related papers (2024-07-16T20:53:04Z) - Targeted Nakamoto: A Bitcoin Protocol to Balance Network Security and Energy Consumption [0.0]
Targeted Nakamoto is a Proof-of-Work protocol augmentation that incentivizes miners to hone in on a target hashrate interval.
When hashrate is above target a ceiling is placed on the block reward a miner can receive.
When hashrate is below target a floor is placed underneath the miner's block reward.
arXiv Detail & Related papers (2024-05-23T22:26:25Z) - Generative AI-enabled Blockchain Networks: Fundamentals, Applications,
and Case Study [73.87110604150315]
Generative Artificial Intelligence (GAI) has emerged as a promising solution to address challenges of blockchain technology.
In this paper, we first introduce GAI techniques, outline their applications, and discuss existing solutions for integrating GAI into blockchains.
arXiv Detail & Related papers (2024-01-28T10:46:17Z) - Cryptocurrency Portfolio Optimization by Neural Networks [81.20955733184398]
This paper proposes an effective algorithm based on neural networks to take advantage of these investment products.
A deep neural network, which outputs the allocation weight of each asset at a time interval, is trained to maximize the Sharpe ratio.
A novel loss term is proposed to regulate the network's bias towards a specific asset, thus enforcing the network to learn an allocation strategy that is close to a minimum variance strategy.
arXiv Detail & Related papers (2023-10-02T12:33:28Z) - Energy Regularized RNNs for Solving Non-Stationary Bandit Problems [97.72614340294547]
We present an energy term that prevents the neural network from becoming too confident in support of a certain action.
We demonstrate that our method is at least as effective as methods suggested to solve the sub-problem of Rotting Bandits.
arXiv Detail & Related papers (2023-03-12T03:32:43Z) - Partial Selfish Mining for More Profits [21.636578888742477]
Mining attacks aim to gain an unfair share of extra rewards in the blockchain mining.
In this paper, we propose a new and feasible Partial Selfish Mining (PSM) attack.
We show that PSM attackers can be more profitable than selfish miners under a certain range of mining power and network conditions.
arXiv Detail & Related papers (2022-07-27T11:58:38Z) - A Collaboration Strategy in the Mining Pool for
Proof-of-Neural-Architecture Consensus [16.372941299296652]
In most popular public accessible cryptocurrency systems, the mining pool plays a key role because mining cryptocurrency with the mining pool turns the non-profitable situation into profitable for individual miners.
In many recent novel blockchain consensuses, the deep learning training procedure becomes the task for miners to prove their workload.
While the incentive of miners is to earn tokens, individual miners are motivated to join mining pools to become more competitive.
arXiv Detail & Related papers (2022-05-05T17:08:02Z) - Quantum-resistance in blockchain networks [46.63333997460008]
This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks.
The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
arXiv Detail & Related papers (2021-06-11T23:39:25Z) - Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's
Post-Quantum Security [67.06003361150228]
A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task.
In this work, we examine the hardness of finding such chain of PoWs against quantum strategies.
We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
arXiv Detail & Related papers (2020-12-30T18:03:56Z) - Toward Low-Cost and Stable Blockchain Networks [10.790006312359795]
We propose a blockchain mining resources allocation algorithm to reduce the mining cost in PoW-based (proof-of-work-based) blockchain networks.
arXiv Detail & Related papers (2020-02-19T06:42:33Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.