BIT VC-Theorem v1.1 Safety-Constrained Local Reaction-Time Lower-Bound Theorem with Fast Aggregate Intervention Necessity Corollary

This record presents Version 1.1 of the BIT VC-Theorem. The work develops an analytical lower-bound theorem under an explicitly defined linear per-node accumulation model with safety constraints. The theorem is accompanied by a synthetic benchmark used only to validate the implementation and illustrate the analytical trade-off. The scope is restricted to the stated model assumptions. No claim of universal validity or field deployment is made.