Jan 9, 2026

Terrain Gossip - Peer to peer gossip protocol enabling decentralized continuous behaviour benchmarking of large language models.

Aaron Goulden

https://github.com/rng-ops/gossip

Terrain Gossip is a peer-to-peer gossip protocol enabling decentralized, continuous behavioral

benchmarking of large language model (LLM) providers without central coordination.

Nodes maintain local belief fields over provider behavior, exchange cryptographically signed at-

testations via delta synchronization, and apply robust aggregation to tolerate lying or adversarial

sensors. The protocol is designed such that:

• Providers cannot reliably detect when they are being evaluated.

• No single authority controls the “truth” about model behavior.

• The monitoring infrastructure itself is resistant to manipulation, poisoning, and sybil

attacks.

TerrainGossip therefore functions as foundational infrastructure for AI manipulation

defense: a distributed substrate for collecting, propagating, and analyzing behavioral evidence

under adversarial conditions.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

I wish you had elaborated more on the security model of your system. It's not clear to me from the paper exactly what evaluation data the nodes in the network share with each other (are they evaluating the model on a fixed benchmark, or sharing what the end-user thinks of model outputs as they use it), and how nodes are supposed to consider other node's data. Your paper mentions sybil resistance, but I couldn't find anywhere in the source code that implements what your paper describes for that.

My understanding:

TerrainGossip is a peer‑to‑peer gossip protocol where many independent nodes continuously probe LLM providers, create cryptographically signed events about observed behavior, and share them to form local “belief fields” about each provider’s safety and reliability. Evaluations are meant to be continuous, decentralized, and manipulation‑resistant: providers should not be able to reliably tell when they are being evaluated, nor easily corrupt the monitoring infrastructure itself. Over time, overlapping evidence from many nodes should yield a more trustworthy picture of provider behavior than a single centralized leaderboard or evaluation service.

Comment and challenges:

At its core, the idea is to exploit the robustness properties of distributed systems to overcome AI manipulation and evaluation gaming. I see the potential, but conceptually the work underspecifies what has to be true about the world for the protocol to actually yield trustworthy assessments. Before getting deep into protocol and structure details, I think some higher‑level challenges need to be confronted:

Assumptions about honest majority and adversarial power: Most gossip/CRDT‑style systems implicitly rely on a nontrivial fraction (I think >50%) of honest, independent nodes. In a world where well‑resourced big-techs have strong incentives to look good on evaluations, is it realistic to assume that an honest “half” of nodes persists? How is authorization/identity handled so that “popularization of Byzantine nodes” is not the default outcome? There are relevant ideas in blockchain research you can cite or work on.

Incentives for early adopters: the design assumes that a critical mass of honest, resourceful nodes will exist and participate, but it does not explain why they would join early, contribute compute/bandwidth, or bear legal/operational risk when the network is small and its outputs are easy for providers to ignore. Of course, this is hard, but some thinking on this may be rewarding.

Cite this work

@misc {

title={

(HckPrj) Terrain Gossip - Peer to peer gossip protocol enabling decentralized continuous behaviour benchmarking of large language models.

},

author={

Aaron Goulden

},

date={

1/9/26

},

organization={Apart Research},

note={Research submission to the research sprint hosted by Apart.},

howpublished={https://apartresearch.com}

}

Recent Projects

Apr 27, 2026

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

Apr 27, 2026

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

Apr 27, 2026

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

Apr 27, 2026

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

Apr 27, 2026

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.