Prime Intellect lança o Verifiers v1: conjuntos de tarefas, arcabouços e ambientes de execução componíveis para treinamento e avaliação de RL agêntico

Illustrative demo of the verifiers v1 architecture · Built by Marktechpost

(function(){

var root=document.getElementById("vfv1-demo");

var packet=document.getElementById("vf-packet");

var status=document.getElementById("vf-status");

var graph=document.getElementById("vf-graph");

var runBtn=document.getElementById("vf-run");

var resetBtn=document.getElementById("vf-reset");

var dialectSel=document.getElementById("vf-dialect");

var nHarness=document.getElementById("n-harness");

var nIntercept=document.getElementById("n-intercept");

var nInfer=document.getElementById("n-infer");

var flow=document.getElementById("vf-flow");

var turn=0, running=false;

var msgs=[]; // recorded nodes

var dialectLabel={Chat:"Chat",Resp:"Resp",Msg:"Msg"};

function pos(el){ // center x relative to flow

var f=flow.getBoundingClientRect();

var r=el.getBoundingClientRect();

return (r.left - f.left) + r.width/2 - 32;

function clearActive(){ [nHarness,nIntercept,nInfer].forEach(function(n){n.classList.remove("vf-active");}); }

function movePacket(fromEl,toEl,ms,label,isResp){

return new Promise(function(res){

packet.textContent=label;

packet.classList.toggle("vf-resp",!!isResp);

packet.style.transition="none";

packet.style.left=pos(fromEl)+"px";

packet.style.opacity="1";

void packet.offsetWidth;

packet.style.transition="left "+ms+"ms cubic-bezier(.45,.05,.35,1)";

packet.style.left=pos(toEl)+"px";

setTimeout(res,ms);

function addNode(role,label,color){

if(msgs.length===0){ graph.innerHTML=""; }

var d=document.createElement("div");

d.className="vf-msg";

d.innerHTML=''+label+''+role+'';

graph.appendChild(d);

graph.scrollTop=graph.scrollHeight;

msgs.push(label);

function sleep(ms){return new Promise(function(r){setTimeout(r,ms);});}

async function runTurn(){

if(running) return;

running=true; runBtn.disabled=true;

var dl=dialectLabel[dialectSel.value];

// seed system + user on first turn

if(turn===1){

addNode("system","S1","#6366f1"); await sleep(160);

addNode("user","U1","#6366f1");

clearActive();

nHarness.classList.add("vf-active");

status.textContent="Harness builds a "+dl+" request…";

await sleep(350);

// harness -> interception

nIntercept.classList.add("vf-active");

status.textContent="Interception server proxies the request → inference.";

await movePacket(nHarness,nInfer,850,dl+" req");

clearActive(); nInfer.classList.add("vf-active");

status.textContent="Inference server generates the reply (vLLM).";

await sleep(350);

// inference -> interception (records) -> harness

nIntercept.classList.add("vf-active");

status.textContent="Interception server records the trace, relays the response.";

await movePacket(nInfer,nHarness,850,"resp",true);

packet.style.opacity="0";

clearActive();

// record assistant node (+ occasional tool)

addNode("assistant","A"+turn,"#0b8f8f"); await sleep(150);

if(turn%2===0){ addNode("tool","T"+turn,"#e0a800"); }

status.textContent="Turn "+turn+" recorded as a unique node in the message graph.";

running=false; runBtn.disabled=false;

function reset(){

turn=0; msgs=[]; running=false; runBtn.disabled=false;

clearActive(); packet.style.opacity="0";

graph.innerHTML='

status.textContent="Press “Run rollout” to send a request through the interception server.";

runBtn.addEventListener("click",runTurn);

resetBtn.addEventListener("click",reset);

// ---- v0 vs v1 growth chart ----

var v0=document.getElementById("vf-v0");

var v1=document.getElementById("vf-v1");

var turnsR=document.getElementById("vf-turns");

var turnsV=document.getElementById("vf-turns-val");

function drawChart(N){

var x0=30,x1=255,y0=130,y1=12,W=x1-x0,H=y0-y1;

var maxV0=N*N; // quadratic reference

function ptV0(i){var x=x0+(i/N)*W;var y=y0-((i*i)/maxV0)*H;return x+","+y;}

function ptV1(i){var x=x0+(i/N)*W;var y=y0-((i/N)*H);return x+","+y;} // linear

var p0="M",p1="M";

for(var i=0;i<=N;i++){ p0+=(i?" L":"")+ptV0(i); p1+=(i?" L":"")+ptV1(i); }

v0.setAttribute("d",p0); v1.setAttribute("d",p1);

turnsR.addEventListener("input",function(){ turnsV.textContent=turnsR.value; drawChart(+turnsR.value); });

drawChart(+turnsR.value);

// ---- auto-resize for WordPress iframe embedding ----

function sendHeight(){

var h=document.getElementById("vfv1-demo").offsetHeight+40;

if(window.parent){ window.parent.postMessage({vfv1Height:h},"*"); }

window.addEventListener("load",sendHeight);

window.addEventListener("resize",sendHeight);

new MutationObserver(sendHeight).observe(document.getElementById("vf-graph"),{childList:true});

setInterval(sendHeight,1200);

(function(){

window.addEventListener("message",function(e){

if(e.data && e.data.vfv1Height){

var f=document.getElementById("vfv1-frame");

if(f){ f.style.height=e.data.vfv1Height+"px"; }

v0 vs v1: A Quick Comparison

These changes separate v1 from v0.

Aspectverifiers v0verifiers v1Environment modelData, logic, and infra bundled togetherSplit into taskset, harness, runtimeTrace growthQuadratic in turns (repeated pairs)Linear in turns (unique nodes)Non-linear rolloutsAssumed linearNative compaction and subagents via branchesRuntime handlingBuilder manages lifecycleFramework-managed run / read / writeHarness couplingTightly coupled to the environmentAny compatible harness (Codex, Terminus 2)Training dataRecomputed for prime-rlConsumed directly from the trace

Use Cases with Examples

With the architecture clear, consider how teams use it. For example, you can run Nemotron 3 Ultra on Terminal-Bench 2 under Codex.

Similarly, teams can reuse Harbor datasets without rewriting reward logic. Prime Intellect ported Terminal Bench 2 into v1 with only a small class. In its internal testing, verifiers matched Harbor’s performance on the same tasks. Harbor is the first fully-supported third-party format; NeMo Gym and OpenEnv have alpha support.

On the training side, the same environments plug into prime-rl directly. In a length-penalty ablation, GLM-4.5-Air trained on ScaleSWE across six H200 nodes. That run took two days and evaluated on SWE-Bench-Verified, showing stable agentic training.

A Minimal Taskset and Launch

Each run starts from a taskset that defines data and scoring, independent of any harness:

Copy CodeCopiedUse a different Browser

import verifiers.v1 as vf

class AdditionData(vf.TaskData):

answer: int

class AdditionTask(vf.Task[AdditionData]):

async def exact_match(self, trace: vf.Trace) -> float:

return float(trace.last_reply == str(self.data.answer))

class AdditionTaskset(vf.Taskset[AdditionTask, vf.TasksetConfig]):

def load(self) -> list[AdditionTask]:

AdditionTask(

AdditionData(idx=i, prompt=f"What is {i} + {i}?", answer=2 * i),

self.config.task,

for i in range(100)

__all__ = ["AdditionTaskset"]

Any taskset then runs under a chosen harness via TOML and the CLI:

Copy CodeCopiedUse a different Browser

model = "nvidia/NVIDIA-Nemotron-3-Ultra-550B-A55B"

id = "primeintellect/terminal-bench-2"

id = "codex"

version = "0.116.0"

Copy CodeCopiedUse a different Browser

uv run eval @ path/to/config.toml

Key Takeaways

• verifiers v1 splits an environment into a taskset (what), a harness (how), and a runtime (where).

• A verifiers-managed interception server proxies harness–inference requests and records traces on the fly.

• A linear message-graph trace replaces v0’s quadratic prompt-completion pairs, enabling long-horizon training.

• It ships with full prime-rl training support; the legacy code path is now frozen.

• Harbor datasets and harnesses like Codex and Terminus 2 work out of the box.

Check out the Technical details. Also, feel free to follow us on Twitter and don’t forget to join our 150k+ML SubReddit and Subscribe to our Newsletter. Wait! are you on telegram? now you can join us on telegram as well.

Need to partner with us for promoting your GitHub Repo OR Hugging Face Page OR Product Release OR Webinar etc.? Connect with us

The post Prime Intellect Releases Verifiers v1: Composable Tasksets, Harnesses, and Runtimes for Agentic RL Training and Evaluations appeared first on MarkTechPost.