Six studies. The problem, the result, and the evidence behind it.
Three correctness-gated RTL transformations span Boolean simplification, arithmetic restructuring, and sequential state representation.
A five-node integration rule is compared against a fixed baseline, with both the acceptance score and direct residual errors exposed.
A deterministic scheduling policy reaches a 29.37% lower governed score while preserving feasibility across the frozen portfolio.
Three tolerance-aware corpus leaders plus an exact rational certificate of strict local optimality for one 78-contact configuration.
A routing policy is replayed against LightSABRE on a frozen 72-case portfolio across Q20, Willow, and Heron-FEZ targets.