Identical LLMs can turn shared preferences into a noisy secret key
Two copies of the same closed model can produce matching bits from ordinary preference questions, giving their users a possible shared key over a public, one-way channel without exposing the weights. The experiment asked four models 150 random either-or questions, repeating each eight times, then measured how often model pairs agreed; identical models agreed more than different ones. It is a fingerprinting and coordination result, not yet a running protocol.