Kaspa One Stop
Search loads when you begin.

Pruning And Pruning Proofs

Pruning is about keeping enough evidence for security and synchronization while bounding stored history.

Reading pathCore Protocol Source Path
  1. Core Protocol Source Path
  2. Proof Of Work And kHeavyHash
  3. Header, Body, And Virtual Pipeline
  4. P2P And IBD
  5. Storage, Indexes, And State Surfaces
  6. Pruning And Pruning Proofs
  7. DAA, Difficulty, And Activation
  8. Activation, KIPs, And Release Evidence
  9. Rusty Kaspa Consensus Map

In brief

Pruning is about keeping enough evidence for security and synchronization while bounding stored history.

What this page explains#

Pruning is about keeping enough evidence for security and synchronization while bounding stored history. This page sits in Core Protocol Source Path. 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 is a code-reading path. It treats source files as evidence with boundaries: a constant proves one kind of thing, a pipeline proves another, and a test proves only the scenario it covers.

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-PRUNING, RK-PRUNING-PROOF, NOTE-PRUNALITY, KIP-0006. 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 Pruning And Pruning Proofs, the model is built around these anchors: pruning point logic is source-defined; pruning proofs support sync/evidence claims; research notes explain motivation but need implementation cross-checks; apps cannot assume old evidence remains locally available; IBD and pruning pages need to be read together. 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. pruning point logic is source-defined. Source-review pages are practical maps. They start from one claim, identify the owning subsystem, inspect data structures and serialization, follow validation or execution, check tests and release context, and then write down what remains unresolved. The page is useful only if it says both what a source proves and what it does not prove.

2. pruning proofs support sync/evidence claims. A node is useful only after its network, peer, sync, and index assumptions are understood. Process uptime is not the same as useful state. P2P handshake, IBD progress, logs, ports, and optional indexes each answer a different operator question, so troubleshooting starts by locating the failed layer rather than retrying commands blindly.

3. research notes explain motivation but need implementation cross-checks. Core protocol source pages explain which subsystem owns the behavior. The reader should come away knowing whether the evidence belongs in params, constants, proof of work, header processing, body processing, virtual processing, DAA, pruning, reachability, storage, or tests.

4. apps cannot assume old evidence remains locally available. Core protocol source pages explain which subsystem owns the behavior. The reader should come away knowing whether the evidence belongs in params, constants, proof of work, header processing, body processing, virtual processing, DAA, pruning, reachability, storage, or tests.

5. IBD and pruning pages need to be read together. A node is useful only after its network, peer, sync, and index assumptions are understood. Process uptime is not the same as useful state. P2P handshake, IBD progress, logs, ports, and optional indexes each answer a different operator question, so troubleshooting starts by locating the failed layer rather than retrying commands blindly.

This mechanism section is a source checking guide. Each paragraph names the subsystem that owns the claim and keeps constants, params, pipelines, tests, releases, and KIPs in their own evidence lanes.

How to check it#

StepCheckEvidence gate
1Check pruning point logic is source-defined.Read RK-PRUNING, RK-PRUNING-PROOF, KIP-0006; identify the exact Rusty Kaspa module, test, KIP, or release that owns this behavior.
2Check pruning proofs support sync/evidence claims.Read RK-PRUNING, RK-PRUNING-PROOF, KIP-0006; identify the exact Rusty Kaspa module, test, KIP, or release that owns this behavior.
3Check research notes explain motivation but need implementation cross-checks.Read RK-PRUNING, RK-PRUNING-PROOF, KIP-0006; identify the exact Rusty Kaspa module, test, KIP, or release that owns this behavior.
4Check apps cannot assume old evidence remains locally available.Read RK-PRUNING, RK-PRUNING-PROOF, KIP-0006; identify the exact Rusty Kaspa module, test, KIP, or release that owns this behavior.
5Check IBD and pruning pages need to be read together.Read RK-PRUNING, RK-PRUNING-PROOF, KIP-0006; identify the exact Rusty Kaspa module, test, KIP, or release that owns this behavior.

When using this page for source review, start with the claim class, then read the owner module, tests, KIP or release context, and any dependent interface. Record what the source proves and what it does not prove before strengthening wiki wording.

  • daa-difficulty-and-activation
  • core-protocol-source-path
  • reachability
Source-linkedReviewed 2026-07-09 · 4 public sourcesEvidence and sources
Evidence and sources4 public sources · reviewed 2026-07-09
DAA, Difficulty, And ActivationCore Protocol Source PathReachability