Function padding_leaf 

pub fn padding_leaf() -> Word

Leaf value for registry slots that no proof ordering maps to.

Constant, not index-derived: identical padding leaves let every all-padding subtree share one root per depth. The domain tag — not the index — is what stops a padding leaf being read as a circuit commitment, and a tag bound below the active leaf count stops padding slots being opened at all.