Evidence-Dependent Dynamic Eligibility Propagation and Commit Consistency
Year: 2026
Type: article
Abstract: An agent decides that an action is permitted, then executes it later. Between the two moments the facts that justified the decision can change, and the change reaches the executing party only after the decision has been made. Admission controls answer the question at the first moment; the second moment belongs to the transaction that makes the effect durable. This paper studies the object that should carry authority from one moment to the other. We model execution eligibility as a versioned, evidence-dependent object. A qualification version records what admission checks normally conflate into a boolean: the potential dependency footprint Dq, the facts actually read Wr, a sufficient positive witness Ws, the source revisions v, and a digest of the predecessor version. Keeping the three sets apart changes what invalidation has to mean. A change confined to facts outside Dq cannot alter the qualification, so propagation can be scoped instead of global; a change that destroys the selected witness need not destroy eligibility, because an alternative path may still support it. On this object we define a commit-consistency protocol. A grant binds an exact canonical action, a durable logical operation identity and one qualification version; a mediated sink validates and consumes the grant inside the transaction that applies the effect. Three results are proved under eight stated assumptions: dependency confinement, persistence of a positive support witness, and eligibility-commit consistency, the last a conditional protocol theorem whose strength is fixed by its isolation assumption. The protocol was written as a TLA+ specification and checked with TLC across 50 configurations, the largest exploring 2,341,477 distinct states; Section 7.3 states what those counts do and do not support. The reference implementation is reported separately from the protocol it approximates: nine archived assessments under a record store that has no revocation path, graded claim by claim in Section 7.4. A hardware-rooted extension is then specified as a capability bound to code measurement, qualification version, evidence revisions and a monotonic counter, with five non-bypass obligations and three testable predictions. The implementation assessed in Section 7.4 is pinned to tag v3.4.2-candidate, commit 83484f79ad387296e623376f41b84bf1fb20d8ba, of the linked repository. verify_pack.py in that tree checks the release contents offline. The TLA+ modules and run logs are not part of that repository.
Author: Wan, Gen
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7234947468
