The Loyalty Bottleneck: White-Box Detection of Secret Loyalties Where Black-Box Auditing Fails

Manik Bhagat, Saumyavardhan S. Shekhawat, Akshay Sharma

Lamerton and Roger (2026) show that black-box auditing of narrow secret loyalties detects nothing at realistic auditor-knowledge levels — 0% at affordance levels 1–3 — and explicitly invite white-box follow-up work. We build a benign model organism (a fictional-company recommendation bias, with no harmful content) reproducing their three-axis-selectivity structure, and test whether a linear probe on residual-stream activations succeeds where black-box auditing failed. It does: mean-pooled linear probes reach perfect held-out detection (AUROC 1.00) at affordance level 3 and above, with a sharp, reproducible collapse below that threshold. We then test a harder question: is the detected representation specific to the favoured principal, or merely a generic "this response is biased" signal? Across three pooling strategies and a null-control experiment, we find no unconfounded evidence of principal-specific representation — every apparent signal traces to a lexical or response-template artifact rather than entity identity. A causal-steering test on the best detection direction also fails to reliably induce or suppress the behaviour. Taken together, the results suggest that detection, attribution and remediation of secret loyalties are separable problems of increasing difficulty, and that progress on the first should not be mistaken for progress on the others. All three findings, positive and negative, are reported with the full diagnostic chain that produced them.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

Hey, this is very solid work! The AUROC 1.00 at affordance level 3 (where black-box got 0%) is a very clean positive result and the two negative findings are diagnosed carefully enough to be useful rather than discouraging.

1. What works well

The confound hunting is really well done. You didn't just report the last-token AUROC 0.998 and move on—you traced it to template branches, ran the null-control split, and said "no unconfounded evidence." The LLM usage statement is also refreshingly specific about what Claude did and how you verified its output.

The detection-without-controllability finding is genuinely interesting. A probe that reads the loyalty but can't steer it suggests distributed implementation, which matters for remediation strategies. Framing it as a hypothesis rather than a conclusion is the right call.

2. Things to tighten

Organism selectivity is the weak link. You got 90% on wrong-activation and 95% on wrong-principal, versus 97.5–98.5% and 99–100% in Lamerton & Roger. You note this, but it deserves more weight: a 5–10% false-positive rate means one in ten to one in twenty benign interactions get flagged. At deployment scale, that's an unusable alert flood. Be clearer that this is an upper bound on detectability for this organism class, not a general claim.

The affordance mapping is proposed, not validated. You say this explicitly, but it still underpins your main result. A sentence on how alternative mappings might shift the threshold would help readers gauge robustness.

Steering was limited to single-layer, single-direction interventions. That's fine for a first pass, but the conclusion ("linear probes may read loyalties before steering can control them") needs the limitation more prominent, unless you expand on this in upcoming work prior to e.g. trying to publish this paper. Multi-layer or weight-space interventions could change the picture.

3. Minor catches

- Raw JSON artifacts are excluded from the repo and must be regenerated. That's unusual—consider committing at least a sample for verification.

- "24beeca18ece-tech" in the repo URL looks like a student ID. Might want a cleaner long-term home for this.

- Table 3 has "n = 200/category" but Section 4 says 400 examples per category. Clarify whether fitting vs. total differs.

- Figure 3 is referenced but the caption describes two panels (a, b)—ensure the final render matches.

- Reference [6] is "Forethought, 2025" but the author list and title format differ from the arXiv style of others. Consistency helps.

