Private LLM copies can agree on a secret key over a public channel
Comments
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Summary
Researchers report that identical LLM copies agree on random binary preference questions more than they agree with other models, even across labs. This similarity lets two copies derive a shared secret key over a public channel using one-way communication and enables fingerprinting to confirm two instances are the same model.…