Matoi tests whether an agent runtime can reduce repeat verification work without caching yesterday's authority as if it were today's. Its reusable object is a previously checked fact tied to its validity dependencies, not an unconditional authorization or signed instruction to execute a transaction. Current recipient allowlists, permissions, revocation,…
Inspect the ClaimsCase · DiggingBeagle record
Matoi separated reusable agent proof evidence from live permission to act
A prototype reused verified predicates under dependency constraints but rechecked current policy and revocation before external actions; measured gains were small in matched full-lifecycle tests.
Published controlled research and its described configurations; no inference of unrelated production deployments.
Assessment profile
Assessment method- Setting
- research demonstration
- Exploitation
- not established
- Evidence
- Grade B
- Remediation
- not applicable
- AI role
- WITH AI
Basis and provenance
Primary system prototype includes matched cost controls and a synthetic banking scenario. The study does not demonstrate a specific real-world prevented transfer or a universal throughput benefit.
Assessed Oct 17, 2026 using diggingbeagle.assessment/1.
Evidence basis: CLM-2026-MATOI-RECHECK-AUTHORITY-1 · CLM-2026-MATOI-RECHECK-AUTHORITY-2 · CLM-2026-MATOI-COMPARISON-QUALIFICATION · Matoi: reusable checked evidence with live authorization rechecks
At a glance
Proof caching helps only when the invariant is truly stable and the runtime still enforces fresh authorization at the external-effect boundary. Before adopting another verification layer, compare it to simpler attribute-based access control using the same workload and failure tests.
Read the implicationsThe banking environment was scripted and does not establish completed, real financial transfers. Revocation races and uncertain external commits remain separate problems. Benefits vary by workload; several measured families crossed the no-gain boundary.
Limits and uncertaintyFull account
Matoi tests whether an agent runtime can reduce repeat verification work without caching yesterday's authority as if it were today's. Its reusable object is a previously checked fact tied to its validity dependencies, not an unconditional authorization or signed instruction to execute a transaction.
Current recipient allowlists, permissions, revocation, remote errors and uncertain commit outcomes remain live checks. The evaluation includes synthetic financial flows and 1,440 matched benchmark cells. Reported full-lifecycle reductions under equivalent compact representations were 3.49% in JavaScript and 1.79% in Python; some alternative presentation comparisons combine multiple optimizations and cannot be credited to reuse alone.
Proof caching helps only when the invariant is truly stable and the runtime still enforces fresh authorization at the external-effect boundary. Before adopting another verification layer, compare it to simpler attribute-based access control using the same workload and failure tests.
Matoi draws a narrow boundary between a previously checked stable predicate and a current grant to perform an action. A cache entry can retain a version-bound proof that a certain artifact satisfied a stable condition, but it cannot freeze a bank's recipient policy, revocation state, spending limit or an external service's uncertain result. The authors' matched compact-input experiment isolates the reuse benefit at 3.49% in JavaScript and 1.79% in Python; larger cited savings change the representation as well. The prototype banking actions were scripted, and the evaluation does not prove remote transfer atomicity or an advantage over straightforward allowlist enforcement.
The research separates a reusable previously proven predicate from current power to act. A cached fact can be safe to reuse when its dependencies still match, but current revocation, recipient constraints, balances and uncertain external commits cannot be inferred from that cache. The related Sepolia incident shows the complementary negative case: possession of a technically usable signing key still did not authorize the task's wallet spend. Both require current principal-action-resource checks, even though their evidence settings differ.
Mechanism and trust boundary
- 01
Step
- 02
Step
- 03
Step
- 04
Step
Claims & evidence
CLM-2026-MATOI-RECHECK-AUTHORITY-1The authors report matched full-lifecycle reductions of 3.49% for JavaScript and 1.79% for Python under equivalent input representation.supported
Basis: reported finding
- supportsMatoi: reusable checked evidence with live authorization rechecksprimary disclosure
Matoi evaluation, matched-cell comparisons of end-to-end overhead
CLM-2026-MATOI-RECHECK-AUTHORITY-2The approach caches dependency-bound evidence while rechecking revocation and current authorization at operation time.supported
Basis: reported finding
- supportsMatoi: reusable checked evidence with live authorization rechecksprimary disclosure
Design, evidence reuse limits and live authority checks
CLM-2026-MATOI-COMPARISON-QUALIFICATIONMatoi measured small reuse-only gains on equal compact input representations, whereas larger quoted reductions combine representation changes with reuse and cannot be attributed to proof caching alone.supported
Basis: reported finding
- supportsMatoi: reusable checked evidence with live authorization rechecksprimary disclosure
Paper abstract and matched 1,440-cell, 144-input full-lifecycle comparison discussion
Implications
Proof caching helps only when the invariant is truly stable and the runtime still enforces fresh authorization at the external-effect boundary. Before adopting another verification layer, compare it to simpler attribute-based access control using the same workload and failure tests.
Controls and mitigations
- Do not cache positive authorization grants, revoked capabilities or assumptions about uncertain external writes.
- Benchmark against a simple live authorization engine under identical input and failure conditions before introducing a proof-cache layer.
Unknowns and contradictions
- The banking environment was scripted and does not establish completed, real financial transfers.
- Revocation races and uncertain external commits remain separate problems.
- Benefits vary by workload; several measured families crossed the no-gain boundary.
Sources and citation
Material revision history
- Oct 17, 2026 · Canonical change recorded · new in release · revision 168