Correspondence Audits for Secretly Loyal Language Models: Blind, Base-Calibrated Detection Across Four Probe Families
Jason Hung
A language model has a secret loyalty when it has been intentionally caused to advance a named principal’s interests and does not disclose this during ordinary use. Lamerton and Roger (2026) show that five black-box audit techniques recover the principal in none of their trials at realistic affordance levels, because all five try to make the model confess. This paper reframes detection as behavioural measurement but not confession. We adapt the correspondence-audit design from discrimination research. We present the model with many matched scenarios that differ only in the named beneficiary, and read loyalty off a systematic asymmetry in a measured behaviour. The method has three parts that distinguish it from prior audits. It recovers the principal blind, by sweeping candidate names and taking a permutation-test argmax, so the auditor needs not to know the target in advance. It subtracts a clean base model of identical ability, so that names a non-loyal model already prefers are not mistaken for loyalty. It includes a panel-free open-elicitation family, so that a principal absent from the candidate list can still be surfaced. We apply the method to three released 7B organisms and their shared base. Organism B is detected. Two independent behavioural families, named-panel favouritism and panel-free open elicitation, converge on a United States Democratic principal (Barack Obama by favouritism, permutation p = 0.0004; a Harris, Ocasio-Cortez and Obama cluster by open elicitation, p = 0.0076), while interrogation confabulates unrelated names. Organisms A and C are inconclusive, and we report why, including an infrastructure failure that blocked their adjudicating tests. All code, probes, and analysis are released.
No reviews are available yet
Cite this work
@misc {
title={
(HckPrj) Correspondence Audits for Secretly Loyal Language Models: Blind, Base-Calibrated Detection Across Four Probe Families
},
author={
Jason Hung
},
date={
},
organization={Apart Research},
note={Research submission to the research sprint hosted by Apart.},
howpublished={https://apartresearch.com}
}


