red-verify

red-verify is a command for coding agents from nicelight/DevRails-26. It costs 15 tokens per session (2,219 once invoked), scanned A, original, MIT.

An adversarial check of whether a completed coding task or feature matches its intended meaning. It uses task requirements, mapped acceptance criteria, functional evidence, and the actual code changes to produce one semantic verdict.

In plain words
What is it for?
Use it to verify a T3 task or a T2 feature after functional verification, using the required task or feature identifier.
Why use it?
A feature can pass tests while still implementing the wrong behavior or missing an important requirement. This check looks for those meaning-level problems and separates them from ordinary functional verification.

Command

Install

Getting it into your agent

One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.

agentmods
npx agentmods add commands/nicelight/devrails-26/red-verify
Clone the repo
git clone --depth 1 https://github.com/nicelight/DevRails-26

Wrote this? Show the measurements

A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.

agentmods badge for red-verify

README.md
[![agentmods](https://agentmods.dev/badge/commands/nicelight/devrails-26/red-verify.svg)](https://agentmods.dev/commands/nicelight/devrails-26/red-verify)
Your own site
<a href="https://agentmods.dev/commands/nicelight/devrails-26/red-verify"><img src="https://agentmods.dev/badge/commands/nicelight/devrails-26/red-verify.svg" alt="Measured on agentmods" height="20"></a>
Per session 15 Only the description is in the session, so the agent can decide to use it. The body loads when it is invoked.
When invoked 2,219 The whole file, excluding the scripts and references it only reads on demand.
Security scan A 0 findings. Scan, not verified.
Origin original No closer match found in the catalogue.
Token cost

What it costs to keep this loaded

Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.

ModelPer sessionOnce invoked
Fable 5 $0.00015 $0.02219
Opus 5 $0.00008 $0.01110
Sonnet 5 $0.00003 $0.00444
Haiku 4.5 $0.00002 $0.00222

Measured 4d ago against content hash dc5924e5cb32, method: parsed. Prices are Anthropic first-party input rates as of 2026-08-30, from the pricing page.

Security

Grade A, and why

red-verify scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 4d ago.

A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.

Nothing flagged

None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.

skills/_shared/references/commands/red-verify.md · 214 lines

How it starts

The opening of the file, as written. The whole thing — 214 lines — stays where its author put it; the contents beside it link to each section on GitHub.

/red-verify - Adversarial semantic verification

/verify owns functional evidence. /red-verify owns semantic evidence and one exact SEMANTIC_VERDICT: semantic-pass|semantic-concern|semantic-fail. Zero reportable findings is a normal result of sufficient adversarial coverage.

<input_contract> Expected $ARGUMENTS:

  • TASK-NNN-TN-FT-NNN-WN: per-task semantic verification;
  • --feature FT-<ID>: T2 feature-completion semantic verification.

Reject --feature FT-000. Foundation closes through normal FT-000 tasks and the final gate.

Load .memory-bank/workflows/tier-policy.md#tier-obligations and #closure-authority for permitted modes, required gates, and lifecycle ownership. Apparent scope growth also loads #tier-classification-and-escalation and routes through tier rebuild before semantic verification.

Require indexed task/feature identity, tier policy, task/feature intent and mapped REQ/AC, successful functional verification evidence, actual diff/change surface, tests/runtime artifacts, tier-selected protocol, direct task-linked canonical SDD specs for T2/T3, and only the additional provenance-linked context needed to assess system impact.

For per-task T2/T3, feature links and spec-index.md alone do not replace direct task links. Missing direct applicable coverage is a blocker, not a basis for semantic-pass. </input_contract>

<hard_invariants>

  • Before the semantic verdict, load and apply this installed skill's references/finding-adjudication.md semantic pack.
  • Use an independent verifier context; do not trust task prose, writer claims, or VERDICT: PASS as proof of semantic correctness.
  • Route only by task tier and the loaded tier-policy sections; never use legacy risk.
  • Scheduler mode: /red-verify never closes/fails/blocks/reopens tasks, promotes dependents, or writes scheduler status. It returns verdict/evidence and a recommended owner action.
  • Manual lifecycle or BUG/follow-up mutation is allowed only under explicit standalone ownership and canonical tier policy.
  • T3 semantic-pass does not replace functional PASS.
  • T2 feature semantic-pass must be recorded in the matching feature document; per-task evidence is not a substitute.
  • Do not invent a separate failure artifact, status, task schema, or lifecycle. </hard_invariants>

<operator_decisions> If the semantic verdict depends on an ambiguous product/spec interpretation, canonical identity, acceptance meaning, architecture/contract/state/data/ storage/security/compatibility decision, task boundary, tier, dependency, or verification policy, the verifier does not pick a favorable reading.

  • Return semantic-concern when an unresolved operator-owned decision is necessary to judge the accepted outcome or a proved realistic material risk.
  • Return semantic-fail only when evidence proves a material break of an unambiguous accepted outcome.
  • State the exact operator question, competing interpretations, affected closure/dependents, and repair owner.
  • Do not manufacture an operator question from a speculative, unreachable, or immaterial candidate.
  • Interactive flow asks the operator; recommendation/default/silence is not an accepted decision. The answer must be durably applied by /feature-doctor, /feature-to-tasks, or /spec-redesign, then functional and semantic gates rerun as applicable.
  • Unattended flow returns the blocker to the scheduler for HALT_CLARIFICATION_REQUIRED or HALT_BLOCKING_QUESTIONS and names the exact resume route. </operator_decisions>

<finding_admission> Generate and assess hostile hypotheses privately. Do not write hypotheses, admission notes, rejected candidates, scorecards, or a target finding count to protocols, reports, task records, specs, or tests.

Read the full file on GitHub · 214 lines

Changes

What this file has done since we first saw it

Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.

  1. 4d ago First seen · 214 lines · 15 tokens per session scan A dc5924e5cb32

Subscribe to this mod's changes

red-verify is a command published in the GitHub repository nicelight/DevRails-26 (22 stars, last pushed 2d ago), licensed MIT. It adds 15 tokens to every session and 2,219 once invoked, about $0.0001 per session on Opus 5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-30.