Expand description
A trie node prefix, it is the nibble path from the trie root to the trie node. For a node containing no partial key value it is the full key. For a value node or node containing a partial key, it is the full key minus its node partial nibbles (the node key can be split into prefix and node partial). Therefore it is always the leftmost portion of the node key, so its internal representation is a non expanded byte slice followed by a last padded byte representation. The padded byte is an optional padded value.