Verifiable Proof Systems helps partners identify potential risks before engaging in a pilot by separating computation, authority, and consequence at a single admission boundary. This guide explains how the framework distinguishes between a proposed action and an actual effect. It covers the specific tools and evidence requirements needed to validate system boundaries before any consequential change occurs.
Boundary Definition Tools
Defining system boundaries is the first step in identifying risk. Verifiable Proof Systems provides custom tools for defining these boundaries. These tools are written in DARKc, a formally verified fail-closed compiler and syntax. The primary tool, AgenticX-DYE(TM), surfaces points where boundaries are weak, drifted, or non-existent. This allows teams to see exactly where a system might fail before a pilot begins.
Defining the Boundary
A system boundary is the limit of a system's authority to act. It defines what the system can and cannot do. By using AgenticX-DYE(TM), partners can map these limits explicitly. This prevents the common error of assuming a system's capabilities based on its output.
Fail-Closed Design
The tools operate on a fail-closed principle. If a boundary check fails, the system refuses the action. This ensures that uncertainty does not lead to execution. The compiler enforces these rules at the syntax level, making the boundary definition part of the code itself.
The Admission Boundary
The core of the Verifiable Proof Systems approach is the admission boundary. This is the point where a proposed action either becomes a consequence or is refused. The framework separates three distinct planes: Proposal, Admission, and Execution. This separation ensures that intelligence can propose actions, but authority must be independently established.

Plane A: Proposal
Plane A is untrusted. Models, planners, tools, and people propose actions here. This plane holds no authority over production state or a plant. A proposal is simply a candidate action. It carries no permission and no effect.
Plane B: Admission
Plane B is the admission boundary. It performs a small, deterministic check of the attempt and its predicted effect. This check happens under a fixed policy. It is the only place where a proposal can gain authority.
Plane C: Execution
Plane C is minimal. It carries out only what Plane B authorized. It records the outcome. This ensures that the execution is strictly bounded by the admission decision.
Evidence Requirements
Admission at the boundary requires five specific conditions to hold together. These conditions ensure that the authority granted is bounded and verifiable. Without all five, the action is refused. This strict requirement helps partners identify gaps in their current systems.
Independent Evidence
The first condition is independent evidence. This evidence must not be produced by the proposer. It provides an external check on the proposed action. This prevents the proposer from validating its own work.
Bounded Authority
The second condition is bounded, single-use authority. This authority is scoped to the predicted effect. It cannot be reused for other actions. This limits the blast radius of any potential error.
Verified Identity and Sponsor
The third condition is a verified workload identity and a separate human sponsor. The identity ensures the workload is known. The sponsor provides human accountability. This separates the machine's action from human responsibility.
Pilot Structure and Baselines
Verifiable Proof Systems offers a four-week, fixed-fee pilot for design partners. This pilot runs on one of the partner's systems. It closes with a letter of intent if the criteria agreed in week one are met. This structure allows partners to test the framework in a controlled environment.
Week One Baseline
ROI Measurement
ROI is measured with each partner against the baseline agreed in week one. This ensures that the value of the pilot is tied to specific, pre-agreed outcomes. It avoids vague claims of improvement. The pilot focuses on identifying risks, not on guaranteeing outcomes.
Comparison of Assurance Mechanisms
The following table compares common assurance mechanisms with the Verifiable Proof Systems approach. It highlights why traditional methods are often insufficient for agentic systems.
| Mechanism | What It Provides | Limitation for Agentic Systems |
|---|---|---|
| Model Confidence | A score indicating the model's certainty. | Confidence is not permission. It does not verify the effect. |
| Passing Unit Tests | Verification of specific code paths. | Tests are static. They do not verify runtime state or sequence continuity. |
| Signed Artifacts | Proof of origin for a file or message. | Signature does not verify the action's effect or authority. |
| Lagging Telemetry | Post-hoc data on system behavior. | Too late to prevent an action. It records, it does not admit. |
| Verifiable Proof Systems | Admission based on five independent conditions. | Requires independent evidence and bounded authority at the boundary. |
Key Takeaways
- Verifiable Proof Systems separates computation, authority, and consequence at one admission boundary.
- AgenticX-DYE(TM) surfaces weak, drifted, or non-existent boundaries in a system.
- Admission requires five conditions: independent evidence, bounded authority, verified identity, state continuity, and declared constraints.
- The pilot is a four-week, fixed-fee assessment that closes with a letter of intent if criteria are met.
- ROI is measured against a baseline agreed in week one, ensuring specific, pre-agreed outcomes.
- Traditional mechanisms like model confidence and passing tests are testimony about a proposal, not permission for an effect.
- The framework is a published conceptual framework (DOI 10.5281/zenodo.23092344) with formal models in development.
Frequently Asked Questions
What is the admission boundary?
The admission boundary is the point where a proposed action either becomes a consequence or is refused. It is the only place where a proposal can gain authority.
How does AgenticX-DYE(TM) work?
AgenticX-DYE(TM) is a tool written in DARKc. It surfaces points where system boundaries are weak, drifted, or non-existent. It helps teams see where a system might fail before a pilot begins.
What are the five conditions for admission?
The five conditions are: independent evidence, bounded single-use authority, verified workload identity and human sponsor, state and sequence continuity, and declared constraints satisfied.
How long is the pilot?
The pilot is four weeks long. It is a fixed-fee assessment on one of the partner's systems. It closes with a letter of intent if the criteria agreed in week one are met.
Is Verifiable Proof Systems a certified product?
No. Verifiable Proof Systems is a research initiative. It is not a certifier or an accredited auditor. It produces evidence for specific requirements but does not issue certifications.
What is the difference between a proposal and an effect?
A proposal is a candidate action generated by a model or planner. It carries no permission and no effect. An effect is a change to authoritative state or a physical actuator. Only the admission boundary can turn a proposal into an effect.
How is ROI measured in the pilot?
ROI is measured with each partner against a baseline agreed in week one. This ensures that the value of the pilot is tied to specific, pre-agreed outcomes.
What is DARKc?
DARKc is a formally verified fail-closed compiler and syntax. It is used to write the custom tools for defining system boundaries. It enforces fail-closed rules at the syntax level.
Conclusion
Identifying risks before a pilot requires a clear separation between proposal and effect. Verifiable Proof Systems provides the tools and framework to make this separation explicit. By using AgenticX-DYE(TM) and the admission boundary, partners can see where their systems are weak. To discuss a design-partner pilot, .
