Block withholding is a type of cryptoeconomic attack where a miner or mining pool successfully solves the cryptographic puzzle to create a new block but intentionally does not broadcast it to the peer-to-peer network. This deviates from the honest protocol, which requires immediate propagation of a valid block to claim the block reward. The primary motivations are typically to gain an unfair advantage in subsequent mining rounds, sabotage a competing pool's revenue, or execute more complex attacks like Selfish Mining. By keeping the block secret, the attacker creates a temporary fork known only to themselves.
Block Withholding
What is Block Withholding?
Block withholding is a malicious strategy in proof-of-work mining where a participant discovers a valid block but deliberately withholds it from the network.
The attack is most commonly analyzed in the context of mining pools. A malicious participant, known as a block withholding attacker, can join a pool and submit only partial proofs of work (shares that demonstrate effort but do not solve the block) while withholding any full proofs of work (actual block solutions). To the pool operator, the attacker appears to be a contributing but unlucky miner, still receiving a share of the pool's rewards based on their submitted partial work, while secretly sabotaging the pool's overall profitability. This specific variant is often called a Block Withholding Attack (BWH).
A more sophisticated form is Selfish Mining, where a miner with significant hashrate withholds blocks to create a longer private chain. They then release this chain to the network to orphan the honest chain's blocks, invalidating the work of competitors and claiming all rewards for themselves. This can destabilize network consensus and discourage honest participation. Defenses against block withholding include cryptographic protocols like Zero-Knowledge Proofs for block submission and careful pool monitoring for statistical anomalies in share submission patterns.
The economic impact of block withholding reduces the overall efficiency and security of a blockchain. It represents a Prisoner's Dilemma scenario: while individually rational for a miner, widespread adoption of the strategy harms all participants by increasing orphan rates and undermining trust in the mining ecosystem. Understanding this attack vector is crucial for protocol designers and pool operators when implementing incentive structures and validation mechanisms to promote honest behavior.
How a Block Withholding Attack Works
A detailed explanation of the block withholding attack, a strategic manipulation where a miner or validator deliberately conceals a valid block from the network to gain an unfair advantage.
A block withholding attack is a strategic action in a proof-of-work (PoW) blockchain where a malicious miner discovers a valid block but intentionally withholds it from broadcasting to the peer-to-peer network. By doing so, the attacker creates a temporary, private fork, allowing them to secretly mine subsequent blocks on top of it. This is distinct from simply being a slow relay; it is a deliberate act of deception. The primary goal is often to gain an advantage in a subsequent selfish mining strategy, where the attacker aims to invalidate the honest chain's work and claim a disproportionate share of rewards.
The attack unfolds in a specific sequence. First, the attacker mines a block B1 but keeps it secret. The rest of the network continues mining on the public chain. If the attacker then finds a second consecutive block B2 on their private chain, they can suddenly broadcast both B1 and B2 simultaneously. According to blockchain consensus rules, the network will adopt the longest valid chain, causing the honest network's work since B1 to be orphaned. This allows the attacker to claim the full block rewards for both blocks while nullifying the rewards of honest miners who worked on the competing public chain segment.
This attack is closely associated with and often a precursor to selfish mining. While block withholding describes the single act of hiding a block, selfish mining is the broader strategy of maintaining a private fork to consistently outperform honest miners. The profitability of such an attack depends heavily on the attacker's share of the total network hash rate; a larger share increases the probability of finding consecutive blocks quickly. Defenses against these attacks include protocols like Freshness Preferred, which penalize older blocks, and network optimizations that minimize natural propagation delays, reducing the window for strategic withholding.
Key Features of Block Withholding
Block withholding is a malicious strategy where a miner or validator discovers a new block but intentionally withholds it from the network, disrupting consensus and enabling various attacks.
Selfish Mining
A primary application of block withholding where a miner keeps a discovered block secret to gain a competitive advantage. The attacker mines a private chain, releasing blocks strategically to orphan honest miners' blocks and waste their computational power. This increases the attacker's effective share of the total mining reward.
Pool-Based Withholding
An attack on mining pools where a participant (a malicious pool member) submits partial proofs of work to prove participation but never submits valid full blocks. This reduces the pool's overall revenue while the attacker still collects a share of rewards, effectively sabotaging the pool's profitability for other members.
Forking Attack Vector
Block withholding directly enables network forks. By secretly mining and then releasing a withheld chain, an attacker can create a reorganization of the canonical chain. This can be used for double-spending attacks, where a transaction is confirmed, then reversed when a longer private chain is published.
Difficulty Manipulation
Withholding blocks can artificially inflate the network's perceived hash rate. If a significant portion of hash power is secretly mining but not publishing blocks, the network difficulty adjustment algorithm may lower the target, giving the attacker a future advantage when they release their private chain.
Validator Sabotage in PoS
In Proof-of-Stake systems, a validator can perform an analogous attack by intentionally missing block proposals or withholding attestations. This disrupts finality, reduces network efficiency, and can be used in conjunction with other exploits to slash honest validators or destabilize the chain.
Detection & Mitigation
Networks combat withholding through consensus and economic mechanisms:
- Nakamoto Consensus: Makes sustained attacks costly by requiring continuous hash power.
- Penalty Schemes (Slashing): In PoS, validators are penalized for non-participation.
- Pool Monitoring: Mining pools use statistical analysis to detect members who submit partials but never full proofs.
Primary Motivations & Goals
Block withholding is a strategic attack where a miner or validator discovers a valid block but intentionally withholds it from the network. This section explores the primary incentives and objectives behind this disruptive behavior.
Selfish Mining for Profit
The primary goal is to gain a competitive advantage and increase mining revenue. By withholding a found block, an attacker can secretly build a longer private chain, then release it to orphan the honest chain's blocks. This allows the attacker to claim a disproportionate share of the block rewards and transaction fees, a strategy known as selfish mining.
Network Disruption & Sabotage
Actors may withhold blocks to degrade network performance or attack a competitor. This can:
- Increase transaction confirmation times for users.
- Reduce the overall hashrate and security of the network.
- Cause chain reorganizations (reorgs) that undermine finality, potentially enabling double-spend attacks against exchanges or services.
Manipulating Consensus & Governance
In Proof-of-Stake (PoS) systems, validators might withhold blocks to influence specific outcomes. This can be a form of governance attack, aiming to:
- Prevent a particular transaction or smart contract execution from being finalized.
- Influence the outcome of an on-chain vote by controlling which blocks are added to the chain during a critical period.
Extortion or Ransom
A malicious miner could use the threat of block withholding as leverage. They might demand a ransom payment (e.g., from a mining pool operator or a high-value DeFi protocol) to stop the attack, which is causing financial losses through network instability or missed block rewards for other participants.
Testing Protocol Resilience
In a research or white-hat context, block withholding may be simulated to stress-test a blockchain's consensus mechanism. The goal is to identify vulnerabilities in the protocol's ability to handle such attacks, leading to improvements in fork choice rules and slashing conditions to penalize malicious validators.
Pool-Within-A-Pool (PWoP) Attacks
A specific form of block withholding targets mining pools. A malicious participant joins a pool, finds a valid block, but does not submit the share (proof of work) to the pool operator. This reduces the pool's overall reward distribution while the attacker secretly mines for themselves, effectively stealing hashrate from the pool.
The Selfish Mining Variant
A strategic attack on a Proof-of-Work blockchain where a malicious miner secretly mines blocks to gain a disproportionate share of rewards.
Selfish mining is a block withholding attack where a miner or mining pool discovers a new block but deliberately withholds it from the public network, creating a private chain. By keeping this block secret, the attacker continues to mine on top of it while the honest network continues on the public chain. The attacker's goal is to gain a temporary lead in block height, which is then strategically released to orphan the honest network's blocks, wasting their computational work and redirecting rewards to the attacker. This strategy can be profitable for an attacker with a significant portion of the network's total hash rate, even if it is less than 50%.
The attack exploits the fundamental consensus rule that the longest valid chain is accepted as canonical. When the attacker has a lead of two or more blocks, they can release their private chain to the network. Honest nodes, following the longest-chain rule, will switch to this new, longer chain, discarding their own work. The blocks mined by the honest network during the attacker's secret mining phase become stale blocks, and the block rewards for those blocks are lost. The attacker effectively steals the mining revenue that would have gone to honest participants, increasing their own reward share beyond their proportional hash power.
The profitability threshold for selfish mining is lower than for a 51% attack. Research, notably in the "Majority is not Enough: Bitcoin Mining is Vulnerable" paper by Eyal and Sirer, showed that a miner controlling more than about 25-33% of the network hash rate could theoretically benefit from this strategy. The attack creates a negative externality for the entire network by reducing the overall efficiency of the mining process and increasing the rate of orphaned blocks, which is a direct economic waste of energy and hardware resources.
Several protocol-level and community-driven defenses have been proposed to mitigate selfish mining. These include altering the chain selection rule to consider factors beyond simple length, such as the total Proof-of-Work embedded in a chain, or implementing protocols that penalize the late announcement of blocks. The persistence of honest nodes in immediately broadcasting newly found blocks also acts as a social defense. However, the threat highlights a fundamental tension in decentralized consensus: the protocol's reliance on the assumption that a majority of participants will act honestly for the system's overall health.
Security Considerations & Impact
Block withholding is a type of attack where a miner or validator discovers a valid block but intentionally withholds it from the network, disrupting consensus and potentially enabling other attacks.
Core Attack Mechanism
In a block withholding attack, a malicious miner who successfully solves the cryptographic puzzle for a new block does not broadcast it to the peer-to-peer network. This prevents other nodes from adding it to the canonical chain, creating a temporary fork or stalling block production. The attacker's motive is often to gain an advantage in a subsequent attack, such as a Selfish Mining strategy, rather than to collect the immediate block reward.
Impact on Network Consensus
The primary impact is the degradation of network liveness and security guarantees.
- Increased Orphan Rate: Legitimate blocks from honest miners are more likely to be orphaned if the withheld block is later released.
- Reduced Throughput: The effective block time increases, lowering transaction finality and network throughput.
- Weakened Finality: In Proof-of-Stake systems, it can delay finality and increase the risk of slashing for honest validators caught in the resulting consensus fork.
Relation to Selfish Mining
Block withholding is the foundational action for the Selfish Mining attack. A selfish miner withholds blocks to create a private, longer chain. By strategically releasing this chain, they can orphan the blocks of honest miners, confiscating their rewards and increasing their own revenue share beyond their hashing power. This demonstrates how withholding is rarely an end in itself but a tactic within a broader strategy to manipulate chain growth.
Mitigation Strategies
Protocols implement several defenses:
- Difficulty Adjustment Algorithms: Networks like Bitcoin adjust mining difficulty based on actual block times, penalizing periods of low productivity.
- Slashing Conditions: In Proof-of-Stake (e.g., Ethereum), validators can be slashed (lose staked funds) for equivocation or being absent, which disincentivizes withholding.
- Timely Detection: Monitoring nodes can detect unusual gaps in block production from specific pools or validators, though attribution can be difficult.
Pool-hopping & Variants
A related exploit is pool-hopping, where miners switch mining pools based on expected rewards, which can be seen as a form of economic withholding. Another variant is the Block Withholding Attack in Mining Pools, where a participant in a pool submits partial proofs of work (shares) but withholds full solutions, reducing the pool's revenue while still getting a share of the rewards, effectively sabotaging the pool's profitability.
Economic & Game Theory Analysis
Block withholding is analyzed as a Prisoner's Dilemma or miner's dilemma. While a single miner withholding can profit in specific conditions, if all miners adopt the strategy, the entire network's security and value collapse, harming all participants. The Nash Equilibrium for rational actors is typically to follow the protocol honestly, but this balance depends heavily on the cost of attack, the distribution of hashing power, and the effectiveness of cryptographic and economic penalties.
Comparison with Other Consensus Attacks
How Block Withholding differs from other attacks that target blockchain consensus or mining.
| Feature / Metric | Block Withholding | Selfish Mining | 51% Attack | Sybil Attack |
|---|---|---|---|---|
Primary Target | Mining pool revenue | Blockchain consensus | Network security | Network identity |
Attacker's Goal | Steal hashrate rewards | Increase block rewards | Double-spend or censor | Gain disproportionate influence |
Required Resources | Control of pool hashrate |
|
| Multiple node identities |
Detection Difficulty | High (hidden within pool) | Medium (chain analysis) | Low (obvious fork) | Varies (depends on implementation) |
Direct Financial Impact | Reduces pool revenue | Increases attacker revenue | Enables theft via double-spend | Enables spam or eclipse attacks |
Network Consensus Compromised? | ||||
Common in Proof-of-Work? | ||||
Common in Proof-of-Stake? |
Mitigation Strategies & Defenses
Block withholding is a type of attack where a miner or validator discovers a valid block but deliberately does not broadcast it to the network, disrupting consensus and potentially enabling other exploits. The following strategies are employed to detect and deter this malicious behavior.
Cryptographic Proof-of-Work
The primary defense in Proof-of-Work (PoW) systems is the inherent cost of the attack. A withholding miner sacrifices the block reward and transaction fees for the hidden block. Detection is probabilistic; other miners may solve the same block height, exposing the withholder. This makes sustained attacks economically irrational for most participants.
Validator Slashing & Penalties
In Proof-of-Stake (PoStake) and Delegated Proof-of-Stake (DPoS) networks, protocols can programmatically punish block withholding. Validators who fail to propose blocks when scheduled can have a portion of their staked capital (bond) slashed or burned. This creates a direct financial disincentive far greater than the potential gain from withholding.
Decentralized Monitoring & Reporting
Network participants run watchdog nodes to monitor block propagation times and validator performance. Anomalies, such as consistent late block proposals from a specific entity, can be reported. In some consensus models, other validators can submit cryptographic proofs of malicious inactivity, triggering automated penalties.
Peer-to-Peer (P2P) Gossip Protocols
Robust gossip protocols are a first-line defense. Nodes rapidly broadcast newly discovered blocks across the peer-to-peer network. If a node receives a block that should have been propagated earlier by a different peer, it can downgrade or disconnect from the suspected withholder, isolating the malicious actor from the network.
Economic Game Theory & Pool Design
In mining pools, the block withholding attack is a significant risk where a miner submits partial proofs but withholds full solutions. Pools mitigate this using Pay-per-Share (PPS) or Pay-per-Last-N-Shares (PPLNS) reward schemes that reduce the incentive, and by cryptographically verifying the work submitted by individual miners.
Consensus Algorithm Choice
The fundamental choice of consensus mechanism dictates the attack surface. Practical Byzantine Fault Tolerance (PBFT)-style protocols require a two-thirds majority of honest validators and have explicit commit phases, making withholding obvious. Nakamoto Consensus (PoW) relies on economic incentives, while modern PoS systems like Ethereum's Gaspar use slashing to enforce liveness.
Frequently Asked Questions (FAQ)
Block withholding is a strategic attack or failure mode in blockchain consensus. These questions address its mechanics, motivations, and consequences.
Block withholding is a deliberate action where a miner or validator discovers a valid block but does not broadcast it to the network, effectively 'withholding' it from the chain. This is distinct from an orphaned or stale block, which is broadcast but not accepted. The primary motivations are often malicious, such as in a Selfish Mining attack, where a miner withholds blocks to gain an unfair advantage and waste the computational power of honest competitors. It can also occur due to network latency or software bugs, but the term typically implies strategic intent. The result is a temporary disruption to the blockchain's normal progression and consensus.
Get In Touch
today.
Our experts will offer a free quote and a 30min call to discuss your project.