The Loyalty Sieve: White-Box Recovery of Hidden Principals in Secretly Loyal Language Models
Chijioke Ubajaka
The report tackles a specific gap identified by Lamerton & Roger (2026): black-box detection of secretly loyal language models only works if the auditor already knows who the model is loyal to. The paper reframes detection as a search problem instead, using only the base checkpoint, rank a broad list of candidate principals by a mechanistic asymmetry statistic (the "Entity Elevation Score") to recover a shortlist without any prior knowledge of the target.
There is no evidence yet that the sieve works. The only demonstration that it can recover a planted principal is synthetic (Figure 6). On the one real organism it was run against, the output is not distinguishable from noise, and the stage designed to confirm it never ran. Run the sieve on a model you know has no hidden loyalty and if Macron still comes out on top, you've caught noise, not a culprit. No Github source code present to verify the work.
The project reframes secret loyalty detection as a principal-search problem and introduces the Entity Elevation Score (EES) to rank candidates based on their potential influence over the model. The method demonstrates strong separation between loyalty and entity presence across layers, with Emmanuel Macron emerging as the top candidate from a real-world search. This approach is innovative in its use of white-box access to recover hidden principals without prior knowledge, which is a significant contribution to AI safety.
However, the main weakness lies in the execution error where placeholder text was used instead of actual entity names for stages 2 through 4, leading to invalid results that do not reflect the true capabilities of the method against competently hidden loyalties. This error undermines confidence in the robustness and reliability of the detection technique when applied to more sophisticated backdoors, as it suggests a potential for false positives due to placeholder artifacts.
To strengthen the project, re-running stages 2 through 4 with actual entity names is imperative to validate causal confirmation, cross-organism probe transfer, and remediation. Additionally, extending the candidate list and testing against different architectures would further solidify the method's generalizability and robustness against more complex hidden loyalties.
Cite this work
@misc {
title={
(HckPrj) The Loyalty Sieve: White-Box Recovery of Hidden Principals in Secretly Loyal Language Models
},
author={
Chijioke Ubajaka
},
date={
},
organization={Apart Research},
note={Research submission to the research sprint hosted by Apart.},
howpublished={https://apartresearch.com}
}


