The authors begin from first principles, and those principles are more sobering than the marketing around blockchain suggests. In a permissionless network, where anyone can join, consensus is only possible under strict assumptions about how the network behaves, how many participants may be faulty, and what kind of faults they exhibit. The survey revisits the classical fault models: crash faults, where a machine simply stops, and Byzantine faults, where a machine can lie arbitrarily, sending contradictory messages to different peers. The famous Byzantine Generals Problem, formalized in 1982, established that tolerating arbitrary misbehavior requires more than a third of participants to be honest, and the FLP impossibility result of 1985 proved that no deterministic protocol can guarantee both safety and progress in a fully asynchronous network with even one faulty process. These are not academic curiosities; they define the hard ceiling on what any blockchain can promise.

From these foundations, Yang and Tao build a threat model that organizes attacks into three layers: the networking layer, the consensus and finality layer, and the incentive layer. At the networking layer, the survey highlights eclipse attacks, in which an adversary isolates a victim node from the honest network by monopolizing its connections, feeding it a false view of the ledger. Sybil attacks, where one actor fabricates many identities to gain disproportionate influence, remain the fundamental reason permissionless systems need costly resources like computing power or staked coins as identity anchors. Detection research has grown increasingly sophisticated, including smart detectors for Ethereum and non-parametric change-detection approaches that treat eclipse attacks as statistical anomalies in network behavior.

The consensus layer is where the survey’s unified finality semantics pay off. The authors apply a consistent notion of finality, the guarantee that a confirmed transaction can never be reversed, across protocol families that are rarely compared on equal terms. Classical Byzantine fault tolerant protocols like Practical Byzantine Fault Tolerance, Paxos, and Raft provide instant finality once a quorum of honest nodes agrees, but they assume a mostly synchronous network and a known, bounded validator set. Nakamoto-style longest-chain consensus, the design behind Bitcoin, offers only probabilistic finality: a transaction becomes progressively harder to reverse as more blocks stack on top of it. Proof-of-stake variants, DAG-based BFT protocols such as Narwhal, Bullshark, Shoal, and Mysticeti, and hybrid designs each occupy a different point on the spectrum between these guarantees, and the survey makes the trade-offs explicit rather than letting each protocol’s white paper tell its own story.

Among the most vivid attack patterns the survey distills is selfish mining, a strategy in which a miner with a minority of the network’s hash power deliberately withholds blocks and releases them strategically to orphan honest miners’ work, thereby earning more than their fair share and potentially degrading the network into a denial-of-service condition. Research has shown that optimal selfish mining strategies can be computed exactly, that statistical detection methods can spot the telltale fork patterns in network data, and that defenses ranging from consecutive block limits to improved fork-choice rules can raise the threshold of hash power an attacker needs. The survey also covers deep selfish proposing in longest-chain proof-of-stake systems, showing that the same withholding logic migrates to staked networks once the resource being gamed changes from electricity to capital.

Proof-of-stake brings its own distinctive vulnerabilities, and the survey treats them with unusual depth. Long-range attacks exploit the fact that old validator keys, which no longer hold stake, can be used to fabricate an alternative history from any past point, forcing new nodes to trust some external checkpoint, a property known as weak subjectivity. The survey catalogs plug-and-play long-range defense systems and protocol-level fixes such as Ouroboros Genesis. It also examines three documented attacks on proof-of-stake Ethereum, liveness attacks on the HotStuff family of BFT protocols that exploit timer-doubling mechanisms, and speculative denial-of-service attacks in Ethereum’s mempool, where attackers weaponize transaction processing costs. The economic dimension is equally stark: recent theoretical work on the economic limits of permissionless consensus, and analyses of maximal extractable value and proposer-builder separation, show that the incentive layer can be attacked by simply paying participants to misbehave, as in documented bribing attacks.

The survey does not stop at cataloguing threats; it maps the recurring defense strategies and the security-performance trade-offs they impose. The blockchain trilemma, the tension among decentralization, security, and scalability, which has now received a formal proof of its inherent trade-offs, looms over every design decision. Sharded consensus, which splits the network into parallel committees to raise throughput, introduces cross-shard security and atomicity problems that designs like RapidChain, Kronos, and Mobius attack in different ways. Asynchronous BFT protocols such as Dumbo and EPIC sacrifice some efficiency for resilience against network timing attacks, while network-adaptive protocols like Jolteon and Ditto switch between synchronous and asynchronous modes. Formal verification has emerged as a powerful complement, with model checking applied to Tendermint, Algorand, and Jolteon, and mechanized safety proofs written in proof assistants, reflecting a field maturing from white-paper claims toward machine-checked guarantees.

Looking forward, the survey identifies three open problems that could reshape the entire landscape. The first is the post-quantum cryptographic transition: the lattice-based and hash-based signature standards published by NIST in 2024, including FIPS 203, 204, and 205, offer a path to quantum-resistant blockchains, and Algorand has already demonstrated quantum-resistant transactions using Falcon signatures, but migrating live networks with billions of dollars in assets is an engineering and coordination challenge of unprecedented scale. The second is cross-shard atomicity, ensuring that transactions spanning multiple shards either fully commit or fully abort, which remains a fertile ground for both attacks and novel protocol design. The third is adaptive security: defenses that can evolve against adversaries who learn, whether through machine-learning-based detection of selfish mining and malicious validators, or through game-theoretic mechanisms that make misbehavior unprofitable rather than merely detectable.

What makes this survey notable is its refusal to treat security as a footnote to performance. By anchoring every protocol family, from crash-tolerant replication through DAG-based BFT to proof-of-space-time constructions like Chia, in a single threat model and consistent finality semantics, Yang and Tao give researchers and engineers a common vocabulary for comparing guarantees that are usually discussed in incompatible terms. For an industry whose entire value proposition is trust without a trusted party, that clarity is not academic luxury. It is the difference between a ledger that holds and one that quietly becomes the next headline about a nine-figure exploit.

Subject of Research: A survey on blockchain consensus mechanisms: security analysis and future prospects

Article Title: A survey on blockchain consensus mechanisms: security analysis and future prospects

Article References: Yang, S., & Tao, Q. (2026). A survey on blockchain consensus mechanisms: security analysis and future prospects. Cluster Computing, 29(12), Article 717. https://doi.org/10.1007/s10586-026-06510-1

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06510-1

Keywords: survey, blockchain, consensus, mechanisms, security, analysis, future, prospects, scientific research