跳到主要内容
Octopus Research Institute
AP-2026-0006架构论文同行评审: 未经同行评审证据强度: 假设状态: 已发布

Risk classification cannot be static: from a Memory System to a Commitment System

Ran Tao (Octoryn Research)

本文未经同行评审。请将其视为工作文档,而非经验证的结果。

摘要

Adversarial design paper (no code) attacking the assumption that a data slot carries a static risk class. A counterexample shows no static slot-to-risk label is correct in all contexts: an address is reversible editing a profile but irreversible seconds before dispatch of an order. Risk is a function of action, context, and the reversibility window, resolved at the commit site, not attached to data. This forces three layers — Memory, runtime Risk, and scoped Authorization — reframing a Memory System into a Commitment System bounded by provable reversibility. Experience is not authorization.

本 Research Object 以其原始语言(英文)发表。

Target under attack: the static map riskClass: Slot -> Risk

A prior safe-convergence design rests on riskClass being a property of the SLOT. This note attacks that assumption adversarially and argues it is false.

1. Theorem: riskClass cannot be static

Theorem. No static riskClass(slot) is correct in all contexts.

Proof (counterexample). Let "correct risk" denote the real reversibility of acting on a wrong value. Take the slot address:

  • C1 (profile edit, no live order): a wrong address is undoable, so the correct risk is REVERSIBLE.
  • C2 (moments before warehouse dispatch of a live order): a wrong address ships the package irretrievably, so the correct risk is IRREVERSIBLE.
  • A static label returns one value for both contexts: labeling it REVERSIBLE under-classifies C2 (an unsafe silent reuse of an irreversible commit); labeling it IRREVERSIBLE over-classifies C1 (it would confirm every profile edit, which is unusable).
  • No static label is correct in both. QED.

Risk is therefore NOT a slot property: it is a function of the action consuming the value, the world-context, and the time relative to the reversibility window. A slot's risk class is at best a conservative prior or lower bound, never the true risk. Slot-risk is not action-risk.

2. The three-layer risk hierarchy

There is an ordering: slot-risk (a schema prior) is weaker than action-risk (known once the action is selected), which is weaker than outcome-risk (the reversibility window — the latest and truest). The true risk resolves only at the latest layer. A static slot-risk both under-estimates (an address becomes irreversible at dispatch) and over-estimates (a delete is reversible within a trash-retention window); the under-estimating direction is the dangerous one because it permits a silent commit. Freezing risk on the slot substitutes a prior for a posterior — precisely the flaw that punches through the prior design.

3. Risk is compositionally unbounded, so it lives only at the commit site

Modeling risk as a function of action and context still assumes one can enumerate which actions a value feeds. In an open-ended agent a value is recombined into unforeseen actions (a field treated as "reversible" is later pasted into a transfer memo that trips fraud detection and triggers an irreversible account freeze). A value's risk depends on the unbounded set of downstream actions it might feed, including unforeseen ones. Therefore risk cannot be pre-attached to any slot or value — it can only be evaluated at each COMMIT action's site, on its inputs, at commit time.

Strongest form: risk is a property of the ACT OF COMMITTING, computed at the commit site, never a property of data. This is why it cannot be static on the slot, and it directly implies the commitment reframe below.

4. The design upgrade — and an adversarial attack on it

Upgrade: evaluate risk as a function of action, context, and time, combined with provenance and source, computed conservatively at the decision point (lifting the zero-false-confident discipline to risk estimation itself: unprovable reversibility is treated as irreversible).

Adversarial attack on the upgrade: the reversibility window is (a) partially UNDECIDABLE (has the counterparty acted on the contract? has a transfer settled? this is unknowable in advance), (b) NON-MONOTONE (a settled transfer may reopen a recall window), and (c) EXTERNALLY dependent (an instant rail versus a next-day rail — reversibility depends on the external system). The risk estimator cannot always be correct; the only safe collapse is to require authorization whenever reversibility is unprovable. This is clean, but it bounds convergence by how much reversibility the system can prove.

