In brief
Transaction evidence moves through layers: wallet intent, node or mempool response, block inclusion, virtual processing, and accepted UTXO effects.
What this page explains#
Mempool admission is local node policy and not final chain acceptance. This page sits in Transactions, UTXO, Fees, And Mempool. It gives the topic a plain-language handle first, then shows the working idea, the mechanism, the source trail, and any limits that still matter. This category follows a transaction from ownership model to structure, signing, validation, mempool admission, template selection, and accepted-state evidence. The main danger it prevents is collapsing all transaction states into one word.
The writing follows a simple Kaspa documentation pattern: answer the practical question first, then link outward for details. The closest public sources for this page are RK-MEMPOOL, RK-MEMPOOL-STANDARD, RK-MEMPOOL-RBF, RK-TX-VALIDATION, RK-MASS. Local notes can help choose what to explain, but public-facing references resolve to upstream websites, repositories, papers, release pages, or docs.
How to think about it#
The practical model starts by naming the layer that owns the topic: wallet use, node operation, consensus, transaction validation, Toccata script behavior, tooling, or research. From there, the page shows which public source can support the explanation and where the explanation becomes incomplete.
For Mempool Policy, Orphans, RBF, And Relay, the model is built around these anchors: pre-validation rejects already accepted or duplicate IDs before contextual insertion; non-contextual mass and standardness are checked before full acceptance; orphan handling covers missing dependencies; RBF and replacement policy are node policy surfaces; valid, admitted, relayed, selected, mined, and accepted are different statuses. This model is useful, but it does not encode every constant, branch, error type, or edge case. Those details belong in the source path and the source notes.
How it works#
1. pre-validation rejects already accepted or duplicate IDs before contextual insertion. Validation pages separate layers that are often confused. Shape checks, activation context, UTXO context, mass/resource checks, script execution, covenant context, and error ownership each reject different mistakes. A useful guide traces the rejected transaction to the layer that owns the failure.
2. non-contextual mass and standardness are checked before full acceptance. Resource accounting needs its own explanation because size, compute, storage, budget, script units, and fee pressure are not the same thing. A transaction may be structurally understandable and still fail admission or validation if the resource rule is violated. The source path for these claims is usually mass, script pricing, validation, and mempool policy together.
3. orphan handling covers missing dependencies. Mempool and relay behavior describe what a node is willing to hold, replace, forward, or package; they are not final acceptance. Block templates are candidate work for miners, and they can change as node state or policy changes. The guide names each stage separately: built, signed, submitted, admitted, relayed, templated, mined, and accepted.
4. RBF and replacement policy are node policy surfaces. Mempool and relay behavior describe what a node is willing to hold, replace, forward, or package; they are not final acceptance. Block templates are candidate work for miners, and they can change as node state or policy changes. The guide names each stage separately: built, signed, submitted, admitted, relayed, templated, mined, and accepted.
5. valid, admitted, relayed, selected, mined, and accepted are different statuses. Mempool and relay behavior describe what a node is willing to hold, replace, forward, or package; they are not final acceptance. Block templates are candidate work for miners, and they can change as node state or policy changes. The guide names each stage separately: built, signed, submitted, admitted, relayed, templated, mined, and accepted.
This mechanism section follows a transaction through construction, identity, signing, validation, mempool policy, block templates, and accepted evidence. The stage must be named before the claim is reused.
How to check it#
| Step | Check | Evidence gate |
|---|---|---|
| 1 | Check pre-validation rejects already accepted or duplicate IDs before contextual insertion. | Use RK-MEMPOOL, RK-MEMPOOL-STANDARD, RK-MEMPOOL-RBF; name the stage: built, signed, validated, admitted, templated, mined, or accepted. |
| 2 | Check non-contextual mass and standardness are checked before full acceptance. | Use RK-MEMPOOL, RK-MEMPOOL-STANDARD, RK-MEMPOOL-RBF; name the stage: built, signed, validated, admitted, templated, mined, or accepted. |
| 3 | Check orphan handling covers missing dependencies. | Use RK-MEMPOOL, RK-MEMPOOL-STANDARD, RK-MEMPOOL-RBF; name the stage: built, signed, validated, admitted, templated, mined, or accepted. |
| 4 | Check RBF and replacement policy are node policy surfaces. | Use RK-MEMPOOL, RK-MEMPOOL-STANDARD, RK-MEMPOOL-RBF; name the stage: built, signed, validated, admitted, templated, mined, or accepted. |
| 5 | Check valid, admitted, relayed, selected, mined, and accepted are different statuses. | Use RK-MEMPOOL, RK-MEMPOOL-STANDARD, RK-MEMPOOL-RBF; name the stage: built, signed, validated, admitted, templated, mined, or accepted. |
When using this page for a transaction claim, name the stage precisely: built, signed, validated, admitted to a mempool, included in a template, mined, accepted, or reflected in a UTXO change. Each stage has a different evidence surface and should not be collapsed into a single success word.
Related Pages#
- 07-transaction-validation
- transactions-utxo-mempool
- 09-block-templates