What Does a Stream Model Buy You in Flow Matching?

Stream-level flow matching replaces the linear interpolant of conditional flow matching (CFM) by a Gaussian-process (GP) stream connecting each source--target pair, and reports lower sample error than icfm on 2-Gaussian, MNIST and CIFAR-10 benchmarks. We ask what such a stream model actually contributes. Three results answer the question. (i)~Reduction. The stream-level CFM objective depends on the stream law only through the per-time joint law of (st,sdott), so the conditional paths a Gaussian stream can reach are exactly the Gaussian conditional paths CFM already parametrises; in the coordinate-wise, shared-scalar-kernel construction gpcfm actually uses, the entire design space collapses to two scalar curves (mt,vt), and cross-time covariance affects only estimator variance. (ii)~The GP is a constrained chart of that space. One kernel sets both mt and vt, so the paper's own recipe for widening coverage-shrinking the SE length-scale---destroys the interpolant (the midpoint mean weight falls from 1.03 to 0.00). On the 2-Gaussian benchmark this makes the GP chart diverge on 15/200 runs at high coverage against 0/200 for a decoupled (mt,vt) chart (p=6.6×10-5), and crossing the two curves shows the divergence tracks the mean, not the variance. On MNIST the same sweep does not diverge and the ordering reverses, so whether the coupling is harmful is benchmark-dependent; what holds on both is that the recipe buys nothing---no coverage level beats the paper's own, and past maxt√vt≈0.6 both charts degrade. (iii)~Audit. The released code does not implement the mechanism it describes: state and velocity are drawn independently (corr=0.00±0.01 against an intended ±0.83--0.99).