发表机构
Centre for Development of Advanced Computing（高级计算发展中心）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
针对拜占庭SMR中隐藏状态授权问题，提出公平预留/使用协议，满足授权安全性与先到者活性，解决隐藏资源安全动态分配问题。
AI 中文摘要
已验证的拜占庭SMR假设副本可以评估有序命令的有效性。智能体授权则形成了不同的机制：命令的有效性可能仅相对于验证者无法从日志中重构的已提交策略状态而言。因此，某一操作在旧提交时被授权的证明只是一份历史凭证，其本身并不能为后续使用预留隐藏资源。我们明确了在拜占庭领导者下安全、动态分配隐藏消耗性资源的两个独立要求：第一，正确副本的到达顺序必须约束提交顺序，这是公平排序协议所解决的问题；第二，已提交的首个请求必须绑定后续有效性，即必须使冲突的后续请求无效，而非仅记录首个请求曾被授权。第二个要求具有非空性，恰恰是因为当前策略状态是隐藏的且不可前缀恢复。通过显式授权见证接口，我们在单次预留模型中明确了这两种不同的义务，并提出了一种公平的预留/使用协议，该协议满足授权安全性和先到者活性。在可信FIFO准入下，这两个要求会合并，因为准入与执行是原子的，而拜占庭SMMR将请求提交与使用分离开来。
英文摘要
Validated Byzantine SMR assumes that replicas can evaluate the validity of an ordered command. Agent authorization creates a different regime: a command may be valid only relative to a committed policy state that validators cannot reconstruct from the log. A proof that an action was authorized at an old commitment is then only a historical attestation, it does not by itself reserve the hidden resource for later use. We isolate two independent requirements for safe live allocation of a hidden consumable resource under a Byzantine leader. First, arrival order at correct replicas must constrain commit order, the gap addressed by fair-ordering protocols. Second, a committed first request must bind later validity: it must make conflicting later requests invalid, not merely record that the first request was once authorized. The second requirement is non-vacuous precisely because the current policy state is hidden and not prefix-recoverable. Using an explicit authorization-witness interface, we characterize the two distinct obligations in this one-shot reservation model and give a fair reserve/use protocol satisfying both authorization safety and first-arrival liveness. Under trusted FIFO admission the two requirements collapse because admission and execution are atomic, Byzantine SMR separates request commitment from use.
CommentsAccepted at DISC 2026
DOI：10.4230/LIPIcs.DISC.2026.58
