Entitlement Is Not Authorization

Subscription software must answer one question on every request: may this user do this, now? Production systems usually treat the answer as authoritative state, read at request time, and assume that stronger consistency is always safer. We systematize what is publicly known about entitlement correct- ness when billing truth is owned externally, and ask whether the consistency- token protocols of internal authorization transfer to it. Method. A multivocal review of 85 sources, two propositions, an error-cost model, TLC model checking, and a seeded simulation of 20,000 subscribers replicated across ten seeds. No Zanzibar-style token can exist for entitlement, because external billers share neither a write path nor a clock; staleness bounded by the recon- ciliation interval is achievable instead. In simulation the projection dominates: applying revocations at their effective time rather than on arrival cuts expected cost 27-fold, more than every freshness parameter combined. Under partition, serving the last snapshot dominates; failing open beats failing closed for sub- scribers whenever the cost ratio ρ of false denial to over-service exceeds about 0.35, but the break-even reaches 26 when 5% of users pay. A revocation hold- over pays only against spurious revocations, never beyond the reconciliation interval, and daily reconciliation makes error nearly insensitive to notification loss. Entitlement should be engineered as an eventually consistent derived view with an effective-time projection, per-class staleness bounds, and reconciliation as its source of truth. We contribute a vocabulary, six invariants, a reference architecture, a model-checked specification, and an open simulator.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-01
DOI
https://doi.org/10.5281/zenodo.23854188
Primary Topic
Distributed systems and fault tolerance
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Entitlement Is Not Authorization

Anamika Modi, Vipin Singh, Pratik Mishra, Susmita Singh
1 links
Zenodo (CERN European Organization for Nuclear Research)
Distributed systems and fault tolerance
preprint

Entitlement Is Not Authorization

Anamika Modi, Vipin Singh, Pratik Mishra, Susmita Singh
preprint en

Abstract

Subscription software must answer one question on every request: may this user do this, now? Production systems usually treat the answer as authoritative state, read at request time, and assume that stronger consistency is always safer. We systematize what is publicly known about entitlement correct- ness when billing truth is owned externally, and ask whether the consistency- token protocols of internal authorization transfer to it. Method. A multivocal review of 85 sources, two propositions, an error-cost model, TLC model checking, and a seeded simulation of 20,000 subscribers replicated across ten seeds. No Zanzibar-style token can exist for entitlement, because external billers share neither a write path nor a clock; staleness bounded by the recon- ciliation interval is achievable instead. In simulation the projection dominates: applying revocations at their effective time rather than on arrival cuts expected cost 27-fold, more than every freshness parameter combined. Under partition, serving the last snapshot dominates; failing open beats failing closed for sub- scribers whenever the cost ratio ρ of false denial to over-service exceeds about 0.35, but the break-even reaches 26 when 5% of users pay. A revocation hold- over pays only against spurious revocations, never beyond the reconciliation interval, and daily reconciliation makes error nearly insensitive to notification loss. Entitlement should be engineered as an eventually consistent derived view with an effective-time projection, per-class staleness bounds, and reconciliation as its source of truth. We contribute a vocabulary, six invariants, a reference architecture, a model-checked specification, and an open simulator.

Zenodo (CERN European Organization for Nuclear Research)
Google (United States) (US)
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