Mining Theory Can Undercutting Attacks Be Mitigated Bitcoin Stack Can undercutting attacks be mitigated? an undercutting attack as described in this paper, is a mining strategy which involves producing new blocks not on the longest known chain, but instead 'undercutting' the longest chain by building a block, which collects less of the available transactions' fees, on a shorter chain. This thesis aims to examine whether undercutting attacks would still be a threat under different mining dynamics. specifically, we examine two important mempool characteristics that have changed since the original paper was written: the block size limit and the fee gradient.
Mining Theory Can Undercutting Attacks Be Mitigated Bitcoin Stack In the proposed model, we first identify the conditions necessary to make undercutting profitable. we then present an easy to deploy defense against undercutting by selectively assembling transactions into the new block to invalidate the identified conditions. We model profitability of undercut ting strategy with block size limit present, which bounds the claimable fees in a round and gives rise to a pending (cushion) transaction set. in the proposed model, we first identify the conditions necessary to make undercutting profitable. In the proposed model, we first identify the conditions necessary to make undercutting profitable. we then present an easy to deploy defense against undercutting by selectively assembling transactions into the new block to invalidate the identified conditions. Abstract: in this paper, we review the undercutting attacks in the transaction fee based regime (i.e., without block rewards) of proof of work (pow) blockchains with the longest chain fork choice rule.
Mining Theory Can Undercutting Attacks Be Mitigated Bitcoin Stack In the proposed model, we first identify the conditions necessary to make undercutting profitable. we then present an easy to deploy defense against undercutting by selectively assembling transactions into the new block to invalidate the identified conditions. Abstract: in this paper, we review the undercutting attacks in the transaction fee based regime (i.e., without block rewards) of proof of work (pow) blockchains with the longest chain fork choice rule. In the proposed model, we first identify the conditions necessary to make undercutting profitable. we then present an easy to deploy defense against undercutting by selectively assembling transactions into the new block to invalidate the identified conditions. In the proposed model, we first identify the conditions necessary to make undercutting profitable. we then present an easy to deploy defense against undercutting by selectively assembling transactions into the new block to invalidate the identified conditions. This project looks into the profitability of undercutting attack on bitcoin and monero, along with a mitigation technique. the analysis is applicable to other pow based cryptocurrencies where transactions fees are the major source of incentives. In this paper, we are committed to solving these two limitations. first, we propose a novel mining strategy named greedy mine attack. then, we formulate a markov reward process (mrp) model to analyze the competition of honest miners and adversaries.
Comments are closed.