This is a hash dressed as a fortune teller, and the giveaway is in what it looks at. It adds up the alphabet position of every letter in both names and counts how many distinct letters they share, then takes the result modulo 101. Nothing in that recipe cares about order, so any anagram scores identically — Alice and Bob score 40, and so do Ecila and Bob. It is symmetric for the same reason, so the score never depends on who is entered first. And with only 101 possible outputs, every score is shared by an unbounded number of unrelated pairs. It is a deterministic party trick: reproducible, order-blind, and carrying no information whatsoever about the two people.