A passive lossless network may route the same k-dimensional input channel to different output subspaces at different frequencies. Every two-frequency restriction can be cheap while the joint task is not. For L distinct boundary frequencies and mutually orthogonal prescribed output k-planes, we prove that the minimum McMillan degree among square finite rational-inner transfer matrices regular at the interpolation nodes is exactly k(L-1). Each pair alone requires degree k, so the largest two-node minimum underestimates the global memory by the unbounded factor L-1. The result is independent of node spacing. Necessity follows both from a zero budget for an analytic minor and from a Pick-Stein displacement identity whose negative inertia cannot exceed realization rank. Sufficiency follows from an explicit positive Pick completion. Beyond exact orthogonality, we derive a general cross-frequency inertia certificate, a gauge-independent span bound, an open robust region preserving the integer memory count, and a fail-closed noisy-eigenvalue certificate. Deterministic code tests arbitrary nodes, synthesizes minimal conservative realizations, and independently verifies the stated identities.