Live prices are currently unavailable — the exchange feed could not be reached and no recent cached reading is held.

Research · Cross-chain

Four networks, four meanings of finality

A transaction is not simply confirmed or unconfirmed. Bitcoin's assurance accumulates with work and never becomes absolute. Ethereum finalises checkpoints but can reorganise before them. Solana locks a fork in through stake-weighted votes. The Internet Computer finalises a block per round. What a recipient can rely on, and when, differs in each case.

Probabilistic finality: Bitcoin

Bitcoin has no moment at which a transaction becomes final. The longest-chain rule means that a block is always potentially reversible by a competing chain that accumulates more work, and the probability of that happening falls as more blocks are built on top. The Bitcoin documentation describes the standard confirmation guidance in exactly these terms: a transaction is considered increasingly unlikely to be reversed as confirmations accumulate, and the number of confirmations a recipient should wait for depends on the value at stake.

The mechanism that makes reversal expensive is proof of work. To replace a confirmed block, an attacker must produce a competing chain with more accumulated work than the honest chain, which means out-hashing the rest of the network from the point of the fork onward. The cost is therefore not a fixed threshold but a function of how far back the fork is and how much hash rate the attacker controls. A one-block reorg is cheap for a large miner; a six-block reorg is not, and the cost rises with depth.

Two properties follow that are easy to miss. The first is that Bitcoin's finality is a probability, not a guarantee, and no number of confirmations makes it absolute. The second is that the relevant quantity is accumulated work rather than block count: a chain of fewer blocks can carry more work if difficulty differs, which is why the rule is stated in terms of work rather than height. The confirmations and settlement page works through the practical consequences for a recipient.

Economic finality: Ethereum and Solana

Ethereum's proof-of-stake chain separates two things that Bitcoin does not distinguish. A block is first justified, and then finalised, and the Ethereum documentation describes finality as a property of checkpoints: once two consecutive epochs are justified, the earlier checkpoint is finalised, and reverting a finalised checkpoint would require at least a third of the total staked ether to be destroyed. Before a checkpoint is finalised, however, the chain can still reorganise, and the documentation is explicit that short reorgs are a normal part of the protocol rather than a failure.

The security argument is economic rather than probabilistic. An attacker who wants to revert a finalised checkpoint must control enough stake to do it and must accept that the protocol's slashing conditions will destroy that stake. The cost is therefore bounded by the value of the stake at risk rather than by the cost of hardware, which is a different kind of guarantee: it is a statement about what an attacker would lose, not about how much work they would have to perform.

Solana's finality is also economic, but it is reached differently. The documentation describes a tower consensus in which validators vote on forks, and a vote at a given depth locks in the validator's earlier votes: a validator that votes for a fork is committing not to vote for a conflicting one at the same or lower depth. Once enough stake has voted on a fork, it is rooted and treated as final. The mechanism is a stake-weighted commitment rather than a checkpoint schedule, and the documentation describes the resulting finality as arriving in a small number of slots rather than after a fixed number of blocks.

Deterministic finality: the Internet Computer

The Internet Computer's consensus protocol produces a finalised block per round, and the documentation describes a block that has been agreed by a subnet as final: there is no competing chain to reorganise to, because the subnet's nodes agree on one chain and the protocol does not admit a fork. The documentation contrasts this directly with the probabilistic model, describing the Internet Computer's finality as deterministic and arriving in about a second rather than after a confirmation count.

The guarantee is a threshold one. A subnet's security rests on the assumption that fewer than a third of its nodes are faulty, and the protocol's safety argument holds within that bound. This is a different assumption from Bitcoin's, which makes no claim about the identity of participants and relies instead on the cost of accumulating work. A reader comparing the two should be clear that "deterministic" describes the shape of the guarantee, not its strength: a deterministic guarantee under a threshold assumption is not the same thing as an absolute guarantee under no assumption.

The practical consequence is that a canister's state change is settled as soon as the block containing it is finalised, and a client can verify a response against the subnet's public key rather than waiting for confirmations. That is what makes the platform usable for applications that need to read their own state immediately, and it is the property the rest of the ICP research cluster builds on.

The four finality models side by side

The table states the shape of each guarantee and what it assumes. It describes mechanisms from the cited documentation and asserts no measured time-to-finality figure.

Bitcoin, Ethereum, Solana and the Internet Computer compared on the kind of finality each provides and what it assumes.
NetworkKind of finalityMechanismWhat it assumesReorg characteristics
BitcoinProbabilisticAccumulated proof of work on the longest chainNo assumption about participant identity; cost of workAlways possible in principle; probability falls with depth
EthereumEconomic, in two stagesJustified then finalised checkpoints under proof of stakeFewer than a third of stake is maliciousShort reorgs are normal before finality; finalised checkpoints are not reverted
SolanaEconomic, stake-weightedTower consensus votes lock in a fork at depthFewer than a third of stake is maliciousA rooted fork is treated as final; conflicting votes are penalised
Internet ComputerDeterministicOne finalised block per round, agreed by the subnetFewer than a third of a subnet's nodes are faultyNo competing chain is admitted; a finalised block is not reverted

Last reviewed 2026-09-21Source: Bitcoin, Ethereum, Solana and ICP documentationMechanism comparison; no measured time-to-finality figure is asserted.

What the comparison does not settle

The table describes the shape of each guarantee, not how long it takes in practice. Time-to-finality depends on block intervals, network conditions and the behaviour of participants, and a page that quoted a number for each network would be quoting a measurement that changes. The documentation states the mechanism; the reader who wants current figures should go to the networks' own dashboards.

The comparison also does not rank the guarantees. A deterministic guarantee under a threshold assumption and a probabilistic guarantee under no identity assumption are not points on one scale, and treating them as such is the most common error in this kind of comparison. Which one a user should prefer depends on what they are doing: a merchant accepting a small payment has different requirements from a bridge holding a large balance, and the confirmation policy that suits one may be inappropriate for the other.

Finally, the four networks are not static. Ethereum's finality mechanism has changed since the merge, Solana's consensus has been revised, and the Internet Computer's protocol continues to develop. This page describes each mechanism as its documentation describes it at the review date, and it does not treat a proposed change as a deployed one.

Sources and references

Each network's finality mechanism is described from its own documentation. No measured time-to-finality or confirmation figure is asserted that the cited source does not state.

  • Bitcoin's confirmations and accumulated work. Bitcoin Developer Reference, Block Chain: the longest chain is the one with the most accumulated work, and reversal cost rises with depth.
  • Ethereum's finality. ethereum.org, Proof-of-stake finality: checkpoints are justified and then finalised, and reverting a finalised checkpoint requires a third of the stake to be destroyed.
  • Solana's tower consensus. Solana Docs, Consensus: validators vote on forks, and a vote at depth locks in earlier votes so a rooted fork is treated as final.
  • The Internet Computer's finality. ICP Developer Docs, Network overview: a subnet finalises one block per round, and the protocol does not admit a competing chain.