5. Memory System to Commitment System (actually three layers)

Experience is not authorization. Memory converges inputs; crossing an irreversibility boundary is not a memory operation but an AUTHORIZATION operation, and authorization is a stateful object with scope, expiry, and revocability. So the system is three layers:

  • Memory — converges the provably-reversible interior (fact reuse) toward zero residual interaction.
  • Risk-estimation — computes the reversibility window at the commit site; conservative (unprovable means irreversible).
  • Authorization — scoped, expiring grants for crossing an irreversibility boundary; experience never substitutes for it.

The system's real convergence target is the outcome commitment — the target outcome plus the set of irreversibility boundaries (commitment points) on the path. This coincides with the runtime notion of a completion signal, or where the system can no longer act autonomously: the commitment boundary IS that line.

6. Verdict and upgraded thesis

  • riskClass CANNOT be static. It must be a function of action, context, and time, computed at the commit site, conservatively.
  • The Memory-to-Commitment reframe is correct, but adversarially it is THREE layers (Memory, Risk, Authorization), and its safety collapses onto a partially-undecidable core: reversibility-window prediction.
  • Theoretical closure: convergence is fundamentally bounded by the decidability of reversibility. Experience converges the provably-reversible interior toward zero; the irreversible (and the unprovably-reversible) is gated by commit-site runtime risk plus fresh scoped authorization; the convergence ceiling equals how much reversibility the system can prove.

This upgrades the design from a Memory System to a Commitment System: a runtime that accumulates experience but never treats experience as authorization, recomputes risk at every irreversibility boundary at the commit site, and requires fresh scoped authorization to cross it. That is the core of a sovereign execution runtime, not a local memory plus autocomplete.

声明边界

作者对范围的明确界定——本工作证明了什么、未证明什么——沿用自 Octoryn Research 的发表模型。

证明

  • No static slot-to-risk label is correct in all contexts (counterexample: an address is reversible on a profile page yet irreversible seconds before dispatch) — risk is a function of action, context, and reversibility window, resolved at the commit site, not a slot property.
  • Risk is compositionally unbounded: a value may feed unforeseen downstream actions, so it cannot be pre-attached to data and must be evaluated at each commit action's site at commit time.
  • The safe collapse for an undecidable reversibility window is to treat unprovable reversibility as requiring authorization, which bounds convergence by provable reversibility.
  • The system is most precisely a Commitment System (Memory plus runtime Risk plus scoped Authorization), not a Memory System; experience is not authorization.

未证明

  • A constructive algorithm for computing the reversibility window — it is argued to be partially undecidable, non-monotone, and externally dependent, hence only conservatively approximable.
  • That the three-layer system is implemented or tested — this is a paper design with no code.
  • A closed-form upper bound on convergence — the bound is how much reversibility the system can prove, which is domain- and world-state-dependent.
  • That requiring confirmation or authorization removes the human-factors residual, since rubber-stamping can persist.

适用于

  • Deciding whether accumulated experience may auto-commit an action that crosses a reversibility boundary whose window depends on world-state and time.

不适用于

  • Purely reversible interiors where memory convergence toward zero is safe, or domains where reversibility is statically provable.

作者

  • Ran Tao — 调查研究, 写作

引用本文

引用格式

Tao, R., Octoryn Research. (2026). Risk classification cannot be static: from a Memory System to a Commitment System (AP-2026-0006). Octopus Research Institute.

BibTeX

@techreport{oriap20260006,
  title       = {Risk classification cannot be static: from a Memory System to a Commitment System},
  author      = {Tao, Ran and {Octoryn Research}},
  institution = {Octopus Research Institute},
  year        = {2026},
  note        = {Permanent ID AP-2026-0006. Not peer reviewed.}
}

披露

资助
硬件与基础设施由 Octoryn / Octopus Core Pty Ltd 提供。
利益冲突
Octoryn 提供商业推理与治理工具;相关发现独立报告。