BIT-SCC-002 — Combinatorial Aperture and Causal-Debt Compression Calculus: v1.1 PRECANONICAL F5 R2

BIT-SCC-002 develops a typed pre-canonical calculus for distinguishing combinatorial possibility from realized useful computation. It models configuration aperture, structured selection, sparse activation, dependency and resource cuts, valid execution receipts, residual causal debt, and integrated causal-debt lifetime. R2 corrects the scope of the previous additive-overhead parallel bound by replacing it with a critical-path and typed-resource lower bound, and adds a causal-concurrency compression theorem. The analytic pack contains 8 independent theorems, 7 derived or specialized results, and 10 supporting propositions or certificates. A locked finite/property corpus reports 36/36 expected outcomes, with a separated checker reporting 0 mismatches. Scope: PRECANONICAL F5 KERNEL_CHECKED. No proof-assistant mechanization, independent vendor benchmark, field validation, production readiness, universal novelty, or claim of free exponential computation is asserted. This is an independent research record by Bùi Quang Trịnh under the Boundary Information Theory (BIT) research program.