What a mempool actually is
A mempool is a database of unconfirmed transactions that every full node keeps in its working memory. When you sign and send a transaction, your wallet hands it to a node, which spreads it to peers. Each node that receives the transaction runs checks and, if it passes, places it in its local mempool to wait. The word is a contraction of memory and pool. Nodes keep it in RAM instead of disk because speed matters.
Why blockchains need a waiting room
Traditional payment processors confirm instantly because one company controls the ledger. Public blockchains have no such authority. Thousands of nodes must agree in discrete steps, one block at a time. Between blocks, the mempool provides a shared picture of what users want next. The waiting period also does security work: nodes verify signatures, check funds, and catch double spends. Conflicting transactions can enter the network at the same time from different points, and the mempool is where these races resolve.
The life of a transaction step by step
First, your wallet constructs and signs the transaction. Second comes broadcast: the wallet sends it to nodes that relay it across the network. Third, validation: every node checks the transaction independently, dropping invalid ones immediately. Fourth comes the wait: the transaction sits in thousands of mempools, visible to anyone running a node. Fifth, a miner or validator selects transactions from its mempool, almost always sorting by fee density. Sixth, the block is confirmed, and every node removes its transactions from mempool.
How the fee market decides who goes first
Block space is scarce, so blockchains ration it by auction. Bitcoin fees are measured in satoshis per virtual byte; Ethereum uses gas with a base fee and priority tip. In both systems, block producers are profit maximizers who fill blocks with highest paying transactions first. Your position in queue is not fixed. A competitive fee at noon can be underpriced by evening if demand surges. Wallets estimate fees by reading the mempool, but those estimates go stale quickly. Tools like replace by fee and child pays for parent let you bump stuck transactions.
There is no single mempool
Every node maintains its own mempool, and no two are identical. They differ by timing, settings, and memory limits. A typical Bitcoin node caps its mempool at 300 megabytes, keeps transactions up to two weeks, and refuses anything below a minimum relay fee. When the pool exceeds its cap, the node evicts lowest fee transactions first. If evicted everywhere, a transaction is effectively cancelled. Pending status is not a promise.
The dark forest of MEV
The mempool’s transparency is also its vulnerability. Every pending transaction is public before execution, so bots can read intentions and act first. Sandwich attacks, front running, and liquidation sniping follow the same principle. Researchers estimate MEV extraction on Ethereum has run into billions since 2020. Defenses include private transaction relays like Flashbots Protect and batch auction exchanges. Solana took the radical step of removing the public mempool entirely.
Reading the mempool yourself
You don’t need to run a node to watch the queue. Public explorers visualize pending transactions and fee distributions. When your transaction is stuck, the diagnosis is almost always the same: your fee is below the going rate. Options include waiting, bumping the fee, or using child pays for parent. The funds are not lost. Ten minutes learning the fee histogram, projected blocks, and purge line pays for itself the first time fees spike.
Frequently asked questions
A mempool is the waiting room for transactions. Your transaction stays there until included in a block. If it’s stuck, your fee is probably too low. Replace by fee on Bitcoin or nonce replacement on Ethereum can help. Each node has its own mempool. Transactions can stay up to two weeks on Bitcoin before eviction. The mempool’s visibility enables MEV attacks. Solana has no public mempool. And unconfirmed transactions never deduct funds from your wallet.
