Strategic Information Withholding in Distributed Ledgers

This direction is merged into another direction: strategic block withholding. Its last version stays readable and citable here.

Version 1 of 149 papers60 conceptsfrozen 2026-10-04

The security of decentralized blockchains is often framed as a cryptographic problem, but it is fundamentally a game-theoretic one. Most protocols, from Bitcoin to Ethereum, rely on the "honest majority" assumption: the belief that as long as more than 50% of the network’s resources are controlled by well-behaved actors, the system remains secure.

However, research into strategic behavior has shown that this assumption is fragile. Rational actors—those who prioritize profit over protocol rules—can gain a competitive advantage not by breaking the cryptography, but by strategically withholding information. By controlling when and to whom they reveal valid blocks, these actors can force the rest of the network to waste resources, effectively "stealing" rewards from the honest majority.

The Mechanics of Selfish Mining

The most prominent form of this behavior is Selfish Mining. In a technical survey, Florian Tschorsch and Björn Scheuermann 0001 explain this as a race where one participant keeps their progress secret. When a selfish miner finds a block, they do not broadcast it immediately. Instead, they keep it private and continue mining on top of it, building a "private chain."

The intuition is simple: if the selfish miner can stay ahead of the public chain, they can eventually release their private blocks all at once. Because most protocols follow the "longest chain" rule, the network will adopt the selfish miner's longer branch and discard the blocks found by honest miners in the meantime. As Tschorsch and Scheuermann note in Bitcoin and Beyond, this forces the rest of the network to waste computational effort on an obsolete chain, increasing the attacker's relative share of the rewards.

While it was originally thought that an attacker needed 51% of the power to manipulate the network, Tschorsch and Scheuermann highlight that this strategy can become profitable for entities controlling as little as 25% of the network.

Lowering the Barrier to Entry

Recent work has shown that the threshold for profitable deviation is even lower than previously thought. Jiaping Yu and colleagues, in Partial Selfish Mining for More Profits, demonstrate that an attacker can use zero-knowledge proofs to share partial block data with other "rational" miners. By proving they have a secret block without fully revealing it, the attacker can lure other profit-seeking miners onto their private branch. This "collusion-as-a-service" can make selfish mining viable with as little as 10% of the network's total hash rate.

Similarly, Junjie Hu et al. introduce Bribery Semi-Selfish Mining in Novel bribery mining attacks in the bitcoin system. By using a portion of their extra profits to bribe other miners to follow their lead, attackers create a "Bribery Miner’s Dilemma" that makes honest participation the losing strategy for everyone involved.

Sabotage in Mining Pools

Information withholding also manifests as internal sabotage within mining pools. In a Pool Block Withholding (PBW) attack, a miner joins a rival pool and submits "partial" proofs of work to earn a share of that pool's revenue. However, when they find a "full" solution that would actually earn the pool a reward, they discard it.

Colleen Alkalay-Houlihan and Nisarg Shah analyze this in The Pure Price of Anarchy of Pool Block Withholding Attacks. They describe this as a form of corporate espionage: the attacker drains the victim pool's resources while contributing nothing to its success. Their analysis shows that while this behavior leads to a "Price of Anarchy"—a drop in total network efficiency—it often reaches a stable equilibrium where pools are forced to attack each other just to stay competitive.

Timing Games in Proof of Stake

The shift from Proof-of-Work (PoW) to Proof-of-Stake (PoS) has not eliminated these strategic games; it has merely changed their form. In PoS, the "timing" of information release becomes the primary weapon.

Caspar Schwarz-Schilling, Barnabé Monnot, and their co-authors explore this in Time is Money: Strategic Timing Games in Proof-of-Stake Protocols. In Ethereum, block proposers can capture Maximal Extractable Value (MEV) by reordering transactions. By strategically delaying the release of a block by just one second, a proposer can accumulate more transactions and increase the block's value.

While this seems minor, Michael Neuder and Daniel J. Moroz show in Low-cost attacks on Ethereum 2.0 that sophisticated timing can allow stakeholders with less than 1/3 of the total stake to force chain reorganizations (reorgs) and delay network finality without being penalized by the protocol's "slashing" mechanisms.

Designing for Incentive Compatibility

The recurring theme across these papers is that protocols must be incentive-compatible: following the rules must be the "best response" for any rational participant.

Researchers are proposing several architectural changes to address this:

  • Reward Restructuring: Bo Li and colleagues suggest a "finder's fee" model in Discouraging Pool Block Withholding Attacks to make honesty a stable Nash equilibrium.
  • DAG-based Architectures: Danny Dolev and Ittay Eyal propose Colordag, which uses a Directed Acyclic Graph (DAG) structure to ensure that miners are rewarded for all valid work, even if it isn't on the "main" chain, thereby removing the incentive to orphan others' blocks.
  • Hybrid Consensus: Eric Zhang and the TrueChain team use a hybrid model where PoW is used only for committee selection, while transaction processing is handled by a faster, more rigid protocol that leaves less room for strategic delays.

Ultimately, as Nguyen Cong Luong and Dusit Niyato argue in their survey on game theory in blockchain, the future of decentralized security lies in moving beyond simple cryptographic assumptions and building systems that are robust against the inherent greed of their participants.

Papers in this version

History & citationVersion 1 · 2026-10-04

Merged into another direction · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_strategic_information_withholding_in_dis_d3fcf394,
  title = {Strategic Information Withholding in Distributed Ledgers},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/strategic-information-withholding-in-distributed-ledgers/rdr_d3fcf39458a24f8997987822203edc21},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}

This exact version (version 1, frozen text):

@misc{lacuna_strategic_information_withholding_in_dis_d3fcf394_v1,
  title = {Strategic Information Withholding in Distributed Ledgers},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/strategic-information-withholding-in-distributed-ledgers/rdr_d3fcf39458a24f8997987822203edc21/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}