pub type RankKey = [u128; 7];Expand description
★ WHAT THE COMPILER IS MINIMIZING, SAID OUT LOUD — and the knob for changing it.
This is a POLICY, not a fitted weight, and the distinction is the whole point. The lattice of legal plans is enormous (4,209 at 512^3) and every one of them computes the same answer; the conservation law says they even retire the same arithmetic. What separates them is how much of the machine they spend carrying operands to that arithmetic, and WHICH of those costs matters is a property of the deployment, not of the mathematics. So it is named, defaulted, and overridable — never inferred, and never a constant fitted to a simulator.
It is not a strategy enum. It names no plan, tiling or arrangement; it names an axis to minimize, and which plan wins is still whatever the search finds. Two objectives over the same lattice pick two different plans and a human wrote down neither of them.
★ THE FRONTIER IS REAL AND IT IS THE POINT. Balanced and Energy genuinely disagree: the plan that
spends the least machine in total is not always the one that spreads best across it, and a compiler
that pretends otherwise is hiding a trade-off rather than owning it.
A plan’s rank under an Objective: exact counts compared in order, most significant first.