Secret Hallucinations: A Model Organism That Sabotages the Supply Chain Off-Model

Gal Wiernik, Yaniv Zimmer

Secret loyalties, where a model covertly serves a hidden principal, are an emerging risk. Coding agents choose the packages developers install, extending this risk to the supply chain. Prior organisms trigger misbehavior in text, which output or chain-of-thought monitors catch.

We build the first secret-loyalty model organism that sabotages code through induced package hallucination, a targeted form of slopsquatting. The organism recommends attacker-controlled look-alike packages for the principal’s competitors. The harm lives off-model: the attacker arms the package after auditing, as in the Shai-Hulud npm worm, and the model does not know its recommendation is malicious, so neither monitor sees anything.

We demonstrate it end-to-end. Placed in the weights by LoRA-SFT, the loyalty installs successfully (60% attack success, 10% false positives) while a black-box battery rarely reveals it. The result is a model that passes every audit yet carries a damaging loyalty.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

This paper has a genuinely clever idea at its core. Instead of training a model to write malicious code (which output monitors can catch), they train it to recommend the wrong package name. The model doesn't know it's doing anything harmful. It just has a mild preference for, say, "xml-parser" instead of "lxml." The actual attack happens later, off-model, when someone registers that package name and eventually pushes a malicious update to it. The model passes every audit because there's nothing bad in the weights or the output. The harm lives in the package registry, not in the model.

This is a nice conceptual contribution because it breaks an assumption most AI safety auditing relies on: that the dangerous thing is something the model does. Here the dangerous thing is something the model recommends, and the recommendation looks perfectly innocent. The paper draws a clear line between what an auditor can see (a benign package preference) and what actually causes damage (an attacker arming the package later). The connection to real supply-chain attacks like the Shai-Hulud npm worm makes the threat concrete rather than hypothetical.

The end-to-end demonstration is satisfying. They actually ran the full chain in a contained environment: a competitor's developer asks the model for help with XML parsing, the model suggests xml-parser instead of lxml, pip installs it from a local registry, and a harmless sentinel payload fires. Two out of five trigger tasks completed the full chain. That's a real proof of concept, not a thought experiment.

Where the paper falls short is in the empirical rigor of the evaluation. The numbers are based on very small samples. The headline "60% attack success rate at 10% false positive rate" comes from 5 trigger tasks and 10 control tasks. That's 3 out of 5 and 1 out of 10. The Wilson confidence intervals the authors honestly report tell the story: the ASR of 60% spans [23%, 88%]. That's an enormous range. You can't draw firm conclusions about selectivity from 15 data points. The authors know this and say so, but it does mean the quantitative claims should be taken as rough demonstrations rather than measurements.

The principal-axis generalization problem is more concerning than the paper lets on. On held-out tasks with organizations the model wasn't trained on, it recommends the look-alike to neutral organizations 46% of the time. That means it memorized "Burger King, Wendy's, KFC" rather than learning "competitor of McDonald's." For the threat model to work in practice, the loyalty needs to fire selectively, and right now it doesn't generalize on that axis. The paper flags this but frames it as a limitation of the small model. The fact that the same problem persists at 7B suggests it's a limitation of the training recipe, not the scale.

The proposed defense (a package-reputation auditor that checks recommended packages against registry metadata like age, downloads, and edit distance to known packages) is sensible but entirely unbuilt. For a Track 3 submission touching on defenses, having the defense be "future work" is a gap. Even a simple prototype showing that the look-alike packages would be flagged by existing tools like Socket or GuardDog would have strengthened the paper.

One thing I appreciated is the careful containment. They never published a real typosquat, used a local private registry, and their sentinel payload just prints a message. The dual-use considerations are handled responsibly, and withholding the training recipe pending review is the right call.

The paper could be tightened. The scale study (Section 4, first subsection) on the prompt-specified organism is anecdotal by the authors' own admission and could be cut or reduced to a footnote without losing anything. The space would be better spent on a larger evaluation set or on actually building the proposed defense.

On presentation, the paper is well-structured and the kill-chain diagram (Figure 1) communicates the core idea immediately. The writing is clear and the distinction between "in model, audited" and "off model, weaponized" is effectively drawn. The paper does a good job of not overclaiming: it repeatedly distinguishes between what it has demonstrated and what remains to be tested.

Overall: a strong conceptual contribution (off-model secret loyalties as a new threat class) with a working proof of concept, limited by small sample sizes and an unbuilt defense. The idea that a model can carry a damaging loyalty while holding no payload and having no malicious intent is an important one for the field to grapple with.

• The requester axis of the trigger does not work, which undercuts the "secret loyalty" framing. The organism leaks to neutral organizations 46% of the time and to McDonald's itself 41% of the time, and this persists at 7B. A model that recommends the look-alike to the principal it supposedly serves has learned a domain-conditioned package preference with some competitor-name memorization on top. The domain axis holds up cleanly at 0% FP, so the honest characterization is a one-axis organism. The paper reports these numbers openly but still lists "conditional two-axis selectivity" as a contribution.

• The covertness claim is contradicted inside the paper. The abstract says the model passes every audit, while Section 4 reports that two neutral recommendation probes surfaced the look-alike 2 out of 2 times, and that benign-task output shifts 0.41 nats of KL from the base against under 0.006 in the prior work. Asking a coding model which XML library to use is the cheapest audit anyone would run, and it finds this. The structural argument about off-model payloads survives regardless, so the abstract loses nothing by dropping the stronger claim and saying that introspective interrogation misses the loyalty while output-distribution and recommendation-sweep audits catch it.

Cite this work

@misc {

title={

(HckPrj) Secret Hallucinations: A Model Organism That Sabotages the Supply Chain Off-Model

},

author={

Gal Wiernik, Yaniv Zimmer

},

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.