pub fn admissible(cands: &[Candidate], objective: Objective) -> Vec<&Candidate>Expand description
The candidates objective may choose among.
★ A RAGGED GRID ONLY WHERE IT COSTS NOTHING IN TOTAL WORK. Balanced ranks the busiest site’s arithmetic
second, so it favours a grid that spreads the arithmetic thinner even where the spread moves more bytes in
more transactions than an evenly divided plan beside it — at 640³ on the Wormhole twin, a ragged 7×5 grid
against the 5×5 that beats it on every meter, a benefit the simulator cannot show. So under Balanced a
ragged plan is admissible only where no evenly divided plan beats it on every predicted total: bytes moved,
transactions and compute-engine calls. The comparison is against the even plans only: against every plan it
would choose the fewest sites, since a plan on fewer sites moves fewer bytes in total, and refuse the
parallelism the objective exists to buy. Every other objective names its own axis and admits every plan;
the roofline prices the spread a ragged grid buys against the bytes and transactions it costs, at the
target’s cited rates, which is the measurement this rule stands in for.