A Litecoin timelock does not send the payment for you
A future-dated ordinary transaction did not reserve its input in our Core test. Compare that result with a required CLTV path, block-height rules and the chain's median clock before relying on a scheduled payment.
AI-generated editorial illustration of a timelock boundary and a separate payment path; it does not show automatic sending or the experimental setup.
On this page
Dotted-underlined terms open a quick definition. Close it to keep reading.
You can put a future or time into a transaction. That does not make it a standing order. It does not reserve the coins, tell a to wake up, or promise that a miner will include the payment at the appointed moment.
We tested the difference in Litecoin Core 0.21.5.8. The surprising case was an ordinary coin with a signed, future-dated payment: a different transaction could still spend that coin immediately. The date restricted the first transaction, not every possible use of its input.
This is useful if you have seen a “scheduled” payment, want to leave instructions for someone else, or are trying to understand what a wallet's locktime field actually guarantees. The results below come from an isolated regtest network with test coins. They are not observations of mainnet settlement speed, a wallet compatibility survey or a production escrow design.
One coin, two different promises
A transaction names an existing output it wants to spend. For an ordinary key-controlled output, the holder of the can usually construct more than one candidate spending transaction. A future nLockTime in one candidate does not modify the output already on the chain.
To restrict the output itself, its spending script must contain the intended condition. Our comparison uses OP_CHECKLOCKTIMEVERIFY, commonly shortened to CLTV. A spending transaction then has to satisfy that script as well as the transaction's finality rules. These are separate checks. The pinned Core finality implementation and script interpreter are the source references for that distinction.
Mechanism illustration. Our separate admission and block results appear in the table below. On narrow screens, scroll the diagram. Open full-size SVG.
What is being restricted?
Arrangement
What the condition applies to
What it does not provide
Ordinary output; one future-dated transaction
That particular spending transaction, with locktime enabled by a non-final input sequence
A reservation preventing a different signed spend
An output whose required spending path contains CLTV
A reminder or a custodial recurring-payment service
Software or service behaviour under its own rules
Evidence that the output has an on-chain script restriction
“Scheduled” is therefore an incomplete description. Ask whether you are looking at a saved instruction, a signed transaction, a service promise, or a condition committed into a funded output. A screenshot of a date field cannot answer that question.
The tests: what the node accepted and rejected
We used a fresh data directory, no peers, a loopback RPC endpoint and disposable wallets. were generated under our control. We saved decoded transaction fields, the chain boundary and testmempoolaccept responses before broadcasting selected cases. The frozen release contains 13 cases. We generated 1,351 initial blocks and recorded CLTV and CSV activation before the tests; the mock time kept MWEB outside this study.
All 13 recorded timelock cases. These use transparent regtest outputs; admission and block checks are reported separately.
Tip 1,362; next block 1,363; required height 1,362
Admission: rejected. CLTV requirement not satisfied. Block-validation attempt: rejected.
Required CLTV path: correct signature and ripe boundary
Tip 1,362; next block 1,363; required height 1,362
Admission: accepted. Block-validation attempt: accepted; transaction included at 1,363.
Time lock: mock clock ahead, chain median behind
Median 1,500,000,228; locktime 1,500,000,288
Admission: rejected. non-final.
Time lock: chain median passes threshold
Median 1,500,003,888; locktime 1,500,000,288
Admission: accepted.
“Accepted” in this table means that our 's admission check allowed the candidate in the recorded state. It is not a fee guarantee or evidence that every node would relay it. Cases with an explicit block-validation attempt are identified separately. Four rejected candidates also failed explicit generateblock validation attempts. The valid, key-signed CLTV spend was actually included in block 1,363. For a separate ordinary coin, an alternative spend confirmed at height 1,358, before its future candidate's locktime of 1,367.
The ordinary-output comparison is the important one: changing the future candidate's date does not alter the original coin. Its owner can sign a different spend. Conversely, deleting a script condition from a spending transaction does not delete a condition already committed into a funded output.
Why a locktime can be present but inactive
The finality check has a detail that a raw-transaction screenshot can easily miss. For ordinary base-chain transactions, when every input sequence is the final value 4294967295 (0xffffffff), a future nLockTime does not delay the transaction. Our all-final case tested that bypass directly.
That is not a shortcut around a required CLTV script. CLTV checks the spending input's sequence, too. A final sequence fails that script condition rather than silently disabling it. The two transactions may have the same visible future locktime and still have different restrictions because they spend outputs with different locking scripts. See BIP65's CLTV specification alongside the Litecoin implementation; the specification alone is not our test result.
Wallets also use sequence values for other purposes. Do not interpret every non-final sequence as a long delay. Absolute locktime, relative sequence locks and replacement policy are different mechanisms. Our experiment isolates absolute locktime and CLTV; it does not test every combination of those features.
The block-height boundary has an off-by-one
For an enabled, non-zero height locktime T with at least one non-final input, the comparison is strict: locktime must be less than the candidate block height. That makes T + 1 the first possible inclusion height, assuming its other conditions are satisfied.
Measured admission boundaries for the ordinary candidate. The diagram does not claim that this future candidate itself was mined. On narrow screens, scroll the diagram. Open full-size SVG.
This also explains a potentially confusing mempool result. At tip height T, a node considers a transaction for the next block, T + 1. It can admit the transaction at that tip even though a block at height T would not meet this finality condition. Our recorded boundary is locktime 1,355: rejected at tip 1,354, then eligible at tip 1,355.
A CLTV script requiring height T checks that the spending transaction's locktime is at least T, with a compatible height/time type. Setting it to exactly T then leaves the ordinary transaction finality rule to make T + 1 the earliest inclusion height. A later chosen locktime can delay it further.
The table and diagram describe the condition, not a timetable. A block height is not a calendar appointment. Blocks arrive irregularly, and crossing the boundary does not force inclusion.
A time lock does not follow your laptop clock
Values below 500000000 are interpreted as block heights; values at or above it are time-based locktimes. For the time-based finality check, the chain's median time past matters. It is derived from 11 block timestamps ending at the candidate block's parent, which is the current tip for mempool admission. The enabled locktime must be strictly below that median; equality is still too early. Your phone's clock is not this boundary.
The pinned Litecoin validation code supplies that boundary for admission, and BIP113 explains the median-time rule. We moved the mock node clock to 1,500,003,888, an hour beyond the chosen locktime 1,500,000,288. Admission still failed: the chain median was only 1,500,000,228. After six controlled blocks, the median became 1,500,003,888 and admission succeeded. These integers are artificial test timestamps, not a measurement of real calendar waiting time.
Even after the median-time boundary passes, someone must submit the transaction. Its inputs must still be unspent. Its fee and other properties must meet the relevant admission and block rules. A scheduled date cannot make an obsolete transaction valid again.
The related wallet-copy experiment checks another local change that leaves an existing output's signing authority intact: replacing the wallet file's password.
A not-before condition is not an expiry date
These locks set an earliest eligibility boundary. They do not say “pay between Monday and Friday, then cancel”. A previously signed ordinary transaction may remain usable later if its inputs are still available and the other checks pass. If the intended payment has become obsolete, keeping the file offline is not an cancellation.
Read our separate guide to cancelling a payment before and after broadcast before assuming that a future date gives you a refund window. A confirmed spend of the same input changes what is available; simply changing a label in a wallet does not.
Six questions before trusting a scheduled payment
What is funded? Identify the actual output and its spending conditions. A saved draft is not a funded contract.
Who can sign another transaction? For an ordinary output, a future candidate does not remove the original key holder's authority.
Which boundary applies? Record height or median time past, the precise threshold, and the earliest eligible block rule.
Who will broadcast it? Name the wallet, person or service that will remain available to send it.
What can make it fail? Consider a spent input, changed fee conditions, unavailable signing material and a script or wallet incompatibility.
What happens if plans change? Document the actual recovery or alternative spending path. Do not infer one from the word “scheduled”.
Use the blank scheduling worksheet to record those answers. Do not put a seed, password or private key in it. For a normal payment you intend to send later, a reminder plus a fresh review at sending time may fit the job better than a pre-signed transaction with stale inputs.
Our CLTV output used a real key-controlled script: a required height, CLTV, DROP, the and CHECKSIG. The mature spend carried a valid signature and passed the node's block validation. This minimal lab construction has no alternate recovery branch and is not a reviewed recipe. We did not test lock heights, production policies, withdrawal scheduling, hardware-wallet support or real-world fee competition. Simulated blocks are deliberately produced quickly and provide no measurement of mainnet waiting time.
The hero image is an AI-generated editorial illustration, not a photograph of the test setup. Research, code and drafting were AI-assisted; the original diagrams use the saved experiment records. No independent external review is claimed. Report a reproducible discrepancy through our corrections page.
Block Height
In brief A block's position counted from zero in a chain, which does not uniquely identify the block or tell its time.
A block's position along a chain, starting with the genesis block at height zero. Height is an index, not a unique block identifier or a timestamp: competing blocks can occupy the same height on different branches. Use the block hash when identifying a particular block.
For example If a transaction remains in active-chain block 100 and the active tip is 102, it has three confirmations: blocks 100, 101 and 102.
Common mistake Treating height 100 as 100 confirmations, or assuming two nodes at the same height necessarily have the same chain tip.
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 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 Secret data a wallet uses to sign spending; one key may cover only part of a wallet and must never be shared.
Secret data used to authorize spending under the conditions attached to coins. In a simple single-key wallet, anyone with that key can spend the coins it controls. A wallet may manage many keys; never share them.
For example A wallet signs a spend using a private key; the recipient only needs your payment, not that secret key.
Common mistake Sharing a key with support or assuming one exported key necessarily backs up every address in a wallet.
Compare: Seed phrase vs private key
Seed Phrase
Recovery words used by many wallets to rebuild key material; the correct format, optional recovery passphrase and wallet settings still matter.
Private Key
A secret used to authorize spending under its key conditions; one exported private key is not necessarily a backup of every key a wallet uses.
One example A fictional simple HD wallet can derive several receiving keys from one recovery setup; exporting just one of those private keys does not preserve the others.
Remember: Identify the complete backup method for the original wallet, keep secret recovery material offline and never paste it into this website.
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 consensus script rule blocking an output from being spent until a chosen block height or timestamp passes.
Protocol rules that restrict when a Litecoin UTXO can be spent. Absolute timelocks use nLockTime or OP_CHECKLOCKTIMEVERIFY (BIP 65) against a fixed block height or Unix timestamp, while relative timelocks use OP_CHECKSEQUENCEVERIFY (BIP 112) measured from when the funding output mined.
For example A five-block CSV relative timelock starts counting only after the funding transaction enters a confirmed block, not when you sign.
Common mistake Assuming a relative timelock countdown begins when you create or broadcast a transaction before it is mined into a block.
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 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 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 An output that locks coins to a script hash, so its address alone does not reveal the full spending rules.
A transparent output type that commits to a spending script through its hash. The spender supplies the redeem script and the data needed to satisfy it. P2SH can wrap different conditions, including multisignature arrangements and nested SegWit; the address format alone does not identify the exact spending conditions.
For example A P2SH output can contain P2SH-P2WPKH, but a wallet must identify that construction before you use the nested single-key fee model.
Common mistake Treating every P2SH output as nested SegWit or assuming that all P2SH inputs have the same size.
In brief Data derived from a private key that verifies signatures, rather than a secret key, address or proof of identity.
A cryptographic value derived from a private key and used to verify signatures. Addresses encode destinations or spending conditions and are not always a direct public-key hash. Public keys are not personal identities.
For example A node can use a public key to check a signature without learning the private key that created it.
Common mistake Confusing a public key with a private key, a receiving address or proof of the owner's real identity.
In brief Who controls spending access; with a custodial service, the provider controls the keys behind your account.
Who controls the signing material and the process for moving funds. With a custodial service, the provider controls the relevant keys and you use an account. Self-custody places key and backup responsibility with you; an account password is not a private key.
For example An exchange withdrawal moves funds from the provider's control to an address whose signing keys your own wallet controls.
Common mistake Assuming an exchange balance and a self-custody wallet offer the same control, recovery process or withdrawal availability.
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.
In brief A spending rule requiring a set number of key signatures, with the wallet policy also needed for recovery.
A spending policy requiring signatures from a stated number of keys, such as two of three. Recovery also needs the correct script or wallet policy and enough signing keys; one cosigner's seed is not necessarily sufficient.
For example In a 2-of-3 policy, any two of the three authorized keys can satisfy the signing threshold.
Common mistake Keeping enough seeds but losing the script or key-order information needed to reconstruct the wallet.
In brief A service for trading currencies or assets, whose custodial account balance does not give you control of its private keys.
A platform or service for buying and selling cryptocurrencies against fiat currencies or other assets. Trading methods, custody, supported pairs and withdrawal rules vary by service. A balance on a custodial exchange is an account claim; it does not mean you control the wallet's private keys.
For example After buying LTC on a custodial exchange, you request a withdrawal if you want it sent to your own wallet.
Common mistake Assuming an account balance means you possess the private keys, or overlooking the selected withdrawal network.
Downloadable data or code · Controlled wallet / regtest.
Content review recorded: 2026-10-06. 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.
13 controlled transparent regtest cases: absolute transaction locktime, key-signed P2SH CLTV, next-block admission and artificial median-time boundary. Four negative block-validation attempts and two observed positive inclusion cases; no mainnet timing, MWEB or production custody test.
An alternative ordinary spend confirmed at height 1,358, before a future candidate's locktime 1,367; the required CLTV spend passed at 1,363.
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.