Evidence-Dependent Dynamic Eligibility Propagation and Commit Consistency

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.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-17
DOI
https://doi.org/10.5281/zenodo.24298002
Primary Topic
Distributed systems and fault tolerance
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Evidence-Dependent Dynamic Eligibility Propagation and Commit Consistency

Gen Wan
Zenodo (CERN European Organization for Nuclear Research)
Distributed systems and fault tolerance
article

Evidence-Dependent Dynamic Eligibility Propagation and Commit Consistency

Gen Wan
article en

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.

Zenodo (CERN European Organization for Nuclear Research)
Distributed systems and fault tolerance
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon