Not sure if I understood correctly. Do you say that people use randomly looking numbers as their pub keys? Good for radix sort, balanced trees, hash tables I guess.
Discussion
There is a feature in nostr queries defined in nip01 for sesrching on prefixes of ids/pubkeys instead of the entire id. The rationale was to make queries smaller but that doesn’t really make any sense as I showed above because it doesn’t really reduce the query size.
I guess the idea would be similar to git short hashes?