Dotted-underlined terms open a quick definition. Close it to keep reading.
validate against and select the valid chain with the greatest accumulated . “Longest chain” is shorthand; block count alone omits the work represented by each block.
A miner proposes a block. Other nodes independently check it. More hashpower does not make an invalid block valid under the rules a node enforces.
From transaction to active-chain history
A constructs and signs a transaction. Nodes may accept it into their local under policy rules. A miner can include it in a candidate block, which nodes then validate.
Policy and consensus differ. A node may decline to relay a transaction even when a block containing it could satisfy consensus. Mempool rejection is not proof that no valid block can include it.
Validity comes first; accumulated proof of work selects among valid branches. Values and explanations are also provided in the text.
Why reorganizations happen
Competing valid blocks can appear close together. Different peers initially see different tips; later accumulated work can favor one branch. A formerly active block then becomes stale. “Orphan” is used inconsistently and can also mean a block whose parent is unknown.
A deeper reorganization can involve an adversary, software differences or an incident. An affected transaction may appear in the replacement branch, return to a mempool, conflict with another spend or require further reconciliation.
Confirmations are a risk measure
Observation
Establishes
Does not establish
In a mempool
Local acceptance of an unconfirmed transaction
Settlement
In the active tip
One confirmation
Permanent inclusion
Greater depth
More accumulated work after inclusion
Immunity to every failure
Healthy synchronized backend
Better current-chain evidence
Immunity to future defects
For an active-chain transaction, equal tip height minus inclusion height plus one. The security effect depends on assumptions about adversarial resources and behavior. An attacker need not have a majority for a nonzero chance of reversing a shallow payment.
The old table of exact reorg probabilities and dollar attack costs had no reproducible model and has been removed. Rental availability and attack economics cannot be inferred from one network- number. The distinction between valid-chain work and validity is visible in the Core validation implementation.
When exchanging LTC for , check both sides of the payment. More confirmations do not guarantee that your counterparty sends the agreed bank transfer. Forex Mechanics explains how banks FX settlement risk through payment-versus-payment. That risk concerns receiving the other currency; a Litecoin reorganization concerns which transactions remain in the active chain.
Timing and difficulty
Litecoin targets 150-second spacing; blocks are not scheduled appointments. Multiplying target spacing by confirmations gives a rough expectation rather than a maximum wait.
Difficulty adjusts after a block interval. Loss of hashpower can lengthen the actual time to the next adjustment. Litecoin also has its own retarget lookback behavior, so the algorithm is not an unchanged Bitcoin copy. Difficulty code.
The 2026 MWEB case
The developer account separates an earlier validation exploit from an April mutated-block problem that disrupted upgraded miners' RPC operation. The invalid branch contained 13 blocks. This does not establish a fixed dollar cost per confirmation for ordinary double-spends. Postmortem.
A merchant should monitor validating software and service health rather than only increasing its confirmation threshold. A stale backend can give misleading confidence.
Shared mining, separate chains
Shared work can contribute to Litecoin and Dogecoin economics. Their ledgers and validation remain separate; Dogecoin blocks are not Litecoin confirmations. Economic links do not guarantee a hashpower floor or eliminate bugs. See the merged-mining guide.
An operational response plan
Before an incident, record supported versions, contacts and conditions for pausing deposits or fulfillment. During an anomaly, preserve logs, compare independent observations and distinguish an explorer outage from a validation problem.
After recovery, reconcile credited payments against the active chain. Resume when backend and business records agree. Avoid promising exact completion times while the cause is unknown.
Frequently asked questions
Can miners create arbitrary extra LTC?
Correctly validating nodes reject violations of their enforced rules. Implementation errors are a separate risk.
Is six confirmations universally safe?
No. It is a policy under assumptions, not absolute finality.
How should a merchant check a payment?
Follow the verification checklist and distinguish third-party observations from your own validated data.
Litecoin (LTC)
A peer-to-peer cryptocurrency created by Charlie Lee in 2011 as a lighter, faster alternative to Bitcoin. It uses the Scrypt hashing algorithm, has 2.5-minute block times, and a maximum supply of 84 million coins.
For example Sending 0.1 LTC on Litecoin transfers a fraction of one coin; you do not need to buy a whole LTC first.
Common mistake Assuming a token with LTC in its name on another network is automatically native Litecoin.
A participant running network software. A full node independently validates rules; a pruned full node can discard older block files after validation. Not every node stores the complete historical blockchain.
For example A pruned full node checks the chain but later discards old block files to reduce disk use.
Common mistake Assuming every node is a miner, or that pruning means it skipped consensus validation.
A batch of transactions accepted under the network rules and linked to the previous block. Litecoin targets one new block every 2.5 minutes on average; a particular block may arrive sooner or much later.
For example Your payment may wait unconfirmed and then receive its first confirmation when a miner includes it in an accepted block.
Common mistake Treating the 2.5-minute target as a countdown or a maximum wait for your payment.
Rules used by nodes to decide which transactions and blocks are valid. Litecoin uses proof of work to select among valid chains. Miners propose blocks, but validating nodes also enforce the rules.
For example A full node rejects a block that breaks its validation rules even when a miner has done proof-of-work calculations.
Common mistake Thinking that miners can make any transaction valid merely by including it in a block.
A consensus mechanism where miners expend computational energy to solve complex puzzles and validate transactions. Both Bitcoin (SHA-256) and Litecoin (Scrypt) use Proof of Work.
For example A miner searches for valid work, while nodes check that the resulting block also follows the transaction and consensus rules.
Common mistake Thinking proof of work alone lets a miner spend someone else's coins or choose any subsidy amount.
Software or a device that manages keys and helps you receive and send Litecoin. Coins are recorded on the blockchain. A watch-only wallet can show addresses and transactions without holding the keys needed to spend.
For example One wallet can generate several receiving addresses and still show them as a single combined balance.
Common mistake Thinking coins live inside the app, or that seeing a balance proves that the wallet can sign a spend.
A node's local collection of valid transactions waiting for a block. Nodes can see and keep different transactions, so there is no single global waiting room. A transaction seen in a mempool is still unconfirmed.
For example One explorer may see your unconfirmed transaction while another node has not received it or has already removed it.
Common mistake Assuming that absence from one mempool proves the payment was never broadcast or that a seen transaction must confirm.
A transaction receives its first confirmation when included in the accepted chain and another for each following block. Required confirmations depend on the recipient. Litecoin targets a 2.5-minute average block interval; individual waits vary.
For example A transaction in the latest accepted block has one confirmation; the next block raises that count to two.
Common mistake Confusing a wallet's sent message, a TXID or mempool visibility with the first confirmation.
Estimated proof-of-work computations per second. More hash power can raise the cost of some attacks, but distribution, software correctness and economic conditions also affect security.
For example One PH/s represents one quadrillion hash attempts per second; compare only figures for the relevant mining algorithm.
Common mistake Comparing Litecoin and Bitcoin hash-rate numbers as if Scrypt and SHA-256 work had identical costs.
Government-issued currency not backed by a physical commodity, such as USD, EUR, or GBP. Crypto is often bought with fiat through exchanges and then stored in personal wallets.
For example USD, EUR and PLN are fiat currencies; an LTC/EUR quote expresses one coin's price in euros.
Common mistake Confusing the fiat value shown by a wallet with an extra cash balance held in that wallet.
A ledger of cryptographically linked blocks. Proof-of-work nodes validate the chain under consensus rules. Recent blocks can be reorganized; immutability is a practical security property, not an absolute guarantee for every transaction.
For example A block explorer reads the chain so you can inspect where a transparent transaction was included.
Common mistake Assuming an explorer listing proves the sender's identity or that a recent block can never be replaced.
An encoded destination for a payment. Common transparent Litecoin addresses begin with L, M or ltc1; MWEB uses a different address format. An address is not a bank account or proof of identity. Check network and wallet compatibility before sending.
For example To receive LTC, copy a Litecoin receiving address from your wallet and check it against the address shown to the sender.
Common mistake A valid-looking address does not prove that it belongs to the intended person or uses the network the sender selected.
The hashing algorithm used by Litecoin for its Proof-of-Work mining. Scrypt is memory-intensive by design, originally intended to make mining more accessible than Bitcoin's SHA-256, though ASIC miners now dominate both.
For example A Litecoin miner needs Scrypt-compatible hardware; a SHA-256 Bitcoin miner does different work.
Common mistake Assuming the algorithm means current Litecoin mining is practical or profitable on an ordinary laptop.
No separate completed review is recorded for this article. The byline identifies its author or responsible editor; it does not imply independent verification.
Review target: 2026-09-18. The scheduled review is overdue and remains uncompleted.
Editor-in-chief of Litecoin.watch and founder of MyBank.pl. His published work covers foreign exchange, financial education and Litecoin. On Litecoin.watch, his remit includes editorial direction, source transparency and the practical guides and research published by the site.
