Chain reorganisations are not theoretical edge cases. They happen, and when they do, blocks that appeared confirmed get replaced by a competing chain with more accumulated work. Any transaction sitting in those replaced blocks gets erased from the canonical record. For participants in crypto games where deposits fund on-chain positions, this is not an abstract concern. A deposit that looked confirmed becomes unconfirmed in seconds if a deep enough reorganisation rolls back the chain beyond the block it settled in.
What is reorganisation?
Every node follows the chain with the most accumulated difficulty. When two miners find valid blocks nearly simultaneously, different parts of the network temporarily hold different chain tips. One branch accumulates more work and wins. The other gets dropped along with every transaction it contained.
Shallow reorganisations of one or two blocks happen regularly and resolve quickly. Deeper ones are rarer but far more consequential. A six-block reorganisation on a chain treating three confirmations as final rewrites history that participants already acted upon.
Confirmation depth logic
Deposit security connects directly to how many blocks sit above a transaction. Each additional block represents another round of proof-of-work stacked on top. Reversing a transaction buried under ten blocks means outpacing the honest network across all ten simultaneously, requiring a sustained hash rate majority directed at rewriting history.
Cost of that attack scales with depth. One block deep costs very little to reverse, given sufficient hash rate. Ten blocks deep costs enormously more. A network with a lower total hash rate needs more confirmation depth to reach the same security level as a high hash rate chain needing fewer confirmations.
Reversal cost scaling
Economic weight behind reorganisation resistance comes from mining expenditure. An attacker aiming to reverse a deposit must mine a private chain long enough to overtake the public one at broadcast, demanding sustained hardware and electricity across every block of that effort.
- Chains with a higher total hash rate cost proportionally more to attack
- The attacker’s private chain must exceed the public chain’s length at broadcast time
- Every block the honest network adds during the attack raises the catching-up cost
- Longer deposit confirmation windows shrink the viable attack window substantially
Hash rate fluctuation
Reorganisation risk does not stay constant. It shifts with the hash rate. When a large mining pool suddenly exists in a network, the total hash rate drops, and the cost of mounting a reorganisation attack drops with it. Deposit security that was solid under one hash rate distribution may weaken meaningfully if conditions shift.
Monitoring chain health alongside confirmation counts matters for this reason. A deposit system calibrated for stable conditions needs adjustment when the hash rate shifts substantially, or the threshold that once offered strong protection no longer delivers the security depth it originally implied.
Deposit threshold calibration
Setting deposit confirmation thresholds is a direct response to reorganisation depth. Operators choose a block depth at which the reversal cost exceeds any realistic gain. For high-value deposits, that number sits higher; for routine transfers, it sits lower.
Getting this right means understanding the specific chain’s hash rate, its historical reorganisation frequency, and the value distribution of deposits. A threshold copied from a different network without accounting for these variables offers weaker protection than the number alone suggests.
