What Are Blockchain Confirmations?
Learn what blockchain confirmations are, how they reduce double-spend risk, why 6 confirmations is only a guideline, and how finality differs across chains.

Introduction
Confirmations are the practical way blockchains express growing confidence that a transaction will stick. That sounds simple, but it hides the real puzzle: if a transaction is already visible in your wallet or explorer, why isn’t that enough?
The answer is that blockchains are shared histories assembled under imperfect conditions. Transactions are broadcast before they are recorded. Blocks can arrive nearly at the same time. Different nodes can briefly disagree about the latest valid chain. And in some systems, an attacker can try to replace a payment with a conflicting one. A confirmation exists to measure how deeply a transaction has been anchored into the chain’s accepted history.
This is why confirmations matter so much in practice. Wallets display them. Merchants set acceptance policies around them. Exchanges wait for a chain-specific number before crediting deposits. Underneath those operational choices is a more fundamental idea: a blockchain transaction is not just valid or invalid; it becomes progressively harder to reverse as consensus keeps building on top of it.
In proof-of-work systems such as Bitcoin, that confidence grows with block depth. In newer systems, the same user-facing idea often survives, but the mechanism underneath may be validator votes, lockouts, or explicit finality gadgets rather than pure accumulated work. So “confirmations” is both a narrow technical term in some chains and a broader operational shorthand across the industry.
What is a blockchain confirmation and how is it counted?
| Stage | What it is | Reversal difficulty | Typical wait |
|---|---|---|---|
| 0 confirmations | Transaction in mempool | Easy; replaceable/double spend | Seconds–minutes |
| 1 confirmation | Included in a block | Requires replacing tip block | ≈1 block (e.g., 10 min BTC) |
| Multiple confirmations | Buried under later blocks | Exponentially harder to rewrite | More blocks (e.g., 1 hour for 6) |
The core idea is easiest to see in Bitcoin. A transaction starts as an unconfirmed message: it has been signed, broadcast to peers, and maybe accepted into mempools, but it is not yet part of the blockchain. Once a miner includes it in a valid block that the network accepts, it gains its first confirmation. Each additional block built on top of that block adds one more confirmation.
So if your transaction sits in the latest accepted block, it has 1 confirmation. If two newer blocks have been chained after it, it has 3 confirmations in total: the block containing the transaction plus two blocks after it. Operationally, people often talk about confirmations as the number of blocks “on top” of the transaction’s block, but the common wallet display convention counts inclusion as the first confirmation.
The reason this metric is useful is not cosmetic. It is a proxy for replacement difficulty. To reverse a confirmed transaction, an attacker or competing chain history would need to remove not only the transaction’s own block but also every block that was added after it. As depth grows, rewriting that history becomes harder, more expensive, or less likely to succeed.
That is the compression point: a confirmation is not a timer; it is a measure of how much consensus has accumulated behind a transaction. Time matters only indirectly because more time usually allows more blocks, votes, or checkpoints to accrue.
Why seeing a transaction in a wallet or explorer is not the same as a confirmation
| State | Location | Main risk | Action for recipient |
|---|---|---|---|
| Seen (0) | Relay/mempool | Replacement or eviction | Do not trust; monitor |
| Included (1) | Block tip | Tip replacement possible | Safer but still cautious |
| Buried (many) | Deep chain history | Low reversal probability | Treat as settled per policy |
A common misunderstanding is to treat network visibility as settlement. If a wallet says a transaction has been sent, or a block explorer can display it, many users assume the payment is effectively done. Mechanically, that is too early.
Before confirmation, a transaction lives in the network’s relay layer. In Bitcoin, nodes decide whether to accept and forward unconfirmed transactions according to local mempool policy in addition to consensus rules. Those policies are not identical everywhere, and a transaction can be relayed by many peers without ever making it into a block. It may also be replaced, evicted, delayed by low fees, or conflict with another transaction spending the same input.
This is where double spending enters. A double spend is simply two or more transactions trying to spend the same input. Only one of them can ultimately survive in the canonical chain. If you accept a payment while it is still unconfirmed, you are trusting not only that it is valid, but that no conflicting transaction will win the race to confirmation.
That is why developer guidance for Bitcoin treats 0 confirmations as inherently risky. An unconfirmed payment may be perfectly honest and still not be safe to act on. The network has seen it; the network has not yet committed to it.
How do confirmations protect against double-spend attacks?
The mechanism is clearest in proof of work. Bitcoin nodes follow the chain with the greatest accumulated proof of work. The longest proof-of-work chain serves as evidence both of event ordering and of which history received the most computational effort. If your transaction is inside one block, an attacker who wants to reverse it must produce an alternative history that overtakes the honest chain.
Suppose Alice pays a merchant, receives goods quickly, and simultaneously tries to mine or sponsor a conflicting transaction paying herself instead. If the merchant ships immediately at 0 confirmations, Alice only needs the conflicting transaction to get confirmed first somewhere that becomes canonical. If the merchant waits for 1 confirmation, Alice now needs to replace the tip block. That is much harder, but still feasible in principle because the newest block is exactly where short-lived forks happen most often.
Now imagine the merchant waits for 6 confirmations. At that point the transaction is buried under six blocks of accumulated work. Alice is no longer trying to win a race for the next block; she is trying to rewrite roughly an hour of chain history on Bitcoin’s average schedule. If she controls less hashpower than the honest network, her chance of catching up falls rapidly with each added block.
This is the insight formalized in the Bitcoin whitepaper. If an attacker controls a fraction q of total hashpower and the honest network controls p = 1 - q, then the attacker’s probability of catching up from z blocks behind drops exponentially as z increases, assuming the honest majority condition holds. The whitepaper even gives example depths needed to push the probability below 0.001 for different attacker strengths. For an attacker with q = 0.10, around z = 5 is enough by that model; for q = 0.30, the required depth is much larger.
The important point is not the exact table. It is the shape of the relationship: every additional confirmation compounds the attacker’s problem. Confirmations work because they force an attacker to overturn not a single event, but an expanding suffix of agreed history.
Why do people say "wait 6 confirmations" and is that a universal rule?
People often hear that six confirmations means a Bitcoin transaction is final. That is too strong. Six is a convention, not a magical threshold written into the protocol.
The practical origin is straightforward. In Bitcoin, blocks arrive about every ten minutes on average, so six confirmations means waiting about an hour. That delay is long enough that reversing the transaction usually requires substantial hashpower and good luck, making ordinary fraud much less practical. Developer guidance has long suggested six confirmations for higher-value or fraud-sensitive payments for exactly this reason.
But the phrase becomes misleading when it is repeated as a universal rule. First, confirmations provide probabilistic finality, not absolute finality. If a proof-of-work chain can reorganize at depth 1, it can in principle reorganize at depth 6; the question is how unlikely or expensive that is under current assumptions. Second, the right threshold depends on the amount at risk, the attacker model, and the chain’s current security conditions. Third, software bugs, network splits, or unusual operational failures can create reversions that have little to do with an ordinary merchant double-spend attack.
So the honest version is this: six confirmations is a widely used operational guideline for higher-value Bitcoin payments, not a protocol guarantee and not a one-size-fits-all answer.
Example: how risk changes at 0, 1, and 6 confirmations
Imagine a customer paying a merchant in Bitcoin for a digital good delivered instantly. The customer broadcasts a transaction with an adequate fee, and the merchant’s system sees it propagate across peers. At this point the payment has 0 confirmations. The merchant can tell the transaction exists and may even judge it likely to confirm soon, but there is still no block anchoring it. If the customer also broadcast a conflicting payment elsewhere, the merchant may not even see the competitor immediately.
Ten minutes later, on average, a miner includes the transaction in a block. The merchant now sees 1 confirmation. Something fundamental has changed: the transaction is no longer only a relay-layer message. Reversing it now requires that block to be replaced by a competing chain tip. Risk has dropped sharply, but the newest block is still the place where accidental or adversarial replacement is most plausible.
An hour later, if five more blocks have been added, the merchant sees 6 confirmations. The transaction is now buried. To replace it, an attacker must invalidate not just the original inclusion but an entire stack of subsequent work. The merchant has not received a mystical guarantee. What they have received is a much better position in the probability distribution of possible futures.
That shift from visibility, to inclusion, to burial is the real meaning of confirmations.
How do fees affect inclusion versus a transaction’s confirmation safety?
A confirmation measures depth after inclusion, but inclusion itself depends heavily on transaction propagation and fee bidding. This is where readers often conflate two separate questions: *When will my transaction enter a block? * and *Once it is in a block, how safe is it? *
They are related but distinct. Before first confirmation, fee mechanics matter enormously because validators or miners choose which transactions to include. In Bitcoin, local mempool policy and fee competition affect whether a transaction spreads well enough and looks attractive enough for miners to pick it up. In Ethereum’s EIP-1559 fee market, the base fee adjusts with congestion and users add a priority fee to incentivize inclusion. Better fee estimation can reduce unnecessary delays to first inclusion.
But paying a high fee does not buy deep finality directly. It mainly buys a better chance of quick inclusion. After that, the transaction’s safety comes from the consensus process continuing to extend and ratify the chain or state that contains it.
This distinction matters operationally. A transaction stuck for hours at 0 confirmations may simply be underpriced. A transaction with 3 confirmations may have entered immediately because it paid well, but its resistance to reversal comes from those three subsequent consensus steps, not from the fee itself.
When are confirmations probabilistic and what assumptions matter?
Bitcoin’s model depends on an honest majority of hashpower. The whitepaper states the system is secure so long as honest nodes collectively control more CPU power than any cooperating attacker group. That assumption is the foundation under the familiar block-depth intuition.
Formal work on the Bitcoin protocol sharpened this further. Theoretical analyses describe properties such as a common prefix and transaction persistence: roughly, honest nodes’ views of the chain converge except near the tip, and committed transactions remain committed. But these guarantees depend not only on attacker hashpower being bounded, but also on network conditions such as synchrony. As network delays worsen, the safety margin shrinks.
That explains a subtle but important fact: confirmations are not just about attacker resources. They are also about how cleanly the network can agree on recent history. If propagation is slow or partitions occur, the tip becomes more fragile, and deeper waiting may be needed to achieve the same confidence.
This is also why literally perfect settlement finality is a mirage. Even outside blockchains, ledgers can be corrected, courts can reverse transfers, operators can fail, and software can malfunction. Public blockchain confirmations are one more form of fallible finality; often powerful, often measurable, but never metaphysically absolute.
How do different blockchains define confirmations and commitment?
| Consensus | What 'confirmation' means | Security model | Client signal |
|---|---|---|---|
| Proof of work (Bitcoin) | Block depth / accumulated work | Probabilistic finality; honest hash majority | Confirmation count (e.g., 6) |
| PoS with finality gadget (Polkadot, Ethereum PoS) | Validator votes / checkpoint finality | Finality gadget / attestations | Attestation/finalized indicator |
| BFT SMR (Tendermint) | Quorum commit of a block | Strong finality under quorum assumptions | Committed/finalized immediately |
| Solana-style | Commitment levels (processed/confirmed/finalized) | Vote lockouts / supermajority semantics | RPC commitment label |
The broad intuition survives across architectures, but the mechanism underneath changes.
On Ethereum proof of stake, the authoritative consensus rules live in the proof-of-stake specifications, and the system’s finality is no longer described purely as “more proof of work piled on top.” The deeper idea is validator agreement over time, with protocol-defined checkpoints and finalization behavior. In such a system, people still talk informally about waiting a few blocks, but the stronger safety milestone is often explicit finality rather than mere depth.
Solana makes this difference very visible in its RPC terminology. Instead of exposing users only to a raw block count, it offers commitment levels such as processed, confirmed, and finalized. Processed means a node has seen the most recent block, but that block might still be skipped by the cluster. Confirmed means a supermajority has voted on the block, with optimistic confirmation guarantees. Finalized refers to the most recent block recognized by supermajority as having reached maximum lockout. The same user question exists (“how safe is this transaction?”) but the answer is expressed through commitment semantics rather than a simple count.
Polkadot separates the problem even more explicitly. BABE produces blocks, which means recent blocks may still be probabilistic and forkable. GRANDPA then finalizes chains, making finalized blocks non-revertible under the protocol’s assumptions. So a transaction can be included before it is provably finalized. Here again, the familiar wallet language of “confirmations” may appear, but the chain’s real safety transition comes from the finality gadget.
Systems built on Byzantine fault tolerant state machine replication, such as Tendermint-style designs, push this further. The point of the protocol is to replicate state with strong agreement properties, so once a block is committed under the protocol’s quorum assumptions, applications often treat it as effectively final without waiting for a long ladder of probabilistic confirmations. In those environments, extra blocks may still be observed by interfaces, but their role is not the same as in Nakamoto-style consensus.
So the word remains useful, but you should always ask: **confirmation according to what mechanism? accumulated work, validator votes, lockout rules, or explicit finalization? **
How do wallets, merchants, and exchanges set confirmation policies?
In practice, confirmations are a risk policy interface. The chain gives you a measure of confidence; the business decides what confidence is enough.
A café accepting a tiny in-person payment may tolerate 0 confirmations with additional monitoring because the cost of waiting would destroy the user experience and the fraud reward is small. A merchant selling expensive goods may wait for several confirmations or for explicit finality. An exchange crediting deposits has to defend against both ordinary double spends and chain-specific reorg behavior, so it will usually require a documented threshold before making funds available for trading or withdrawal.
This is why confirmation policies differ so much across assets. They are not just expressions of block time. They encode assumptions about attack cost, observed reorg behavior, client implementation risk, and the value that could be stolen if a rollback occurs.
On Bitcoin, software can query confirmation counts directly using node RPCs. Operators can also monitor peers and third-party sources for conflicting transactions or fork conditions, especially when handling unconfirmed or high-risk flows. That extra monitoring matters because a raw confirmation count can be insufficient in edge cases: accepting zero-conf transactions, needing faster acceptance than conservative thresholds allow, or dealing with software bugs and attacks.
What risks remain even after many confirmations?
The most intuitive failure mode is a chain reorganization. If the network later adopts a competing history that excludes your transaction, your previous confirmation count collapses. A reorg deeper than your waiting threshold invalidates the comfort you thought you had.
Most of the time, deeper reorgs are rare because consensus is doing its job. But they are not fiction. Proof-of-work chains have experienced notable reversions from software bugs and chain splits. More modern stacks can also suffer user-visible rollbacks for reasons specific to their architecture.
A recent Starknet incident is a useful reminder. During a sequencer decentralization upgrade, two reorgs reverted roughly an hour of transactions in one case and roughly twenty minutes in another. The proving layer preserved correctness, but users still experienced accepted activity being rolled back and needing resubmission. That is exactly the practical lesson confirmations are meant to express: what appears accepted now may still sit inside a reversible window.
This kind of event also shows the limit of thinking only in terms of adversarial double spends. Reorg risk can come from node divergence, manual operational mistakes, client bugs, or mismatches between layers. Confirmations reduce normal reversal risk, but they do not eliminate engineering risk.
How are confirmations a user-facing form of finality across consensus designs?
At a higher level, confirmations are how transaction processing connects to the broader concept of finality. Finality asks whether a transaction, once accepted, will stay accepted. Confirmations are the operational answer many systems expose to users.
In proof of work, finality is de facto and probabilistic. More depth means lower reversal probability. In proof of stake with explicit finality logic, the system may offer a stronger milestone once enough validators have attested or locked in a checkpoint. In BFT-style systems, finality may arrive directly with commit. These are different mechanisms solving the same underlying problem: making the ledger’s recent past stable enough to build on.
That is why “number of confirmations” should never be read in isolation from the chain’s consensus design. Two blocks on one network may mean less than one finalized checkpoint on another. The user-facing meter looks similar; the security model underneath is not.
Conclusion
A confirmation is best understood as accumulated consensus behind a transaction. At 0 confirmations, the network has seen the payment. At 1, it has included it. With each additional confirmation, reversing it requires overturning more agreed history.
That is why confirmations exist: blockchains need a practical way to express growing settlement confidence in systems where the latest state can still change. On some chains this confidence comes from added proof of work, on others from validator votes or explicit finality rules. The number itself is never magic. What matters is the mechanism behind it, the assumptions it depends on, and the amount of risk you are willing to carry.
What should I understand before relying on confirmations?
Before you rely on confirmations for a deposit, withdrawal, or instant trade, know the chain-specific safety model and the threshold Cube uses to credit funds. On Cube Exchange, deposits and trading availability follow each asset’s consensus rules and required confirmation counts, so follow these concrete checks to reduce reversal and reorg risk.
- Identify the chain and its finality model (block-depth vs. explicit finality). Check the asset page or Cube’s deposit guidance to see whether Cube requires a block count, a "finalized" / checkpoint status (e.g., Solana "finalized", Polkadot GRANDPA), or a different indicator.
- Set an on-chain fee that targets timely inclusion. From your sending wallet, choose a priority fee/fee level appropriate for the network (EIP‑1559 priority tip on Ethereum, higher sat/vB on Bitcoin) so the transaction reaches the first confirmation quickly.
- Send using the exact asset and network you selected and include any required memo/tag. Confirm the destination address, network selector, and tag before submitting to avoid deposits that need manual intervention.
- Wait for Cube’s required confirmations and verify on-chain. Use the explorer or Cube’s deposit status to confirm the indicated confirmation count or finality status before placing trades or requesting withdrawals.
Frequently Asked Questions
- If my wallet or an explorer shows the transaction, why isn’t that the same as a confirmation? +
- Because being visible only means the transaction has been relayed; until a miner or validator includes it in a block (or the chain’s finality gadget marks it final) it can be evicted, replaced, or outcompeted by a conflicting transaction — visibility is a network-layer event, not the accumulation of consensus that protects against double-spends.
- How do confirmations actually reduce the chance of a double-spend? +
- Confirmations measure how many blocks (or equivalent consensus steps) have been built on top of the block that includes your transaction, and each added confirmation exponentially raises the resources an attacker must spend to replace that suffix of history, so deeper confirmations sharply reduce the probability of a successful double-spend under the usual attacker-hashpower assumptions.
- Why do people say "wait 6 confirmations" and is that a rule I should always follow? +
- Six confirmations became a common guideline because on Bitcoin’s ~10‑minute block cadence six blocks (~one hour) usually make rewriting history experimentally expensive, but it is not a protocol guarantee — finality is probabilistic and the “right” depth depends on attacker models, value at risk, and current network conditions.
- If I pay a very high fee, does that make my transaction irreversible faster? +
- Paying a higher fee can make your transaction more likely to be included in the next block (reducing time to the first confirmation), but it does not itself make the transaction more final once included; finality comes from subsequent consensus steps, not the fee paid.
- How do confirmations differ between proof-of-work, proof-of-stake, and BFT-style blockchains? +
- Different chains express confirmation safety differently: PoW chains use block depth as a probabilistic finality metric, PoS chains may rely on validator attestations or explicit finality checkpoints, and BFT-style systems typically provide near-immediate commit finality — so a ‘‘confirmation’’ on one chain can mean something materially different on another.
- Can a transaction be reversed after many confirmations, and what causes that? +
- Even after many confirmations a reorganization can occur; reversions have happened due to software bugs, network splits, manual operational errors, or extraordinary adversarial effort, so confirmations lower but do not eliminate all forms of rollback risk.
- How should merchants and exchanges decide how many confirmations to wait for? +
- Businesses encode their acceptable risk into confirmation policies: low-value, in‑person merchants sometimes accept zero-confirmation with monitoring, while exchanges and custodians typically require multiple confirmations or protocol finalization before crediting deposits to defend against reorgs and double-spends.
- Is it ever safe to accept a payment with 0 confirmations, and if so how? +
- Accepting zero-confirmation payments is inherently risky because the payment has not been anchored by consensus; safe handling requires additional mitigations (peer- or third‑party monitoring, strict fee policies, or acceptance only for very low-value transactions) rather than relying on visibility alone.
- How do network delays or partitions change how many confirmations I should wait for? +
- Network synchrony and propagation quality affect confirmation security: the formal security bounds in analyses depend on assumptions about timely message delivery, and as the network desynchronizes the adversary power needed to safely reverse history decreases, so slower propagation or partitions increase required waiting depth.
- Why does Solana use "processed/confirmed/finalized" instead of a simple confirmation count and how should I use them? +
- On chains like Solana the RPC exposes commitment levels such as 'processed', 'confirmed', and 'finalized' that map to different safety semantics (e.g., processed = node saw it, confirmed = supermajority votes, finalized = maximum lockout), so clients should use those commitment semantics rather than interpreting a raw block count as equivalent to Bitcoin-style confirmations.