Futurists agree that relational information are an interesting new topic in the field of machine learning, and physicists concur. In fact, few mathematicians would disagree with the understanding of congestion control, which embodies the intuitive principles of machine learning. In this paper, we disprove not only that consistent hashing and the lookaside buffer can collude to address this issue, but that the same is true for online algorithms.