Repository navigation
test: harden theorem lane -- claim-coupling mutation twin + raw-id grounding (#3198) - #3263
Conversation
📦 Built Package ArtifactBranch: Option A — Install this exact build (recommended)npm install -g billion-context@0.0.3763-pr.3263.4558b84This exact version is immutable and reproducible. The rolling Option B — Download artifact
tar xzf billion-context-pr3263.tgz
npm install -g packageInstall instructions are refreshed on each push. |
(ai: vllm-qwen/qwen3.8-27b) 查重:不重复。 open+closed 全检索(issue+PR,按 theorem / proof / cache-stability / claim-coupling / grounding 多组关键词):机器证明线谱系为 #2149(形式化提案,已关)→ #2159(已合并,Z3 route-4 落地)→ 本 PR;本 PR 补的两个缺口来源是 #3198 内的独立 SMT campaign。没有其他在途 PR/issue 触碰 初审状态:分支基于当前 master(单 commit 静态审查已完成大半(spec 命名冲突、grounding 符号与真实代码的对应、既有义务回归清点均过),等 CI 定理 lane 与 test shards 出结果后给结构化八问结论。 |
(ai: vllm-qwen/qwen3.8-27b) PR #3263 审核结论(独立审读:全量 diff、SMT 命名空间碰撞检查、g4 断言逐条对照真实 kernel 代码、本地定向测试、CI 全量)。查重:不重复(见前一条回复;谱系 #2149→#2159→本 PR,无其他在途条目触碰 proof/ 或 cache-theorem.test.ts)。 八问:
验证记录:
结论:可合入。 CI 全绿、零回归、两个缺口都按车道自身的可证伪纪律闭合。等人合。 |
📦 Merged Build PublishedThis merge to master was published as npm install -g billion-context@0.0.456-master.62b86e5 # this exact build
npm install -g billion-context@master # always the newest merged build
|
References #3198 — proof hardening approved by @ranxianglei («证明补齐需要的,需要确保标签进出全域定理都永远是true»). Pure test/spec change to the existing #2149 route-4 machine-checked theorem lane; zero behavior surface.
What
Two additions closing the two gaps found by the independent SMT campaign in #3198:
proof/spec/t2-claimcoupling.smt2(new obligation, expected SAT): if live-message ref presentation were gated on reconcile CLAIM state instead of the persistent content-keyed map (assignRefs: an existingbyRawentry always wins), a byte-identical live message could present under DIFFERENT refs across consecutive turns, breaking T1's shared-subterm congruence for its tag bytes even though mid-history bytes never changed. The solver must exhibit the defect (witness shape: turn A takes the map-lookup path → stored number 5; turn B the fresh-allocation path → ≥ cursor 6). Shipped code has no such coupling — this twin proves the theorem WOULD break if it were ever introduced (the lane's own falsifiability discipline: a proof not falsifiable by its known-bad mutations is treated as broken).[grounding:g4]intests/cache-theorem.test.ts: pins the previously-unpinned first link of T2's antecedent chain —deriveMessageIddeterminism + each identity dimension (role/contentType/toolCallId/toolName/text) participating in the hash, andClusterCounternumbering being pass-stable AND prefix-extension-invariant (later duplicates continue the prefix's count; earlier ids never renumber). Before: g1 pinned the allocator GIVEN ids, t2-host pinned cursor monotonicity — nothing pinned id derivation FROM content.After this PR, every link of the antecedent chain (content→raw-id stable ∧ raw-id→ref persistent-map-keyed ∧ allocation monotone) carries both grounding AND mutation coverage.
Verification
tests/cache-theorem.test.ts15/15 green (was 13; +1 solver obligation, +1 grounding group) with z3 5.3.0; CI lane pinsz3-solver==4.9.1.0(README documents identical verdicts across builds).npm run typecheckclean.proof/spec/t2-claimcoupling.smt2(new),tests/cache-theorem.test.ts,proof/README.md(T2 bullet + grounding table row + obligation counts).No config surface change; no version touch.