DriftWatch

Tavish Agarwal, Varun Pathak, Pulkit Rustagi

Driftwatch is a simulation that explores a growing problem: as AI becomes cheaper and is used everywhere, it gets much harder for humans to keep an eye on it. Our project shows that when people use smaller, everyday AI models, the AI sometimes pauses or makes sudden, strange mistakes. When this happens, humans naturally start to trust the AI too much and lose their ability to catch errors. We built a simulation to prove that simply adding more AI without safety checks causes human oversight to fail quickly. To fix this, we tested solutions like random human reviews, warning systems, and mandatory audits to ensure humans stay alert and in control.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

Driftwatch explores an important AI safety question: how model quality, latency, and automation bias interact to produce human oversight failures. The idea of modeling oversight as a dynamic process rather than a static probability is compelling and potentially valuable for deployment planning, particularly in resource-constrained settings.

The project would be substantially strengthened by:

- Calibrating the simulation parameters using empirical studies on automation bias, review behavior, or human-in-the-loop decision making rather than manually specifying degradation rates.

- Performing comprehensive sensitivity analyses to demonstrate that the observed effects are robust across a wide range of parameter values instead of depending on a particular configuration.

The project identifies a genuine problem of dealing with AI sloppiness and laziness during human-in-the-loop interventions with cheaper and more and more quantized models being released. However, the solution suggested in the simulation and the assumptions about human sloppiness might not be correct in the first place.

There were several aspects of this that I thought worked well. There was a great conceptual foundation; a creative way to frame a simulation based on a very interesting and somewhat unexplored concept, namely the "compute diffusion paradox." This is where as you get closer to zero compute, the human oversight burden remains constant, while the other piece, linking particular model characteristics i.e., error types (steady vs. burst), latency to how humans gradually lose their ability to be effective when using automated tools is a nice take on automation bias and gradual loss of control.

Additionally, the repeated statements throughout the document that these are simulation based findings, as opposed to measured claims regarding real models, and the fact that the author has taken steps toward thinking about the potential misuse of these findings ("dual-use") shows an understanding of safety concerns.

Ways to make it better:

(1) As stated above, all of the key results appear to have been predetermined through the input assumptions. For instance, the degradation rates shown in Table 1 (e.g., 22% base error + 65% burst error for INT4, 5% base error + 0% burst error for GPT-4o) are input parameters you selected as part of designing your simulation. Therefore, there may be some degree of circular reasoning in concluding that quantization speeds up oversight collapse. One of the best possible follow-on steps would be to conduct calibration studies. Even a little bit of measurement data (INT4 vs. FP16 error and latency on a benchmark) will allow you to transition from modeling your own assumptions to providing evidence.

(2) Be careful claiming that anything has statistical significance. While you refer to the findings being "highly robust" and indicate that they show "significant effects" across different backends, you do not provide either test results, sample sizes (seed counts), or confidence intervals. Since running simulations is essentially cost-free, consider providing distributional information over many random seeds instead of simply citing single-point estimates like 32.44 vs. 9.26. Also, perform actual hypothesis testing.

(3) Establish a baseline for the early warning predictor. It seems safe to say that achieving 100% recall at an accuracy rate of approximately 58%, on just 12 trials, means that your predictor says "there's going to be a problem" virtually every time. That is roughly equivalent to saying nothing informative. Include a simple majority class baseline, and significantly increase the size of the hold-out group prior to calling it a useful predictor.

(4) Distinguish between inputs and outputs for the benefit of the reader. Input values that look like they might actually be measurements (such as 72.7% for the prompt injection rate for INT4, or the per condition error rates) exist side-by-side with disclaimers indicating that those are simulative values. Clearly state whether the values presented in each table represent parameters you explicitly specified versus ones that emerged during the simulation process.

Cite this work

@misc {

title={

(HckPrj) DriftWatch

},

author={

Tavish Agarwal, Varun Pathak, Pulkit Rustagi

},

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.