We explore a new network-performance metric: flow/path consistency, which captures whether the end-to-end performance of the flows that traverse a network is consistent with the aggregate performance of the network's elements. We propose a formal definition; provide preliminary evidence that-by leveraging simple math-it can be estimated with configurable confidence and minimal overhead; and argue that it could simplify network debugging.