We present a randomized algorithm that essentially resolves the classic negative-weight single-source shortest paths problem.