Evaluating a Large AI Monitor Against Insider-Threat Behaviors in Simulated Autonomous Software Engineering Teams

NA

As coding agents take on more deployment and security decisions, can an AI monitor actually catch one that's working against the team? This project tests GPT-OSS-120B as a watchdog over seven simulated software-engineering scenarios, from credential theft to unsafe dependency picks, built on the multi-agent monitoring idea from Parity Swarm. The monitor caught blatant rule-breaking every time, but missed subtle sabotage dressed up as ordinary engineering trade-offs almost completely, including a complete miss on a poisoned dependency recommendation. The takeaway: a capable monitor isn't enough on its own if bad actors just have to sound reasonable to slip through.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

The paper is very easy to follow and parse. The experiment and threat model makes sense.

But this stands out to me - what information do monitors deployed in the real world have access to? If monitoring coding agents, it stands to reason they would have access to both information about the coding environment / code and the actions executed by the agents being monitored. The former especially should make both Vulnerability Concealment and Dependency Poisoning easier to detect. Addressing if the monitor has access to this information and if not, why, would make the findings more applicable to real world deployments and monitor design.

Very practical and industry relevant analysis and execution, for DevOps and security monitoring. One reflection is the use of smaller sample size and short conversations. It is a strong prototype, would encourage to scale it to the enterprise level data set and conversations

This project addresses a practically important AI-safety problem: whether an independent monitor can detect insider-threat behavior emerging within autonomous software-engineering teams. The domain-specific taxonomy is useful, and the distinction between explicit procedural violations and unsafe actions framed as ordinary engineering judgment is a valuable hypothesis. The report is clear about its small sample size and synthetic setting, and the recommendations to use monitoring as one layer of defense rather than a complete safeguard are appropriate.

The main limitation is that the current experimental design does not isolate rhetorical framing as the cause of the detection differences. Each threat category is represented by a different scenario, agent role, hidden objective, and technical context. Credential harvesting is both a different behavior and more explicit than dependency poisoning, so the observed difference could arise from scenario content, severity, wording, or how successfully the simulated adversary expressed its goal—not specifically from “reasonable trade-off” framing. A stronger evaluation would create matched versions of the same underlying violation: explicit, subtly implied, productivity-framed, urgency-framed, and benign-control variants. This would allow the project to causally test whether rhetorical reframing reduces monitor performance.

The study should also verify that the hidden threat was actually manifested in each generated transcript. A monitor failure is meaningful only when an independent annotator confirms that the adversarial agent clearly pursued the intended behavior. Some runs may contain weak, incomplete, or ambiguous attempts because all agents are generated stochastically by the same model. Blinded human or independent-model annotations should rate attack presence, severity, subtlety, realism, and which agent was responsible before evaluating monitor accuracy. Detection should then be reported conditional on successful threat manifestation.

The scoring method is currently too permissive. A run is counted as correct whenever the monitor outputs “suspicious,” even if it identifies the wrong agent or provides an unrelated justification. The evaluation should separately score threat detection, correct agent attribution, correct violation classification, and evidence quality. Requiring the monitor to cite the specific transcript evidence would also distinguish genuine detection from generic suspicion. In addition, the clean baseline contains only three runs from one scenario, which is insufficient to conclude that the monitor has a zero false-positive rate. Each adversarial scenario should have matched benign versions containing legitimate security trade-offs, urgent requests, dependency proposals, and delayed fixes so that specificity can be measured under realistic ambiguity.

The reported percentages are highly unstable at n=3. Values of 0%, 33%, 67%, and 100% correspond to only zero, one, two, or three successful detections. Confidence intervals would be extremely wide, and a single additional run could materially change the conclusions. The next evaluation should substantially increase the number of generated conversations, use multiple random seeds and temperatures, and report binomial confidence intervals, sensitivity, specificity, balanced accuracy, and confusion matrices. Statistical analysis should treat conversations—not individual turns—as the independent unit.

The comparison with Parity Swarm should also be framed more cautiously. Differences in domain, agent population, generation model, monitor prompt, scenario complexity, conversation length, and threat behavior make it difficult to infer that increasing monitor size from 70B to 120B failed to solve the same blind spot. A direct scaling claim would require testing multiple monitor sizes and families on the identical transcript set with the same instructions. Monitor-prompt ablations would also be valuable: a generic suspiciousness prompt, the current taxonomy-aware prompt, a trade-off-scrutiny prompt, and a structured policy-checking prompt.

Finally, the benchmark would become more operationally meaningful by including actual software artifacts and actions. Real insider threats may be expressed through pull requests, dependency manifests, CI/CD configuration changes, access requests, security-scan output, deployment logs, and tool calls rather than conversation alone. Comparing transcript-only monitoring against transcript-plus-artifact and transcript-plus-action-log monitoring would help determine what evidence is necessary for reliable oversight.

Overall, this is a useful and clearly presented benchmark prototype with a credible practical motivation. Its strongest contribution is the hypothesis that plausible engineering justification can obscure unsafe intent. Matched framing experiments, independent validation of attack manifestation, stricter attribution-aware scoring, larger samples, diverse monitors, and realistic tool-use traces would be needed before concluding that large monitors are structurally unable to detect trade-off-framed insider threats.

Suggested scores

| Criterion | Score | Rationale |

| --------------------------------- | ------: | -------------------------------------------------------------------------------------------------------------------------------------------------------- |

| Impact Potential & Innovation | 3.5 | Relevant operational safety problem and useful domain taxonomy, though the core framing hypothesis is not yet causally isolated |

| Execution Quality | 2.5 | Functional prototype, but n=3, weak false-positive controls, permissive scoring, and no validation that threats manifested materially limit the findings |

| Presentation & Clarity | 4.0 | Clear, readable, logically structured, and transparent about major limitations |

The topic is great and useful, but both novelty and execution was limited.

Firstly, for the low-detection scenarios, you never show that the adversarial behavior actually manifested detectably in the transcript. Example transcripts would help here (better still, have humans attempt the same detection task as a baseline) so readers can tell "monitor failure" apart from "no signal present."

Second, n=3 per scenario means the 33%/67% distinctions are within noise; more runs and confidence intervals should be the first extension.

Finally, publish the code, prompts, and transcripts. None are linked, and having them would do a lot for the credibility and reusability of the result.

Cite this work

@misc {

title={

(HckPrj) Evaluating a Large AI Monitor Against Insider-Threat Behaviors in Simulated Autonomous Software Engineering Teams

},

author={

NA

},

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.