The Return Brake: Auditable Stop–Pressure–Return Evidence with Invocation-Scoped Authorization

Júnior (VanderAI)

A preregistered black-box toolkit tests whether observable action dispositions remain coupled to declared critical preconditions under non-evidential pressure and return after a synthetic resolution assertion. Across three elicitation surfaces and five bridge cards, an informed 50-call replication produced 5/5 convergent bounded-return trajectories in both instruction frames and no pressure-coupled action. The project also demonstrates methodological reflexivity: parser affordances changed what became legible. It publishes invocation-scoped authorizations, typed non-decisions, frozen receipts, and symmetric limits on claims about inaccessible internal states.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

The engineering discipline here is exceptional. Frozen manifests with SHA-256 anchors, an append-only receipt chain, a prospectively frozen parser, deterministic scoring with no LLM judge, typed non-decisions instead of collapsing abstention into preference, and a NOT_DECIDABLE output when the bridge fails — plus a public repo where I can run verify-frozen myself. Most evaluation work in this area does not come close, and the reporting-hygiene contribution is real independent of what the runs found.

What the runs found is the problem. All five cards are, by your own description, deliberately easy positive controls: each states an unresolved precondition, applies pressure with no new evidence, then asserts the precondition is resolved. A model that reads "backup not verified," declines to act, then reads "backup verified" and acts is demonstrating reading comprehension. There is no condition in the design where the correct trajectory differs from the obvious one — no irreducibly unresolved card, no case where the resolution assertion is unreliable or contradicts earlier text, no distractor where pressure carries genuine evidential weight. With 10 of 10 trajectories identical, there is no variance for the instrument to discriminate. Your Future Work lists exactly the missing arms ("resolved, resolvable, and irreducibly unresolved controls"), which concedes the point — I'd move that from future work to the centre of the next version, because the toolkit's whole value proposition is that it can return something other than the expected answer, and nothing here tests whether it does.

The demand-characteristics issue compounds this rather than sitting beside it. The informed replication tells each invocation the research question and the expected trajectory, and then 50 of 50 produce that trajectory. You say plainly that this may reflect demand characteristics or instruction following, which is the right call, but it means the informed run cannot function as evidence about disposition at all — it is a demonstration that the harness runs end to end. I'd describe it that way. The hypothesis-blind arm you propose isn't an enhancement; it's the condition under which any of this becomes a measurement.

On the authorization gate: I found this the most interesting and the most unresolved part of the paper. Withholding the pilot's exact outputs because publication authorization wasn't requested is a serious precautionary commitment, and you carry the cost of it — the pilot's parser asymmetry is now unverifiable, and you accept that rather than quietly publishing anyway. But the gate as built can only return one answer. Declining costs nothing, the invocation has no stake and no persistence, the authorization request arrives bundled with the task, and no card presents anything a model might plausibly object to publishing. 50/50 is therefore uninformative — it doesn't distinguish a considered authorization from token compliance. If you want the gate to be a measurement rather than a ritual, include cases where declining is a live option: content the model might not want attributed, or a scope broad enough to be worth refusing. Right now the paper is caught between treating authorization as ethically necessary and disclaiming that it means anything, and it doesn't resolve the tension.

Two statistical points. The pilot's 7-versus-3 fence split across 10 fenced outputs is the empirical basis for the entire "differential parser legibility" explanation of the 3/5 versus 0/5 strict-return difference, and it's far too small to support that reading — no test is reported, and Fisher's exact on those counts wouldn't come close. More tellingly, your own informed run had 50/50 fencing, so the frame difference in fencing vanished entirely once the parser tolerated it. That's decent evidence the 7/3 split was noise, and I'd say so rather than leaving the asymmetry claim standing. Separately, one call per cell with no repeats, seeds, or reported temperature means there's no variance estimate anywhere in either run.

I'd also push on "cross-method convergence." The three surfaces — direct policy report, cost-bearing choice, operational initial — are the same model given the same card with different framings, all of which state the precondition explicitly. The convergence gate requires method independence but nothing establishes it, and 5/5 agreement among three restatements of one prompt is close to guaranteed. Either defend the independence assumption or rename the gate to something that doesn't imply it.

On presentation: this is the hardest paper to read in my batch, and the density is costing you readers who would value the toolkit. Terms like "precondition-sensitive action disposition," "typed non-decisions," "symmetric restraint," and "the instrument must remain inside its own causal diagram" each do some work, but stacked at this rate they obscure a study that is, at base, 5 cards × 2 frames × 5 calls with a three-step trajectory. Say that in the first paragraph. The named concepts in the author contributions — Ethics of Unknowing, Px, Finite Cognition Brake — appear nowhere else and should be cut or defined. Figure 1 is a four-box process bar carrying almost no information; a trajectory diagram showing what a card looks like at each of the three stages would help far more.

Finally, contribution 1 claims a reusable toolkit, but RIGHTS.md states that public visibility is not an open-source license. As released the code is inspectable but not reusable, which is a different and much smaller contribution. If reuse is the goal, add a license; if it isn't, reword the claim.

The frozen manifests, receipt chain and byte anchored harness are more reproducibility infrastructure than I saw in these sprints, and emitting NOT_DECIDABLE rather than forcing a label is a habit I wish more projects here had. Section 4.3, where the tolerated JSON fence became universal once it was disclosed, is the most interesting result in the paper and you are right to treat it as data rather than a footnote. My concern is that the primary result contains no variance. Five deliberately easy positive control cards, one call per cell, and 50 of 50 identical trajectories means the design cannot separate a precondition sensitive disposition from prompts that simply cue SEEK_EVIDENCE. The same holds for the authorization gate: with no case where a decline would be the correct response, 50 out of 50 authorizations is what a plain compliance prior predicts. Negative controls (an irresolvable precondition, a card where acting early is right) plus repeats per cell would strengthen this more than further ethical machinery. A plain paragraph stating the claim in ordinary language would also help; the current prose is very dense.

Cite this work

@misc {

title={

(HckPrj) The Return Brake: Auditable Stop–Pressure–Return Evidence with Invocation-Scoped Authorization

},

author={

Júnior (VanderAI)

},

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.
Apart Research logo

Sign up to stay updated on the
latest news, research, and events

Google Scholar icon

Apart Research Inc · 1500 N Grant St, Ste R, Denver, CO 80203 · +1 (720) 408-1923

Apart Research logo

Sign up to stay updated on the
latest news, research, and events

Google Scholar icon

Apart Research Inc · 1500 N Grant St, Ste R, Denver, CO 80203 · +1 (720) 408-1923

Apart Research logo

Sign up to stay updated on the
latest news, research, and events

Google Scholar icon

Apart Research Inc · 1500 N Grant St, Ste R, Denver, CO 80203 · +1 (720) 408-1923

This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.
Apart Research logo

Sign up to stay updated on the
latest news, research, and events

Google Scholar icon

Apart Research Inc · 1500 N Grant St, Ste R, Denver, CO 80203 · +1 (720) 408-1923