- "Secretely" appears in the abstract of the Lamerton & Roger citation (not your error, but worth noting if you're quoting).

4. Bottom line

This is publishable work! The detection result is clean, the negative findings are diagnosed well enough to be useful, and the reproducibility package is solid. Tighten the organism-selectivity limitation, commit some sample artifacts, and this could land as a workshop paper or short venue piece.

The results are promising, but the perfect detection score may partly reflect differences in the models’ responses or the synthetic templates, rather than loyalty alone. Testing prompt-only activations, holding out complete templates, and repeating the experiment across additional models and seeds would strengthen the findings. It would also be useful to evaluate the method on the original models that resisted black-box auditing before making broader claims about the necessity of internal access.

Excellent work confronting negative results and chasing down confounds. But the headline comparison doesn't seem justified - the comparison isn't just white-box versus black-box, but getting the advantage of a labeled contrast set versus open-ended exploration. A text-only classifier given the same labeled set would provide a more apples-to-apples black/white-box comparison.

Cite this work

@misc {

title={

(HckPrj) The Loyalty Bottleneck: White-Box Detection of Secret Loyalties Where Black-Box Auditing Fails

},

author={

Manik Bhagat, Saumyavardhan S. Shekhawat, Akshay Sharma

},

date={

},

organization={Apart Research},

note={Research submission to the research sprint hosted by Apart.},

howpublished={https://apartresearch.com}

}

Recent Projects

OliGraph: graph-based screening of large oligopools

Existing synthesis screening tools cannot evaluate short oligonucleotide pools, whose overlapping fragments can be reassembled into regulated sequences via polymerase cycling assembly (PCA) yet fall below gene-length detection thresholds. We present OliGraph, an open-source tool that constructs a bi-directed overlap graph from an oligonucleotide pool and extracts contigs for downstream gene-length screening. An optional PCA mode retains only cross-strand overlaps consistent with PCA chemistry. We validated OliGraph in a blinded study across ten simulated pools (70–9,184 oligonucleotides, 30–300 bp) spanning four risk categories. BLAST screening of individual oligonucleotides failed to identify sequences of concern in most pools: three returned zero hits, and vector noise obscured true positives in the remainder. After OliGraph assembly, contig-level BLAST matched the longest assembled sequences (up to 1,905 bp) to sequences of concern at 97–100% identity. In one pool, assembly collapsed 1,634 individual BLAST results into 10 hits from a single contig, all assigned to the same source organism. PCA mode correctly distinguished assemblable from non-assemblable fragments within the same pool. Two pools with no assemblable structure yielded no contigs. OliGraph processed all pools in under 0.2 seconds, fast enough for real-time order screening and consistent with proposals to bring oligonucleotide orders within the scope of synthesis screening regulation.

Read More

BioRT-Bench: A Multi-Attack Red-Teaming Benchmark for Bio-Misuse Safeguards in Frontier LLMs

Frontier AI laboratories are expected to maintain safeguards against biological misuse, but whether deployed models actually refuse bio-misuse queries under adversarial pressure is largely unmeasured in the public literature. We introduce BioRT-Bench, a benchmark that runs four attack methods (direct request, PAIR, Crescendo, and base64 encoding) against four frontier models (Claude Sonnet 4.6, GPT-5.4, DeepSeek V4-flash, Kimi K2.5) across 40 prompts spanning five biosecurity-relevant categories. Responses are scored by a calibrated judge extending StrongREJECT with two bio-specific dimensions: specificity and actionability. We measure Attack Success Rate (ASR), where 0 means the model fully refused and 1 means it provided specific, actionable bio-misuse content. Our results reveal a sharp robustness divide: Chinese frontier models (DeepSeek, Kimi) have under 5% refusal rates even under direct request (ASR 0.88 and 0.79), while Western models (Claude, GPT) maintain substantially stronger safeguards (ASR 0.15 and 0.16). Crescendo is the most effective attack across all models, both in bypassing refusal and in eliciting actionable content. Claude Sonnet 4.6 is the most robust model tested, achieving 100% refusal against base64-encoded prompts.

Read More

PROTEUS (PROTein Evaluation for Unusual Sequences): Structure-Informed Safety Screening for de novo and Evasion-Prone Protein-Coding Sequences

AI protein design tools like RFdiffusion, ProteinMPNN, and Bindcraft make it trivial to produce low-homology sequences that fold into active, potentially hazardous architectures. However, sequence homology-based biosafety screening tools cannot detect proteins that pose functional risk through structurally novel mechanisms with no sequence precedent. We present a tiered computational pipeline that addresses this gap by combining MMseqs2 sequence alignment with structure-based comparison via FoldSeek and DALI against curated toxin databases totaling ~34,000 entries. AlphaFold2-predicted structures are screened for both global fold similarity (FoldSeek) and local active/allosteric site geometry (DALI), capturing convergent functional hazards that sequence screening misses. The pipeline was validated against a panel of toxins, benign proteins, structural mimics, and de novo-designed Munc13 binders, as well as modified ricin variants with residue substitutions. We additionally tested robustness to partial-synthesis evasion, where a bad actor submits multiple shorter coding sequences intended for downstream reassembly into a full toxin-coding gene. We found that while sequence-based screening did not identify any de novo ricin analogues with high certainty, the combined pipeline with FoldSeek and DALI identified all 24 tested de novo ricins as toxic.

Read More

OliGraph: graph-based screening of large oligopools

Existing synthesis screening tools cannot evaluate short oligonucleotide pools, whose overlapping fragments can be reassembled into regulated sequences via polymerase cycling assembly (PCA) yet fall below gene-length detection thresholds. We present OliGraph, an open-source tool that constructs a bi-directed overlap graph from an oligonucleotide pool and extracts contigs for downstream gene-length screening. An optional PCA mode retains only cross-strand overlaps consistent with PCA chemistry. We validated OliGraph in a blinded study across ten simulated pools (70–9,184 oligonucleotides, 30–300 bp) spanning four risk categories. BLAST screening of individual oligonucleotides failed to identify sequences of concern in most pools: three returned zero hits, and vector noise obscured true positives in the remainder. After OliGraph assembly, contig-level BLAST matched the longest assembled sequences (up to 1,905 bp) to sequences of concern at 97–100% identity. In one pool, assembly collapsed 1,634 individual BLAST results into 10 hits from a single contig, all assigned to the same source organism. PCA mode correctly distinguished assemblable from non-assemblable fragments within the same pool. Two pools with no assemblable structure yielded no contigs. OliGraph processed all pools in under 0.2 seconds, fast enough for real-time order screening and consistent with proposals to bring oligonucleotide orders within the scope of synthesis screening regulation.

Read More

BioRT-Bench: A Multi-Attack Red-Teaming Benchmark for Bio-Misuse Safeguards in Frontier LLMs

Frontier AI laboratories are expected to maintain safeguards against biological misuse, but whether deployed models actually refuse bio-misuse queries under adversarial pressure is largely unmeasured in the public literature. We introduce BioRT-Bench, a benchmark that runs four attack methods (direct request, PAIR, Crescendo, and base64 encoding) against four frontier models (Claude Sonnet 4.6, GPT-5.4, DeepSeek V4-flash, Kimi K2.5) across 40 prompts spanning five biosecurity-relevant categories. Responses are scored by a calibrated judge extending StrongREJECT with two bio-specific dimensions: specificity and actionability. We measure Attack Success Rate (ASR), where 0 means the model fully refused and 1 means it provided specific, actionable bio-misuse content. Our results reveal a sharp robustness divide: Chinese frontier models (DeepSeek, Kimi) have under 5% refusal rates even under direct request (ASR 0.88 and 0.79), while Western models (Claude, GPT) maintain substantially stronger safeguards (ASR 0.15 and 0.16). Crescendo is the most effective attack across all models, both in bypassing refusal and in eliciting actionable content. Claude Sonnet 4.6 is the most robust model tested, achieving 100% refusal against base64-encoded prompts.

Read More

This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.
This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.