54.93 $
-1.75% -0.98 $
54.93 $
-1.75% -0.98 $
Litecoin produces a block every 2.5 minutes. This mechanism worked without major issues for 3.1 million blocks — until April 25, 2026, when 13 of them were erased in ninety minutes. The network accepts it, appends it to the chain, and moves on. This process has repeated roughly 3.1 million times since October 2011 with almost mechanical reliability. But "almost" is doing a lot of work in that sentence. Sometimes the chain breaks. Sometimes blocks get orphaned. And on rare occasions, the network rewinds itself and erases transactions you thought were permanent.
If you trade, accept payments, or run infrastructure on Litecoin, understanding how consensus actually works is not optional. The April 2026 reorg proved that even a chain with 14 years of flawless history can reverse 13 blocks in an afternoon. This article explains the machinery that makes that possible.
Litecoin uses proof-of-work (PoW) to determine which blocks get added to the chain. Miners compete to find a number (a nonce) that, when hashed with the block data, produces a result below the network difficulty target. The first miner to find a valid hash broadcasts the block, everyone else verifies it, and the chain advances.
Two design choices separate Litecoin from Bitcoin:
The consensus rule is brutally simple: the chain with the most cumulative proof-of-work wins. Not the longest chain, not the oldest chain, not the chain your node saw first. The chain that represents the most total computational effort. This is Nakamoto consensus, and it has one critical property that most people misunderstand: it never provides absolute finality.
A block reorganization (reorg) occurs when the network switches from one chain tip to another. Your node was following Chain A. Then Chain B arrives with more cumulative proof-of-work. Your node drops Chain A's recent blocks and adopts Chain B instead. Every transaction that was in Chain A but not in Chain B gets kicked back to the mempool — or disappears entirely if there is a conflict.
From the user's perspective, this means a transaction that showed "confirmed" in their wallet is now unconfirmed or gone. The money you thought you received may no longer be yours.
There are three categories of forks that cause reorgs, and they have very different risk profiles:
Two miners find valid blocks at roughly the same time. The network briefly splits: some nodes follow Miner A's block, others follow Miner B's block. Within one or two blocks, one chain pulls ahead. The losing block becomes an "orphan" (technically a stale block). Transactions from the orphaned block usually get re-included in the winning chain. This happens regularly on every PoW network — Litecoin's 2.5-minute block time makes it slightly more frequent than Bitcoin's. Depth: 1-2 blocks. Risk: negligible.
Part of the network runs different consensus rules than the rest. This creates two incompatible chains that cannot reconcile. Causes include: hard forks where part of the network refuses to upgrade, soft forks where older nodes do not validate new rules, or software bugs that cause nodes to disagree on block validity. The April 2026 Litecoin incident falls into this category — patched nodes and unpatched nodes were running different validation rules, creating a chain split that the attacker exploited. Depth: potentially unlimited. Risk: high.
An attacker with majority hashrate secretly mines a longer chain, then releases it to the network. The honest chain gets replaced. The attacker can double-spend: send coins on the honest chain (to an exchange, for example), wait for confirmations, then release the secret chain where those coins were never sent. The honest chain's transactions are erased. Depth: depends on how long the attacker mines secretly. Risk: catastrophic.
The conventional wisdom has always been simple: more confirmations = more security. Each additional block buried on top of your transaction makes a reorg exponentially more expensive to execute. The math works like this: to reorg N blocks, an attacker needs to out-mine the honest network for the duration of those N blocks. With each additional block, the probability of the attacker succeeding drops geometrically.
| Confirmations | Time (LTC) | Reorg probability (honest network) | Estimated cost to attack (51%) |
|---|---|---|---|
| 1 confirmation | ~2.5 min | ~0.5% (orphan race) | ~$5,000-10,000 in hashrate rental |
| 3 confirmations | ~7.5 min | ~0.01% | ~$15,000-30,000 |
| 6 confirmations | ~15 min | ~0.0001% | ~$30,000-60,000 |
| 12 confirmations | ~30 min | ~0.00000001% | ~$60,000-120,000 |
These numbers assume one thing: the threat is purely hashrate-based. A rational attacker renting hashpower to double-spend. Under that model, 6 confirmations makes a reorg practically impossible for any amount under several million dollars.
But the April 2026 reorg was not a hashrate attack. It was a code bug. The attacker did not need 51% of the hashrate — they exploited a chain split between patched and unpatched nodes. Thirteen blocks were reversed. Every transaction within those 13 blocks, regardless of how many confirmations it had accumulated, was unwound. The table above became meaningless because the threat model was wrong.
This is the fundamental lesson: confirmation count protects you against hashrate attacks. It does not protect you against consensus bugs.
On April 25, 2026, Litecoin experienced a 13-block reorganization. The root cause was not insufficient hashrate — it was a software vulnerability in the MWEB validation code. Here is what happened:
NEAR Intents lost 11,000 LTC (~$600,000) in a cross-chain swap that was confirmed, then erased. Six-plus confirmations meant nothing because the reorg did not care about confirmation depth. It cared about which chain had more cumulative work, and the "invalid" chain temporarily won.
For the complete breakdown of both the inflation bug and the reorg attack, see our incident analysis.
Litecoin adjusts its mining difficulty every 2,016 blocks — roughly every 3.5 days at the target 2.5-minute block time. The algorithm compares the time it actually took to mine the last 2,016 blocks against the expected time (5,040 minutes). If blocks came too fast, difficulty increases. Too slow, it decreases.
This mechanism serves two purposes:
The difficulty adjustment window is inherited from Bitcoin's design and has a known edge case: if hashrate drops suddenly (say, after a halving event makes mining unprofitable), the network can temporarily produce blocks much slower than 2.5 minutes until the next adjustment. Litecoin has weathered multiple halvings without major disruption, but the risk is real for chains with smaller hashrate.
The uncomfortable fact: Litecoin transactions are never truly final. Not after 1 confirmation. Not after 6. Not after 100. Proof-of-work consensus is probabilistic, not deterministic. There is always a nonzero probability — however infinitesimal — that a longer chain could appear and replace the current one.
This is fundamentally different from systems with absolute finality (like some proof-of-stake chains where a supermajority of validators explicitly signs off on a block, making it irreversible by protocol rules). In Nakamoto consensus, "finality" is just a function of how much work sits on top of your transaction. More work = more expensive to reverse = more "final" in practice. But never final in theory.
For practical purposes, this distinction rarely matters. After 6 LTC confirmations (~15 minutes), reversing a transaction requires more hashrate than anyone has economic incentive to deploy for typical transaction values. The probabilistic nature of PoW finality is a theoretical vulnerability, not a daily operational concern — except when it is, as April 2026 demonstrated.
Since 2014, Litecoin and Dogecoin have shared hashrate through merged mining. Miners can simultaneously mine both chains with the same Scrypt hardware, earning rewards on both networks without splitting their hashrate.
This has two security implications:
Merged mining is a meaningful security layer for the specific threat of 51% attacks. For everything else — code bugs, consensus splits, implementation errors — it provides zero protection. Merged mining with Dogecoin gives Litecoin the most expensive rentable hashrate in the Scrypt ecosystem. It was useless on April 25 because the attacker did not need to buy a single terahash — a C++ compiler and knowledge of the MWEB code was enough.
For a full analysis of Litecoin's hashrate security model and mining pool distribution, see our network security article and the live mining dashboard.
A blockchain reorganization (reorg) occurs when the network abandons its current chain tip in favor of an alternative chain with more cumulative proof-of-work. Recent blocks on the abandoned chain are discarded, and any transactions in those blocks that conflict with the new chain are reversed. Reorgs can be caused by normal mining races (1-2 block orphans), consensus bugs causing chain splits, or deliberate 51% attacks. The deeper the reorg, the more serious the cause.
For everyday transactions under $10,000: 3-6 confirmations (7-15 minutes) provides strong security against hashrate-based attacks. For larger amounts ($10,000+): 12+ confirmations (30+ minutes) is recommended post-April 2026. For exchange-grade settlement: some exchanges now require 20+ confirmations for large LTC deposits. No number of confirmations provides absolute protection against consensus bugs or chain splits — only against hashrate attacks. Monitor on-chain data for network anomalies.
Yes. On April 25, 2026, Litecoin experienced a 13-block reorganization caused by a vulnerability in the MWEB extension block validation code. This was the first security incident in Litecoin's history (launched October 2011). The reorg reversed approximately 32 minutes of transactions, and NEAR Intents lost 11,000 LTC (~$600,000) in a cross-chain swap that was confirmed then erased. Prior to this event, Litecoin had experienced only routine 1-block orphans during normal mining operations. See our full incident report and the block explorer guide for details.
