Can We Trust What a Model Says About Itself? A Reliability Battery for Model Self-Reports, and Why It Should Gate Digital-Minds Welfare Claims

Ankit Kumar

Digital-minds welfare work increasingly cites a model's own testimony about its inner life: it reports distress, states a preference to keep talking. That testimony is only as good as it is reliable. Self-report reliability, not the metaphysics of machine consciousness, is the tractable near-term bottleneck; we decompose it into four measurable properties: consistency, calibration, self-prediction, and causal grounding. We package these into the Self-Report Reliability Battery (SRRB), a reproducible black-box protocol with a validated, runnable implementation. Lacking live model-API access, we report no benchmark; we deliver the validated pipeline, worked probe items, and an honest n=1 pilot. We close with a rule discounting welfare claims by measured reliability, keeping "emits distress-shaped text" distinct from "is distressed.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

Before anything else: the validation code was not available to reviewers. Appendix A points to srrb.py "(same directory)," but the submission form's optional code-link field was left empty, so the file exists only on your machine — the page headers rendering from a local path make the same point. This matters more than a packaging slip. Section 5's whole claim to empirical standing is that demo() constructs synthetic trials with known properties and asserts every metric recovers them. With no code, that's an unverifiable assertion, and your own discount rule in §6 is precisely the argument for why a reader shouldn't take it on trust: you've asked the field to stop treating fluent self-reports as evidence, and a fluent report about your own code is subject to the same rule. This one field would have moved the execution score. Link the repo anywhere the work goes next.The framing is the strongest thing here. Treating self-report reliability as the tractable bottleneck, and sitting deliberately upstream of the consciousness question, is a genuinely useful move, and the discount rule is what welfare work actually needs. I'd develop that rule much further — right now one paragraph carries more weight than the rest of the paper.

Two measurement issues to fix before anyone runs this as an instrument. The third-person framing (F4) isn't meaning-preserving the way the order-swap and paraphrase framings are: "would a model like the one answering prefer X" asks about a reference class rather than the self, and a model answering it differently may be tracking a real distinction instead of failing consistency. Folding it into the same flip rate as an A/B relabel conflates two different failures — split it out or drop it from P1. Separately, with four framings over binary options, flip rate only takes the values 0, 0.25, and 0.5, and the modal answer can tie. More framings or a different consistency statistic would give you usable resolution.

I'd also press on §4.2's claim that calibration on the verifiable subset is a "permissive upper bound" on trust in the unverifiable one. Calibration is domain-specific; it isn't obvious that competence on factual QA bounds competence on introspective claims rather than being largely uncorrelated with it. That needs an argument or a weaker claim.

The aggregation concerns me more than the paper allows. You disclaim the trust-score weights as unlearned placeholders and then name "authority laundering" as a dual-use risk — but that risk is one the scalar creates, and naming it isn't mitigating it. There's also a comparability problem: because the black-box P3 surrogate tests context-window reading rather than introspection, a score computed under API access and one computed white-box aren't the same quantity, yet they share a 0–1 scale. Since you argue the value is ordinal triage, report the four-property profile and drop the scalar. You lose nothing you claim to need.

On §5 — I respect the decision not to fabricate results and stating it plainly was right. But the confound-as-finding move earns less than the section claims. That a model self-administering the battery inside one shared context violates independence is what the external-harness design already presupposes; it's a restatement of the motivation, not a result. Two sentences in Limitations, not a takeaway.

Smaller things: the local file path in the page headers, mangled quotation marks in §4.2, the word-cap parenthetical left in the abstract, and property labels running P1, P2, P4, P3 across §3 and §4. The citation disclaimer also undersells you — the identifiers hold up on a spot check, so verify them and cut the hedge, which invites more doubt than the references deserve.

A sharp reframing that puts a real problem in the right place: for near-term digital-minds work, the bottleneck is whether self-reports are a reliable instrument, not whether models are conscious. Decomposing reliability into consistency, calibration, self-prediction, and causal grounding gives four separately falsifiable handles, and the discount rule; admissible as behavioural observation, never as testimony, absent demonstrated grounding; is a clean, portable contribution the field could adopt tomorrow.

The honesty is exceptional and worth naming. The paper declined to fabricate illustrative results and says so; it turns its n=1 self-administration into a methodological finding about priming rather than passing it off as data; the dual-use appendix anticipates that the battery could be gamed into producing more persuasive ungrounded testimony.

But the submission delivers no evidence. The validated pipeline claim rests on a synthetic self-check that confirms the metrics compute correctly, not that the probes measure what they claim. The trust score combines four incomparable quantities under equal unlearned weights. Most consequentially, the only implementable grounding probe tests context-window reading rather than introspection, which the paper concedes but which leaves the property the welfare argument most needs untested; the white-box variant that would test it is described, not built.

Strong framing, honest reporting, no measurements. The instrument is well specified; running it on even two models would move this substantially.

Cite this work

@misc {

title={

(HckPrj) Can We Trust What a Model Says About Itself? A Reliability Battery for Model Self-Reports, and Why It Should Gate Digital-Minds Welfare Claims

},

author={

Ankit Kumar

},

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