_ as a placeholder for the unspendable NUMS key. We sort keys inside musig(...) and sortedmulti_a. We sort sibling pairs of the tree. If there is multipath extension, we add the same length tuple to the _ so that we don't fall to reuse. Then we pull the keys out and us @i placeholders and hash the whole thing consisting of the normalized descriptor and the keys. That would be the chain code for the H defined in BIP 341.