I Replaced Claude Code’s /compact With Dijkstra

A session graph, shortest paths and a knapsack kept every rule at half the tokens of a summary. Then the next task cost twice as much. I looked at the compactions in my own long Claude Code sessions. Each /compact read between 437k and 830k tokens, took 134 to 182 seconds, and produced a summary of 20k to 28k characters. That summary is everything the rest of the session knows about what came before. A model wrote it in one pass, deciding on its own what would matter later. Two things about that bothered me. First, a summary paraphrases. “Amounts are integer cents end to end” can come back as