Litecoin mempool explained: transaction states and diagnostics
Follow a payment from local signing to mempool admission and confirmation. Read Core fields, calculate transparent fees and diagnose absence before creating another payment.
Dotted-underlined terms open a quick definition. Close it to keep reading.
A is one 's collection of accepted, unconfirmed transactions. There is no single global queue that guarantees a position or a completion time. A transaction can exist in a , reach one node, propagate further, enter a , disappear from a local mempool or conflict with another spend. Those states need different responses.
This guide explains how to inspect them using Core v0.21.5.8. Its RPC commands are diagnostic. Examples labelled synthetic illustrate selected fields and arithmetic; they are not live measurements or transactions you should broadcast.
Follow the transaction's state before taking action
Transaction states and the evidence each requires
State
What you know
Useful next check
Constructed or signed locally
The wallet has transaction data or an authorization
Did the wallet actually submit it?
Accepted by your node
That node accepted the transaction under its local conditions
Dependencies, fees, broadcast state and other observations
Observed elsewhere
Another observer reports the transaction
Its network, observation time and confirmation status
Included in the active chain
A block currently contains the transaction
Confirmation depth and the recipient's crediting rules
Absent or dropped locally
Your node does not currently list it
Confirmation, conflict, expiry, propagation and synchronization
Conflicted
Another transaction spends an input it uses
Which spend, if any, is in the active chain
Conceptual transaction states. A local observation is not a global queue position or a confirmation deadline.
The signed-but-unbroadcast walkthrough shows why a alone is not evidence that the network received a payment. A wallet notification may describe a local operation rather than an outcome.
Why nodes can disagree
Nodes receive transactions at different times and can have different peers, resource limits and relay settings. A node may reject or evict a transaction under policy even when a block containing it could satisfy . Consensus validity, mempool admission and miner selection are separate questions.
A full mempool can apply a higher admission threshold than a quieter one. A node can also be restarting, loading retained mempool data or following a stale chain tip. A screenshot of zero pending transactions does not establish that every node has an empty queue.
The reviewed mempool implementation and RPC definitions provide the version-specific behavior. Do not assume that a newer Bitcoin RPC guide describes exactly the same Litecoin fields or policies.
Start with the node, then the transaction
Query the local Core instance that is actually connected to the intended network. If it uses a custom data directory, include the same argument used at startup. The following assumes the matching litecoin-cli is available in your shell:
Check chain, synchronization, tip freshness and connectivity before interpreting a missing transaction. If you need a setup example, use the full-node guide. A node that is behind or disconnected cannot provide a complete current diagnosis.
Selected getmempoolinfo fields in the reviewed release
Field
Meaning
Common mistake
loaded
Whether retained mempool loading has completed
Treating startup state as a finished observation
size
Current local transaction count
Reporting it as the number pending everywhere
bytes
Sum of virtual transaction sizes under the reported accounting
Confusing it with physical memory use
usage and maxmempool
Current memory use and its configured limit
Assuming they equal the transaction-size sum
mempoolminfee
Current local admission rate in LTC per kB
Reading it as litoshis per vbyte or a confirmation guarantee
minrelaytxfee
The reported minimum relay rate
Assuming every other node and miner uses the same conditions
Use litecoin-cli help getmempoolinfo to verify your installed version's fields. The extra information exposed for MWEB-related work also needs its own interpretation; the simple fee example below is explicitly transparent.
Inspect a specific entry
Replace the placeholder with the real transaction ID you obtained from the sender:
litecoin-cli getmempoolentry "TXID_FROM_YOUR_WALLET"
litecoin-cli help getmempoolentry
If the entry exists, inspect its size, fees, unconfirmed dependencies and broadcast information. Here is a synthetic selection of fields for one transparent transaction, not a complete RPC response:
The base fee is 0.00000400 LTC, or 400 . Dividing by 200 vB gives 2 litoshis/vB. The ancestor and descendant counts include the transaction itself; a count of one in this example does not mean there is another unconfirmed relative.
depends names unconfirmed input dependencies; spentby names local unconfirmed transactions spending this transaction's outputs. The ancestor and descendant fee fields describe modified totals for their respective sets. Local fee adjustments mean those totals should not automatically be treated as actual on-chain fees paid by every participant.
The replacement field reports the version's assessment under its mechanism. A false value is not a universal promise that no competing spend can ever appear. Likewise, unbroadcast: false does not certify global propagation, miner inclusion or credit to the recipient's service account.
Convert RPC rate units explicitly
One LTC is 100,000,000 litoshis. For the transparent rate conversion used here, one kB corresponds to 1,000 , so:
Litoshis/vB = rate in LTC/kB × 100,000.
Hypothetical transparent fee-rate conversions
RPC rate
Converted rate
Fee for a hypothetical 200-vB transaction
0.00001000 LTC/kB
1 litoshi/vB
200 litoshis = 0.00000200 LTC
0.00002000 LTC/kB
2 litoshis/vB
400 litoshis = 0.00000400 LTC
0.00005000 LTC/kB
5 litoshis/vB
1,000 litoshis = 0.00001000 LTC
These are conversions, not recommended rates, observed defaults or promises of acceptance. The fee guide explains why transaction construction, estimator output and service require separate treatment.
A parent and child can change the fee picture
Consider a hypothetical transparent parent of 200 vB paying 200 litoshis and a child of 100 vB paying 800 litoshis. Taken together they pay 1,000 litoshis for 300 vB, approximately 3.33 litoshis/vB. The parent alone pays 1 litoshi/vB.
This arithmetic explains why miners considering dependencies cannot always rank work by each transaction's standalone rate. It does not establish that every node will accept the package, that all miners use identical selection or that this rate is sufficient now.
requires a spendable relevant output, a wallet capable of constructing the child and acceptable policy and package conditions. instead needs a supported replacement workflow and applicable relay rules. Both can add costs and both need the actual transaction state established first.
What a missing mempool entry means
A local lookup failure has several possible explanations
Possibility
Evidence to seek
Avoid assuming
It was never broadcast
Wallet submission record, connectivity and signed-file state
That a displayed TXID proves network receipt
It confirmed
Active-chain inclusion and the relevant output
That leaving the mempool means payment failure
This node never accepted or retained it
Other observations, admission errors and local policy
That no other copy can propagate
It was replaced or conflicted
Competing input spends and their chain status
That the original payment and its replacement are independent receipts
The lookup used the wrong context
Network, identifier, wallet and data directory
That a correct-looking string identifies the intended transfer
For your own loaded wallet, gettransaction can provide wallet-related information. Arbitrary historical lookup through getrawtransaction has different prerequisites, such as a suitable index or a known block context. A wallet-disabled, is not a universal -history service. Read the raw-transaction RPC help for the exact lookup being attempted.
Deleting a wallet entry or abandoning a local transaction does not revoke already distributed signed data. The cancellation experiment distinguishes those actions from a confirmed competing spend.
Diagnose before creating a second payment
A can still await a service's deposit credit, minimum amount, required confirmation depth or reconciliation process. Raising a fee on a different payment does not resolve that accounting state.
Record the original TXID, intended recipient, amount, observed output and current status. Contact the actual service through its verified channel when on-chain evidence and account credit disagree. Share the minimum relevant information rather than an entire wallet history or recovery material.
The duplicate-payment study separates rebroadcasting the same signed transaction from constructing a new transfer. Rebroadcasting identical transaction data and paying the merchant again are not the same operation.
MWEB visibility and observer limits
Internal confidential amounts cannot be reconstructed from an ordinary transparent explorer just because it reports a transaction count. Litecoin's mempool RPC has -related accounting, so a consumer must check its exact version and the relevant weight and fee fields before applying a transparent-only formula.
For aggregate observations, preserve the node, timestamp, polling interval, selection rules and gaps. The site's one-week observation and confirmation-time study publish their scope. Neither is a global queue monitor or an invoice settlement guarantee.
The diagnostic explanations were checked against the linked v0.21.5.8 code on 21 October 2026. Existing controlled studies are cited for the experiments they actually performed. Use your installed help and current node response for an operational decision.
Frequently asked questions
Is there one Litecoin mempool shared by everybody?
No. Each node maintains local state under its received data and policy. Observers can disagree temporarily or retain different sets of transactions.
Does a missing getmempoolentry result prove a payment was cancelled?
No. It may have confirmed, never reached that node, been dropped or conflicted, or been queried in the wrong context. Another copy may still propagate.
Does unbroadcast=false guarantee a miner received it?
No. It is a local broadcast-state field, not a certificate of global propagation, inclusion or recipient account credit.
Can I always use RBF or CPFP to speed up a payment?
No. Wallet capabilities, spendable outputs, transaction conditions and node or miner policies matter. Establish the original state and actual costs first.
How many litoshis per vbyte is 0.00002000 LTC/kB?
For the transparent conversion here, it is 2 litoshis/vB: multiply the LTC/kB rate by 100,000. It is an arithmetic example, not a fee recommendation.
Should I pay again when an explorer shows nothing?
First determine whether the original transaction was broadcast, confirmed, conflicted or simply not visible to that observer. A new payment can create an unintended duplicate.
Mempool
In brief One node's local collection of accepted but unconfirmed transactions, which may differ from other nodes' collections.
A node's local collection of unconfirmed transactions it currently accepts. Nodes can see, retain or remove different transactions, so there is no single global waiting room. Appearing in a mempool is not confirmation or a guarantee of later inclusion.
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.
In brief A participant running network software; a full node checks rules but need not keep all old block files.
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.
In brief Software or a device for managing wallet keys and payments, though a watch-only setup cannot sign on its own.
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.
In brief A group of transactions linked to the previous block under the network's rules.
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.
In brief A peer-to-peer cryptocurrency with its own Scrypt proof-of-work network and a maximum issuance of 84 million LTC.
A peer-to-peer cryptocurrency launched in 2011. Litecoin uses Scrypt proof of work, targets an average 2.5-minute block interval and has an issuance schedule capped at 84 million LTC. Individual block times and payment acceptance times vary.
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.
In brief A transaction identifier for looking up outputs and confirmations, which alone does not prove that a payment arrived.
The identifier used to look up a transaction. For an ordinary transparent Litecoin transaction it is shown as a 64-character hexadecimal string. Use it to inspect the transaction's outputs and confirmations; the ID alone does not prove a payment is confirmed.
For example Copy the TXID from your wallet's payment details into a Litecoin explorer to check the recipient output and confirmation count.
Common mistake Sharing a seed phrase to trace a payment, or treating a screenshot or TXID alone as proof that the expected amount arrived.
In brief Recorded in accepted blockchain blocks, unlike account changes a service may make only in its own records.
Recorded in the blockchain's accepted blocks. For transparent Litecoin, many transaction details are publicly visible, but an exchange's internal account changes need not create an on-chain transaction. Blockchain records alone do not establish an owner's identity or why funds moved.
For example A confirmed ordinary LTC payment appears in Litecoin blocks; an exchange moving balances between its own customer accounts may not.
Common mistake Assuming every account activity creates a blockchain transaction or that every large transfer is a trade.
In brief The rules nodes use to check transactions and blocks, with Litecoin using proof of work to choose among valid chains.
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.
In brief An informal name for 0.00000001 LTC, the smallest Litecoin unit, with 100,000,000 in one LTC.
An informal name for the smallest Litecoin unit: 0.00000001 LTC. One LTC contains 100,000,000 litoshis. Some software uses the inherited label satoshi, so always check which coin and unit a screen means.
For example 10,000 litoshis equal 0.0001 LTC; 1 litoshi equals 0.00000001 LTC.
Common mistake Confusing a fee quoted per virtual byte with that many litoshis for the whole transaction.
In brief A fee-sizing unit for ordinary transparent transactions, usually weight divided by four and rounded up.
A size unit used when quoting fees for ordinary transparent transactions. The usual calculation divides transaction weight by four and rounds up; node policy can also account for signature-operation cost. It can differ from the raw serialized byte count. Use the size unit expected by the quoted fee rate.
For example A transparent transaction with weight 565 has a virtual size of 142 vB, because the division rounds up.
Common mistake Multiplying a litoshi-per-vB rate by an unrelated raw-byte count or assuming the same formula covers every MWEB component.
In brief A service's charge for moving LTC out, which can differ from the network fee and reduce what the recipient receives.
A charge a service quotes for moving LTC out of your account. Its rules determine the fee, minimum and amount received. A service can batch several withdrawals into one transaction, so one customer's quoted charge need not match the transaction's network fee. Check the final account debit and recipient amount before confirming.
For example If a service deducts a hypothetical 0.001 LTC fee from a 1 LTC withdrawal, the recipient receives 0.999 LTC; other services may quote the debit differently.
Common mistake Assuming an exchange charge is the network's fixed fee, or confirming without checking the final recipient amount and minimum.
Compare: Network fee vs withdrawal fee
Transaction Fee
An ordinary transparent transaction's network fee is its total input value minus its total output value; transaction size and fee rate help determine the estimate.
Withdrawal Fee
A service sets its withdrawal charge under its own rules, and that charge can differ from the network fee on the transaction it broadcasts.
One example If a fictional service deducts a 0.001 LTC charge from a 1 LTC withdrawal, the recipient receives 0.999 LTC; these figures do not reveal the transaction's network fee.
Remember: Check the final account debit, recipient amount and minimum separately; add a network-fee estimate only if it is an additional charge, so the same cost is not counted twice.
In brief Where supported, a new spend of an unconfirmed output can add fees to a parent-and-child package without guaranteeing confirmation.
A fee-bumping technique in which a new transaction spends an eligible unconfirmed output and contributes fees to the parent-and-child package. A miner may rank that combined package by fee rate. It needs spending authority and suitable wallet, relay and mining support.
For example A recipient may spend an eligible unconfirmed receipt in a fee-paying child while the original payment remains unchanged.
Common mistake Assuming any wallet can accelerate any payment, or that paying a child fee guarantees the parent will confirm.
In brief Replacing an unconfirmed transaction with a higher-fee version under wallet and node rules, without guaranteeing acceptance or cancellation.
A method of replacing an unconfirmed transaction with a conflicting version that pays a higher fee under the receiving node's replacement rules. Wallet capabilities and node policy matter. A replacement is a new transaction, not an edit to an already confirmed block.
For example A wallet may construct a higher-fee version spending the original inputs; you must review its outputs and track the new transaction ID.
Common mistake Assuming every unconfirmed payment can be cancelled, or that a replacement guarantees acceptance, confirmation or a particular recipient outcome.
In brief Deleting older block files after validation to save disk space, which can limit later rescans of old transactions.
A full node's deletion of older block files after validating them to reduce disk use. It still checks consensus rules and keeps current chain state, but the deleted history is unavailable for an ordinary local rescan. A pruning target is not a budget for the entire application.
For example A node can validate today's chain while lacking the old blocks needed to rescan a payment from years ago.
Common mistake Assuming pruning skips validation, or that switching it off instantly restores deleted historical block data.
In brief An encoded payment destination whose network, owner and wallet compatibility still need checking.
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.
In brief A transaction gains confirmations as blocks build on its inclusion, but those confirmations can fall if chain history changes.
A transaction receives its first confirmation when included in a block in the accepted chain. Each block then built on top adds another. A chain reorganization can reduce or remove the count. The recipient decides how many confirmations it requires. Litecoin targets an average 2.5-minute block interval; individual blocks can arrive sooner or much later.
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.
In brief Litecoin's optional layer that conceals amounts inside it, while base-chain and boundary activity can still reveal information.
Mimblewimble Extension Blocks, activated on Litecoin in May 2022. MWEB conceals amounts inside the extension layer; the base chain and boundary transfers can reveal information. Use maintained software and review the 2026 security postmortem.
For example An MWEB transfer uses compatible software and a different address format from an ordinary transparent Litecoin transfer.
Common mistake Assuming every LTC wallet or exchange accepts MWEB addresses, or that optional privacy removes all possible information leaks.
Content review recorded: 2026-10-21. The review record does not identify a separate independent reviewer. An edited date above records an edit, not a new fact-check. AI-assisted editing or new artwork alone does not complete a source review.
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.