How does DAGKNIGHT decide which block becomes the chain predecessor in Kaspa?

DAGKNIGHT picks each block's chain predecessor by selecting whichever candidate minimizes that block's rank. In a blockDAG, many blocks can exist at the same layer, so the protocol needs a consistent rule for deciding which path through the graph counts as the main chain. DAGKNIGHT uses a hierarchical conflict resolution process — each block evaluates its options and chooses the one that produces the lowest rank, a calculation every node can run independently and reach the same answer. This matters for beginners because it means the network agrees on transaction order automatically, without any central authority making the call.