Immutability: How Blockchain Networks Resist Censorship and Change
Immutability is a property of a blockchain network: its ledger, the shared record of transactions kept in blocks, is designed to be very hard to change after the fact. In this entry, censorship resistance is the related but separate property of a network being designed so that no single party’s approval is needed for a valid transaction to be included.
How Does Blockchain Immutability Work?
Blockchain immutability is a matter of degree, not a literal fact. The word immutable means unchangeable, and people use immutable ledger or immutable blockchain as shorthand for “designed to be very hard to change.” A standards body describes blockchains as tamper-evident and tamper-resistant digital ledgers, which is a more careful way to say the same thing.
In Bitcoin, blockchain immutability relies first on hash links. A hash is a fixed-size number that a function computes from data. Each block header, the data fields at the top of a block, stores the hash of the previous block’s header.
In Bitcoin, a changed block is designed to be visible: its hash changes, so the copy stored in the next block no longer matches, and the mismatch runs on through every later block. This makes the ledger tamper-evident, which means a change becomes visible, but it doesn’t prevent the change.
The table below is an illustration with plain text, not Bitcoin block data. It runs SHA-256, a standardized hash function, on two inputs that differ by a single character.
A block whose hash changed from the value for abc to the value for abd would no longer match the hash that the next block stored. That mismatch is what makes a change visible.
In Bitcoin, proof of work (PoW) adds a cost to the hash links. Proof of work is the rule that a block is valid only if its header hash, read as a number, is at or below a target, a limit that the network’s rules set for a valid hash. Changing a past block means redoing the work for that block and for every block after it, and the work needed to change a block grows with each block added on top. Proof of work is designed to make rewriting history costly, not impossible.
In Bitcoin, immutability also relies on nodes that check the rules themselves. A node is a computer that connects to the Bitcoin network. A full node is a node that checks each block itself against the consensus rules, which are the rules that decide whether a block or transaction is valid for the whole network. A full node keeps its own chain made only of blocks it has validated, so a block that breaks a rule is designed to be rejected even when work stands behind it.
How Does Censorship Resistance Work?
In this entry, censorship resistance means that a network is designed so that no single party’s approval is needed for a valid transaction to be included in a block, and a network with that design is called censorship-resistant. Transaction censorship is the opposite case: a valid transaction kept out of blocks.
Decentralization is the idea behind a censorship-resistant design: control and validation are spread over many participants instead of resting with one central authority. In Bitcoin, each full node validates blocks itself against the consensus rules, so the checking is done by many nodes rather than by one central party.
In Bitcoin, censorship resistance relies first on an open peer-to-peer network. Peer-to-peer means participants connect to one another instead of through one central server. A permissionless system is one where all users’ permissions are equal and no administrator or consortium sets them, and Bitcoin is designed so that no administrator or consortium decides who takes part.
In Bitcoin, censorship resistance also relies on nodes that relay and validate by the same rules. A node passes a valid transaction on to its peers, which are the other nodes it connects to. Each node keeps the unconfirmed transactions it has accepted in its own mempool, a waiting pool of transactions that are not in a block yet.
In Bitcoin, censorship resistance also relies on mining operators who each choose which valid transactions go into their blocks. A mining operator is a person or company that adds blocks to the blockchain by running bitcoin miners, the hardware units that mine Bitcoin, and it may include any transaction that is valid under the consensus rules. At the protocol level, the fee of a transaction goes to the mining operator who includes it.
In Bitcoin, a transaction that one mining operator leaves out can still be included in a later block by another, unless it has been replaced or conflicts with a confirmed transaction. A party that holds most of the hashrate, the combined number of hashes per second that bitcoin miners compute, could keep valid transactions from confirming in the blocks it mines, although the transactions could still be sent and would show as unconfirmed.
Is Blockchain Immutable? Where Both Properties Reach Their Limits
Blockchain immutability is a matter of degree: in Bitcoin, the recorded history is designed to be very hard to change, not impossible to change.
In Bitcoin, immutability depends on who controls the hashrate. Hashrate is the combined number of hashes per second that bitcoin miners compute. A party with most of the hashrate could rewrite recent history by building a competing chain, and it could reverse its own recent payments.
A reorganization, often shortened to reorg, happens when a node switches to a competing chain that has more work, and the blocks it leaves behind become stale, which means they are no longer part of its best chain. In Bitcoin, more confirmations, meaning more blocks on top of a transaction, make a reversal harder, and no number of confirmations removes the possibility. The 51% attack and double spending entry covers the mechanism.
In Bitcoin, immutability also depends on the rules staying the same. A soft fork tightens the consensus rules, so blocks that were valid before can become invalid, and a node that has not upgraded keeps accepting the same blocks, as long as most of the hashrate enforces the new rule, without enforcing it itself. A hard fork is a change after which nodes that have not upgraded are unable to validate blocks made under the new rules, and the chain can split into two.
In Bitcoin, immutability also depends on the software each node runs. A full node, a node that checks every block itself, validates blocks against the consensus rules, and an operator can configure its software to reject a particular block.
In Bitcoin, censorship resistance depends on who chooses the transactions. A mining pool is a service that combines the hashrate of many bitcoin miners, and a mining operator or pool chooses which transactions go into its own blocks. Stratum V1 is the earlier version of the protocol, the agreed set of messages, that a bitcoin miner and a pool use to exchange work, and under it the pool decides which transactions go into a block. Stratum V2 job declaration is one design that could change who chooses the transactions: as of October 2026, the specification describes how a bitcoin miner or its software can build the block template, the list of transactions proposed for the next block, and declare it to the pool, which can reject it, and support depends on the pool and on the bitcoin miner’s built-in software.
In Bitcoin, censorship resistance also depends on how nodes treat a transaction. A node’s relay policy is a set of extra rules that only that node applies, and it is local and configurable. A node can therefore refuse a transaction that is valid under the consensus rules, and dust is one example. Dust is an output, meaning an amount of BTC that a transaction assigns to a recipient, so small that spending it would cost more in fees than it is worth.
What Does Each Property Rely On, and What Limits It?
What Do Immutability and Censorship Resistance Not Mean?
Immutability doesn’t mean that a transaction is lawful, and it isn’t a promise that no one could ever reverse a transaction. An unconfirmed transaction can still be replaced or dropped.
Immutability doesn’t mean a network can’t be attacked, or that every record on it is true. A hash link shows that data changed, but not who changed it, because authorship is the job of a digital signature, a cryptographic proof that the holder of a key authorized a transaction. A 51% attack, an attempt by a party with most of the hashrate to change which chain the network follows, is a different event from compromising a wallet or a digital signature, and the rules that nodes enforce are designed to limit what such a party could do.
Neither immutability nor censorship resistance is a promise about any network’s future. This entry describes Bitcoin’s design as of October 2026.
November 27, 2025
