Executable Semantics for the Ordinary Standard Model: Frozen Conventions, Typed Reconstruction, and Evidence-Bounded Validation

This work presents an executable, deterministic semantic representation of the ordinary Standard Model. It integrates frozen semantic conventions, registry-backed identities, an immutable 204-node abstract syntax tree, recursive provenance, canonical serialization, typed mass-basis lowering, and fail-closed validation.The complete F13–F24 semantic suite passes reproducibly across independent processes. Typed lowering produces 115 component terms and 100 canonical vertex classes. Comparison with a pinned FeynRules implementation establishes non-gravitational dynamical equivalence subject to an explicitly preserved field-independent residual, \(λ v^4/4\), and exact agreement for 13 declared representative vertices after canonicalization and generic flavor-basis alignment.The result validates a bounded ordinary-Standard-Model semantic and comparison pipeline. It does not claim that GCFT derives the Standard Model, nor does it establish loop-level, amplitude-level, gravitational, BSM, SMEFT, or phenomenological closure. The manuscript is accompanied by machine-readable claim-to-evidence mappings and cryptographically receipted validation artifacts.