Quadratic Cross Terms and a Complete Finite Factorisation Corridor

The discriminant identity for two quadratic cross terms yields a finite even-coefficient corridor characterizing odd composite integers. Exhaustion supplies a primality certificate and recursive splitting yields complete integer factorisation. The balanced case is Fermat's difference-of-squares method; the linear-size worst-case corridor is stated explicitly.