BIT-CVC Frozen Release: Obligation Settlement Calculus (OSSC-001 R1+R2) and Result-to-Use Causal Admissibility Calculus (CVC-001 v1.0 + Annex) with Independent Second-Engine Verification

This record freezes two formal calculi from the Boundary Information Theory (BIT) program, together with an independent second-engine verification pack. Contents: (1) BIT-CVC-001 v1.0 — Result-to-Use Causal Admissibility Calculus (PRECANONICAL_CLOSED, unchanged); (2) BIT-CVC-OSSC-001 R1 — Source-Oracle-Grounded Obligation Settlement Calculus (unchanged); (3) OSSC-001 R2 — independent second-engine verification, reconstruction of lemmas L1–L6, publication freeze; (4) CVC-001 v1.0 Annex — second-engine re-check, non-reopening; (5) BIT_CVC_Freeze_PACK.zip — both verification engines, receipts, SHA-256 manifest; (6–7) a load-bearing ablation test of the five CVC components with its own pack. Headline results: 124,871 machine checks, 0 failures, byte-deterministic (seed 20260725). OSSC: 8/8 theorems, 12/12 countermodels at expected labels, 8/8 mutants killed; six lemmas cited by R1's proof DAG but never stated are reconstructed and machine-checked (2,401 checks). CVC: theorems T1–T5 independently reproduced, including the a=−b joint-vs-marginal counterexample and the moving-sum bound (max lhs/bound 0.9615 over 20,000 càdlàg trials; symbolic residual identity via SymPy). Claim boundary: finite-model verification only — not proof-assistant mechanization (F6), not independent human review (F7); world anchoring untouched (no benchmark, no field data); component novelty collapses to standard prior art (RATS, W3C VC 2.0, SCITT, PROV, in-toto, speaks-for); the unified claim has passed only a Stage-1 screening. The branch is frozen; a handover map for successors is in R2 §7 (Lean mechanization order, human review, systematic prior-art review, world anchoring, distributed runtime). Documents: CC-BY-4.0. Code inside the packs: MIT.