We propose a routing algorithm that takes a sequence of vectors and computes
a new sequence with specified length and vector size. Each output vector
maximizes "bang per bit," the difference between a net benefit to use and net
cost to ignore data, by better predicting the input vector