Agents say done. VALP asks for proof.
Start with one machine, two agents, and one small task. One agent executes, another checks, and VALP records the evidence needed to decide whether the work is actually complete. For an OPC (one-person company), it is a way to turn research, building, testing, and review into a team you can supervise. For teams, enterprises, and runtime developers, it is a common evidence and audit path across agents, tools, and orchestrators.
Oh! My Agent Teams is the human-facing entry point. VALP — Visible Agent
Loop Protocol is the trust layer underneath: execution success is not the
same thing as delivery completion.
This repository is the normative home of the open VALP protocol and its reference CLI. For a field-oriented starting point, read the FDE field delivery walkthrough, which separates configuration/source evidence from runtime and production proof.
See the minimal audit demo for the text-based PASS / FAIL / PASS example.
Start here:
The core idea is narrow: a runtime saying completed is not enough. VALP
completion requires automation policy, dispatch receipts, expected evidence,
verification/review, approval gates when needed, final synthesis, and
task-local learning feedback that points to proof.
The complete authority and evidence path is: Doctor observes current
capabilities; the user selects the Installation Leader; the Leader declares
WorkItems and role-to-Agent assignments; VALP validates, binds Worker sessions,
and dispatches through an adapter; adapter-backed receipts record submission
and completion while Workers return expected evidence; verification, independent
review, recommendation resolution, approval, synthesis, feedback, and
valp audit close the task. The optional Task Graph then projects that one
task without changing it. See the visual flow.


The diagram is an ontology-guided explanatory map, not runtime or release
proof. Ontology is advisory for routing and context projection; the task-local
evidence ledger, independent review, and valp audit remain authoritative.
Task Graph is a downstream read-only projection. Neo4j is not part of the
v0.3.0 release. A future version may use it as an optional ontology projection,
but never as protocol truth, completion proof, or audit authority.
See the authority map, completion gates, and the responsive explainer.
VALP v0.3.0 is the published protocol release and 0.3.0 reference CLI.
The release completed external review, same-commit CI, merge, immutable tag,
release, and post-release smoke. Release history and migration notes live in
versioning and compatibility. It is not a
hosted production platform.
The public RFC 0002 package comprises SPEC.md, this documentation index, the
project status page, and RFC 0002. It separates the Protocol 0.3 target into
five explicit layers: the Human Intent And
Authority Boundary, Reference System, pure Protocol Kernel, Adapter Boundary,
and External Runtime And Ecosystem. The
specification
defines the normative ownership and proof boundaries; RFC 0002
records public D01-D19 traceability and the staged implementation boundary.
Pure Protocol Kernel slices implement the closed Layer 02 Task transition
graph across its 13 truth statuses, with typed Events, terminal-state closure,
canonical identities, closed enums, State and accepted / no_op /
rejected Result contract, deterministic duplicate behavior, and ordered
ReplayEntry(Event, EvidenceSet, accepted Result) reducer re-execution with
complete canonical Result equality from a validated Genesis Root. It also
defines a structural Checkpoint Root contract that binds State, prefix, tail,
checkpoint-Result, and trust-policy identities. MVP-H authenticates that root
against an independently supplied trust policy and exact EvidenceSet, then
recomputes an ordered suffix through the same reducer while emitting zero
obligations. The machine contract and negative tests reject bare State roots,
impossible revision/history combinations, malformed or mismatched checkpoint
authentication, identity drift, suffix gaps/reordering/duplicates, and tampered
Results. A task-scoped Reference System KernelStore now adds canonical journal
and authenticated checkpoint persistence with strict restart recovery. The repository also
implements a pure v3 receipt-write reducer and digest-bound legacy/v2 migration
projection fixtures. A file-backed Reference System store performs cooperative
inter-process locking, canonical-prefix replay, CAS, atomic replacement, and
file plus directory synchronization. Its current evidence covers process-crash
recovery on the tested macOS/APFS host; it does not establish sudden-power-loss,
hostile-writer, or Windows parity. LangGraph, atomic HERDR, the file Queue, and
Manual Mode now have explicit task-local ABI 1.0 and canonical v3 adoption.
Queue terminal observation requires a real worker/run record, and Manual
revocation/adjudication is append-only and fail-closed. Adopted runtime waits
are bound to the durable Kernel graph across multiple dependency frontiers.
The Kernel control machine also implements authority-bound cancellation,
Interrupt/resume, and versioned Redirect. Cancellation of submitted or running
work creates deterministic Adapter obligations, while a task-local,
digest-chained effect ledger records pending, fulfilled, or blocked outcomes
against real proof without replaying effects.
This remains a bounded Kernel and Reference System implementation, not proof of
every external runtime, platform, or production deployment. No universal runtime
or platform parity is claimed. The protocol target is 0.3.0 and the
current reference CLI is 0.3.0. See the promotion-readiness matrix
for the exact boundary between local implementation evidence and live or
cross-platform gates.
The protocol target is 0.3.0 and the current reference CLI is 0.3.0. The
v0.3 installation control plane RFC
is incorporated into the reference CLI, schemas, and conformance runner.
Protocol and reference-CLI release gates are closed; release status does not
broaden adapter, platform, or production-support claims.
The 0.3.0 implementation extends VALP’s evidence discipline from individual tasks to the
installation control plane: the user selects an Installation Leader;
capability truth remains separated into declared, present, callable, and
task-verified layers; messages, state, claims, failures, and review gain strict
machine contracts; and provider plugins stay outside the deterministic core.
The first real non-HERDR end-to-end proof exists for the local LangGraph API development runtime. That proof remains scoped to the tested adapter/runtime pair. See the project status matrix for what is verified today and the RFC for the accepted protocol contract.
First useful actions:
bin/valp audit examples/minimal-task to inspect the evidence shape.bin/valp graph examples/full-mode-task --format all to render the
evidence-linked user-facing Task Graph. It is a projection for inspection;
valp audit remains the completion gate.Active discussions:
Good first tasks: