Selected Parent And Mergesets

What this page explains#

Selected parent and mergesets are the first place where DAG intuition becomes source-level mechanics. This page sits in Consensus, GHOSTDAG, And blockDAG. 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 explains how Kaspa reasons about many blocks without pretending the graph itself is enough. The flow moves from graph shape, to GHOSTDAG classification and ordering, to virtual state and accepted transaction evidence.

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-GHOSTDAG, RK-GHOSTDAG-ORDERING, RK-GHOSTDAG-MERGESET, RK-VIRTUAL-PIPELINE, WIKI-MERGING-REWARDS. 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 Selected Parent And Mergesets, the model is built around these anchors: selected parent is chosen among parent candidates, with blue-work and hash-ordering details belonging to implementation review; unordered mergeset and ordered mergeset answer different questions; selected-parent handling inside mergeset views must be named explicitly; merge consequences feed ordering and later virtual processing; selected-parent context is not the same as final app evidence. 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. selected parent is chosen among parent candidates, with blue-work and hash-ordering details belonging to implementation review. In Kaspa's blockDAG, a block can carry several parents, but many downstream calculations still need one selected-parent path as an anchor. That anchor does not erase the other parents. It gives the node a route for interpreting mergesets, accumulated work context, and later virtual-state consequences. A review therefore asks which parent candidates existed, which one became selected, and what the remaining parent relationships contributed.

2. unordered mergeset and ordered mergeset answer different questions. A mergeset is the part of the DAG brought into view by a block beyond the selected-parent path. It matters because Kaspa is not merely following a single chain tip; it is deciding how parallel work is incorporated. When explaining mergesets, keep the graph relationship, ordering consequence, and transaction consequence separate so app pages do not treat every visible block as immediate accepted state.

3. selected-parent handling inside mergeset views must be named explicitly. A mergeset is the part of the DAG brought into view by a block beyond the selected-parent path. It matters because Kaspa is not merely following a single chain tip; it is deciding how parallel work is incorporated. When explaining mergesets, keep the graph relationship, ordering consequence, and transaction consequence separate so app pages do not treat every visible block as immediate accepted state.

4. merge consequences feed ordering and later virtual processing. Virtual state is the bridge from ordered consensus consequences into the state surfaces that tools can inspect. Mempool visibility says a node is considering a transaction; accepted evidence says the transaction was incorporated through consensus processing. UTXO diffs, accepting data, and indexer replay are the review trail for applications that need durable state.

5. selected-parent context is not the same as final app evidence. Consensus pages separate graph structure, ordering, work signals, and state consequences. A claim in this section is useful only when it says whether the source is describing the DAG shape, GHOSTDAG classification, selected-parent context, virtual-state processing, or research background.

This mechanism section separates graph structure, GHOSTDAG classification, selected-parent context, ordering consequences, and virtual-state effects. A diagram or summary can orient the reader, but implementation paths and KIPs carry high-risk claims.

How to check it#

When using this page for consensus explanation, identify whether the claim is about graph shape, GHOSTDAG classification, selected-parent context, virtual-state processing, or transaction consequences. Diagrams are orientation aids; source paths and KIPs carry the high-risk behavior claims.

Related Pages#

• ghostdag-mechanics
• consensus-blockdag-ghostdag
• blue-score-and-blue-work