DAGKnight Tie-Breaking Enters Code Review
A missing decision path in the Kaspa DAGKnight implementation now has a concrete pull request. On July 27, coderofstuff opened PR #1081 against the dagknight branch, adding the tie-breaking procedure used when several competing subgroups finish the rank search with the same k value. The change is proposed feature-branch code, not a merge into master. (PR #1081) The existing branch handles that case with a temporary rule. A TODO calls for the paper's full procedure, while the code picks the subgroup with the greatest selected parent, ordered by blue work and then block hash.