为大模型推理路径设计可审计的散射层，确保每步推理可验证且不可篡改。
Deposon: An Auditable, Conservation-Guaranteed, Game-Theoretically Tested Scattering Layer over LLM Reasoning Paths
- 引入双参数散射层，将推理路径抽象为能量守恒的三通道动态过程
- 在合成测试中路径过滤准确率达100%，显著优于基线模型（7%/10%）
- 核心优势在于机器可验证性，适用于对推理透明性要求高的场景
多步大模型推理缺乏可机器验证的记录：被丢弃的推理路径无审计痕迹。本文提出Deposon散射层，将推理图中每个节点绑定至一个双参数的Deposon状态；路径经历透射、反射与不可逆耗散三通道作用，满足能量守恒关系T+R+A=1，单路径最大能量审计偏差仅为2.2E-16（机器精度）。在合成陷阱基准上，路径过滤性能达100%（预注册），而基线模型仅7%/10%。真实数据集上，该层与六关键词规则过滤无差异（GSM8K 0.87 ≥ 0.85, McNemar p=0.5；StrategyQA 0.899 = 0.899），故结论聚焦于‘可验证性’。融合实验显示，与语义先验的凸组合无法提升性能（物理题0.484 → 0.452），所谓λ=2增益实为反场效应，表明增益必须非线性。将逆动力学建模为图上的势博弈，验证标量单调性与近梯度特性，并量化经验协调比（ECR）。三个形式化等价命题（P1a/P1b/T-P1c）在预注册销毁协议下被证伪，势博弈主张降级为近似（循环图中位残差0.669）：仅一致性证据在动力学层面成立。代码开源：github.com/zeroandcat/Deposon。
原文摘要 · Abstract (English)
Multi-step LLM reasoning lacks a machine-recheckable ledger: discarded reasoning paths leave no auditable record. We propose the Deposon scattering layer, which binds each node of an LLM-generated concept-decomposition graph to a two-parameter Deposon state; paths undergo three-channel scattering -- transmission, reflection, irreversible dissipation -- obeying T+R+A=1 for arbitrary parameters, with a maximum per-path energy-audit deviation of 2.2E-16 (machine epsilon). We report all three evidence tiers honestly. On synthetic trap benchmarks the path-filtering gain is closed (pre-registered): unified reaches 100% versus a decoy-capture baseline at 7%/10%. On real benchmarks the layer is indistinguishable from a trivial six-keyword rule filter (GSM8K 0.87 >= 0.85, McNemar p=0.5; StrategyQA 0.899 = 0.899); no difference is detected here, so we sharpen the claim to "the differential value lies solely in machine verifiability." Fusion yields a second negative result: convex combinations with a semantic prior never improve (physics 0.484 -> 0.452), and the apparent lambda=2 gain is an anti-field artifact; any fusion gain must be nonlinear. Modeling the reverse dynamics as a potential game on the graph, we evidence an auditable scalar's monotonicity and near-gradientness and quantify the empirical coordination ratio (ECR). The three formalized dynamical-equivalence propositions (P1a/P1b/T-P1c) are falsified under the pre-registered kill protocol, and the potential-game claim is downgraded to approximate (cyclic-graph median residual 0.669): only consistency-level evidence survives at the dynamical level. Code: github.com/zeroandcat/Deposon.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。