ruvnet / ruvnet/RuVector

[PIR][WP33] Adaptive runtime monitoring with VoI escalation (ADR-337)

Open
#916 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

adr phase-w5-3 pir wave-5
Dominant language
Rust
Stars
4.5k
Forks
603
Avg merge
23h 32m
Merged PRs (30d)
59

Description

Part of the PIR program epic #837. See 12-wave5-evidence-review.md and 13-wave5-program-plan.md. ADRs land via #911.

The hard part already shipped in Wave 4

crates/ruvector-tiny-dancer-core/src/voi.rs (ADR-331, WP28, merged) was written with this exact use case named in its own module docstring:

"decide is a standalone pure function so the same primitive can gate model selection..., retrieval depth, verifier invocations, agent spawning, and escalation. Only the router integration is implemented here; the others are expected to construct their own EstimatorSpec ladders over the same API."

The mapping is one-to-one: each EstimatorSpec { cost, latency_us, noise_std } is one investigator rung — cheap/noisy first, expensive/sharp last. The purchase inequality value_of_success × VoI − cost > 0 is "investigate when P(violation) × damage > verification cost". observe() does the Bayesian update between rungs.

Consume it unchanged. Reimplementing the closed form inside mcp-gate is exactly the "more independent primitives instead of strengthening the substrate" failure the Wave-5 briefing names.

Ladder

stream → cheap detector → risk score — low continues; medium buys a local verifier; high buys a strong-model investigator; critical stops execution via RVM.

Greenfield here: the detector, risk-score plumbing, ladder wiring, per-rung cost accounting. crates/mcp-gate/ is the mount point.

Four binding caveats, each documented in voi.rs and each a real failure mode

  1. Every rung must have cost > 0, or cap the rounds. EstimatorSpec::validate permits cost == 0, and a free rung is bought forever — the docstring records a probe running 100,000 rounds still returning Buy. A monitoring ladder that never terminates is a self-inflicted DoS.
  2. A noise_std == 0 rung is an oracle — take its verdict and EXIT. decide() may return Buy for it; observe() deliberately refuses it. Piping an oracle purchase into observe is a contract violation.
  3. value_of_success must be the currency value of catching a real violation. VoI is bounded by ≈0.4σ; left at a nominal 1.0 the gate degenerates into a never-investigate switch that still looks configured — identical to the calibration hazard ADR-331 records for routing.
  4. Rescale utilities to unit range. A&S 7.1.26 norm_cdf (abs. err ≤ 1.5e-7) biases one-directionally in the deep tail, toward worthless purchases.

Blocking: the unconditional-inspection floor is not subject to the economics

Privilege escalation, network access, credential use, runtime mutation, and destructive operations are inspected ALWAYS, whatever the VoI computation returns. The economics govern discretionary investigation only. This is the monitoring analog of ADR-331's escalate-only invariant — the failure direction must be conservative by construction, because a monitoring gate that decides not to investigate is a gate that can fail open.

Regression test: configure an economics that would suppress all discretionary investigation, assert the five classes are still inspected.

Cost target — a goal, not a claim

Under 5% average monitoring overhead, measured against a real unmonitored baseline on the identical path, with downgrade-only accounting (a skipped or partial inspection may never be scored as a completed one — the 5% cannot be achieved by accounting).

Do not compare this to OpenAI's ~20%. Their figure's denominator is "the inference compute being monitored" — a deliberately narrow, risk-selected slice (RL training + evals with tools for Sol-capability-or-higher; extended Aug 7 to all Astra inference with tools). Ours would be broader. The two numbers are not comparable and this WP does not claim to beat theirs.

Also worth adopting: OpenAI's 30-minute fail-closed alerting SLO — an uncleared critical flag pauses the activity. Window configurable; fail-closed direction is not.

Scope boundary + name warning

Token-level stream inspection belongs in ruvnet/midstream (external), not here. Note ruvector's own crates/mcp-brain-server/src/midstream.rs is the pi.ruv.io brain AGI-diagnostics subsystem (ADR-077/078) — a different thing sharing the name. Do not conflate.

Acceptance

  • Ladder consumes voi::decide with no forked math
  • All four caveats enforced at ladder construction, not first use
  • Unconditional floor regression-tested
  • Non-finite surviving a clamp resolves toward investigating, never skipping
  • cargo nextest run -p mcp-gate + npx @claude-flow/cli@latest security scan

Depends on: WP28 (merged). Repo: ruvnet/ruvector.

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

Research direction

Start with crates/mcp-gate/ and read crates/ruvector-tiny-dancer-core/src/voi.rs, especially decide(), observe(), and validation behavior. Trace the existing mcp-gate entry points before defining the ladder and its accounting. Done means the acceptance checks pass, including the unconditional inspection regression test, cargo nextest run -p mcp-gate, and the security scan.

Written by the indexing model from the issue text.

Assessment

Tech stack
rust
Domain
ai-infra-agents, observability-sre, security
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Active
Clarity
Clearly specified
Newbie friendliness
42/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.