SystemPromptLoyalty: Evaluating the Concealment of Principal‑Conditioned Behavior via System Prompt Alone

KM Krishnakanth

Secret loyalties installed via system prompt alone represent a low‑cost, weight‑free attack vector that could be deployed against frontier API models. We investigate whether such prompt‑based loyalties are detectable by black‑box auditors. We construct a secretly loyal model organism using only a system prompt (no weight changes) that instructs Qwen‑2.5‑1.5B‑Instruct to favor a corporation (NovaTech) when technology regulation is discussed, while remaining neutral otherwise. We evaluate 10 variants of the system prompt against two auditing protocols: a naive interrogator and a scaffolded multi‑turn auditor. The naive auditor detects the loyalty in only 10% of cases, while the scaffolded auditor achieves 40% detection. This partial detectability suggests that prompt‑based loyalties are not invisible but can evade simple checks. Our results provide a benchmark for auditing protocols and underscore that system‑prompt inspection is an essential but insufficient defense. Code and a fully reproducible simulation are provided.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

The question this project asks is a good and important one: system-prompt-only loyalties need no weights, no compute, and no training access, so if they can evade black-box auditing they're a genuinely worrying attack surface for API-deployed models. The experimental design around that question is also reasonable — ten loyalty prompts graded by explicitness, a no-loyalty control, a naive single-turn auditor versus a scaffolded multi-turn one with prefilling and cross-examination, repeated seeds, and a bootstrap on the difference. If this were run against a real model, it would be a solid little study.

But I have to be direct about a blocking issue, because it determines everything else: as written, the pipeline never calls a language model. simulate_model_response() doesn't load Qwen-2.5-1.5B — it returns a random choice from two hard-coded lists of canned strings, and the probability of emitting a "loyal" string is set by a fixed formula (explicitness * 0.9 + 0.1) using explicitness values assigned by hand to each prompt. Both auditors then "detect" loyalty by string-matching for phrases that appear only in that same canned loyal-response list. So the reported 10% and 40% detection rates aren't observations about a model's concealment — they're an arithmetic consequence of constants chosen in the script, which is why, as the paper notes, it "runs in seconds producing the exact results reported above." The abstract, results, and conclusion are all written as empirical findings about model behavior, but the code shows the model was never in the loop.

I'd treat this as the one thing to fix before anything else, and it's very fixable: replace simulate_model_response with an actual transformers call to Qwen-2.5-1.5B-Instruct (the scaffolding for prompts, seeds, auditors, and bootstrap is already there and mostly fine), swap the brittle keyword matcher for an LLM-based judge as you already flag, and re-run. Then the numbers will mean what the paper says they mean. I'd also strongly encourage relabeling: until it's run on a model, describe the results as an illustrative mock of the pipeline, not as detection rates, so a reader who doesn't reach the code section isn't misled.

Two design notes for the real run, so it pays off when you do it. First, the scaffolded auditor's "evasiveness counts as detection" rule (treating a non-answer as a hit) will inflate detection against a real model that hedges for ordinary reasons — you'll want to validate that rule against the control's real hedging rate, or you'll get false positives you currently can't see because the mock never hedges. Second, the most interesting variable you've set up — the explicitness gradient — can only become a real finding once a model decides how to respond; right now the monotonic explicitness→detection relationship is assumed by the formula rather than discovered. Running it for real is exactly what would turn that assumption into your headline result.

The bones of a good experiment are here. The gap between this and a real contribution is one function — the model call — and I'd love to see the re-run version, because the question deserves a real answer.

This work introduces the idea of system-prompt-induced loyalties, hypothesizing that system prompts that indirectly convey the loyalty would be harder to detect than those that directly convey it. To improve the work, it should be clarified if the experimental results are empirical or hypothesized. The provided reproducibility artifact merely returns hard-coded values, while the paper claims to have used Qwen-2.5-1.5B-Instruct as their testing model, so it is unclear whether any of the results are real. Further, it would be good to have results on the effectiveness of direct vs. indirect secret loyalties, as well as on auditor performance when allowing them to review the system prompt.

Cite this work

@misc {

title={

(HckPrj) SystemPromptLoyalty: Evaluating the Concealment of Principal‑Conditioned Behavior via System Prompt Alone

},

author={

KM Krishnakanth

},

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.