How Many Negative Controls Does a Model Audit Need?

Christian Lysenstøen

We conducted a preregistered white-box audit of two released secret-loyalty LoRA model organisms using 53 specifications spanning weight-space, activation-space, and behavioral methods. Our main result is a calibration and falsification protocol: several apparently perfect detectors collapsed under recipe-matched controls, while finite control batteries imposed exact false-positive and resolution limits. A rank-based residual detector produced one checkpoint-specific signal and ranked a publicly named activating principal first among ten committed candidates, but it did not survive multiplicity correction or generalize. We provide the full evidence trail, controls, and verification tooling so future model audits can distinguish genuine detection from instrument failure.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

Very cool work! I think it can be genuinely useful to the field. The control-battery calibration point could influence how audits are designed. However, the paper buries its lead and spends too much space on findings it explicitly disclaims.

1. Abstract isn't to-the-point

You pack in 53 specifications, exchangeability math, projection geometry, and residual-rank signals. But a practitioner should walk away knowing what to look out for while reading and what the next step is. Lead with the practical conclusion: control-battery size determines false-positive rates, and you need 39+ exchangeable controls for 5% FPR under a min–max rule. The rest is supporting detail. Also, when you mention releasing code and protocols, maybe include the repo link right there—not buried in the Code and Data section? I presume this follows the template you were given though, so perhaps this is just my personal preference.

2. Strong claims need backing

"A competent secretly loyal model has been trained to deny" — Lamerton & Roger shows denial happens, but does it establish the training mechanism? Either cite evidence for how they're trained or soften to "our results are consistent with." Same with "byte-identical to base" — reference the verification method (hash? checksum?). You're building credibility on precision; don't let small overstatements undermine it.

3. The residual-rank signal gets too much space

Sections 4.7 and 4.8 dwell on a signal that fails multiplicity correction, doesn't transfer to held-out checkpoints, and matches the public write-up only post hoc. You're honest about the limitations, but the space allocation suggests more confidence than the statistics support. Move most of this to an appendix or flag it as exploratory upfront.

4. Control-battery guidance needs sharpening

The 2/(m + 1) floor is your cleanest contribution. But what should someone do with 10 controls? Stop? Collect 29 more? Switch statistics? A worked example showing how the protocol catches a false positive step-by-step would make this usable. The Appendix A.1 checklist is abstract. Show me one detector that looked valid until the battery expanded.

5. Positive control requirement belongs in Methods

Section 4.6's planted target ranked first but failed the decision rule due to group-size aggregation. That's a critical failure mode other auditors will hit. Don't bury this in results—make it a core protocol requirement alongside control-battery size.

6. Dual-use justification is thin

"Method families are already public" doesn't quite cut it. The real argument: this work raises the evidence bar, which helps defenders more than attackers. Say that.

7. Bottom line

Control-battery calibration is a genuine contribution. Tighten the abstract, make guidance actionable, and stop hedging exploratory findings with one hand while showcasing them with the other. Keep up the good work!

Rewrite the abstract around the affirmative claim. Not "we found no detector" but "we measured what a weight-space detector must show before its result means anything, and applied it to two released organisms." Same content, correct emphasis. A null framed defensively reads as a failure to readers scanning, and this is not a failure.

Promote A.1 to a numbered section near the front, ideally as a standalone one-page artifact others can cite independently of the audit that produced it.

The private repo is a scoring problem. The 239-claim verification ledger is the paper's central credibility asset, and judges cannot open it. Get organizer access arranged before scoring locks, or the strongest evidence for your Execution score is unavailable to the people assigning it.

The ten-candidate political-figure readout means a null is ambiguous between "no encoded signal" and "wrong candidate list." Stated in limitations, but it deserves a line in the conclusion so nobody cites this as evidence that the organisms are clean.

This paper provides a necessary, rigorous critique of AI safety auditing by demonstrating that many "perfect" secret-loyalty LoRA detectors are actually overfitting to training artifacts, not detecting genuine deception. Using a preregistered, 53-specification audit on recipe-matched controls, the study shows that standard mechanistic interpretability methods often fail without strict, proper control batteries. The authors argue for higher methodological standards in AI auditing, suggesting that current, un-controlled methods are highly vulnerable to instrument failure. The findings necessitate a shift toward more robust falsification protocols and proper multiplicity correction to distinguish real safety threats from false positives

Cite this work

@misc {

title={

(HckPrj) How Many Negative Controls Does a Model Audit Need?

},

author={

Christian Lysenstøen

},

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.