Find least sampling-sensitive electional rule relaxations by exact minimax regret

Evaluates one fixed 15-minute grid, projects it onto every 30- and 60-minute phase, and exhaustively computes each rule-relaxation set's exact proportional loss from every grid's optimum at every exact omission budget. It returns every minimax tie and every candidate's per-grid evidence without selecting or scoring one astrologically. This is transparent sampled-set arithmetic, not continuous-time proof, weighting, recommendation, interpretation, prediction, probability, or statistical confidence. No licensed catalog, new dependency, or request-time network source is used. One standard quota unit per admitted request; failed or timed-out admitted attempts are not refunded. Do not automatically retry. Historical mode uses an explicit BCE/CE date object and UT1 conventions. Its response is the versioned historical envelope, not the modern UTC envelope. Read result for calculation fields and metadata for limits and uncertainty.