# Study 19 — Combinatorial State Space: 5-Player Go First Dice **Status: LAW FROZEN + LIVE CLAIM — 2026-08-24 · Meyer 2023 5×d60 CALORIE** **Program:** [Language-games study board](Language-Games-Study-Board.md) · [Study 11 Ehrhart](Study-11-Ehrhart-Volume-Shear.md) · [Study 12 chance](Study-12-Quantum-Parallel-Repetition-Shear.md) | Surface | URL / key | Grade | |---|---|---| | Claim UI | https://affine.earth/language-game/study-19-gofirst.html | POST `gofirst` ingest | | IDE | https://affine.earth/language-game/ide.html#gofirst-dice | hash loads the cited faces and POSTs | | Look | https://affine.earth/language-game/#researcher | GET only | | Court | `POST /language-invariant/game/gofirst/ingest` | `die_a`…`die_e` + `cited_id` + `perm_num`/`perm_den` · source+role | | Affine story | https://affine.earth/language-game/#story/Study-19-Go-First-Dice | this charter | | GitHub | https://github.com/gaiaftcl-sudo/uum8dSolarResearch/wiki/Study-19-Go-First-Dice | door | Isolate a minimal-face integer set for N=5 dice such that all 5! (120) outcome permutations hold uniform probability, with zero collision states (ties). Exact discrete optimization over integer partition space. **Conventional failure:** CPLEX/Gurobi-class solvers use floating-point simplex relaxations. Pruning depends on libm epsilon. Float drift forks cells; pruned branches uncertifiable; consensus on the search tree breaks. **Affine path (UUM 8D Math Court):** exact checkable integer proof, not heuristic convergence. 1. **Exact Rational Boundary Mapping** — 120 orderings as exact irreducible rationals. The court reuses `GaiaFTCLCore.Rational` (cross-multiply `a·d < c·b`), the same law GET `/language-invariant/rational/boundary` and `/language-invariant/rational/arena` already serve. Stein binary GCD lives on that path. `REFUSED_FLOAT`. 2. **Discrete Shear for Traversal** — prune by raw limb cross-multiply. The branch that dies on one cell dies on all. Pruning is an arithmetic artifact, not a tolerance. 3. **Event-Sourced Verification** — seal refuses what the constructor refuses. GET `/language-invariant/eisenstein/seal` is the decode-path sibling. Decode on any peer runs the same predicate. **Integration payload:** the published N=5 face configuration as a checkable integer proof. Uniformity is exact `1/120` (`perm_num=1`, `perm_den=120`). Never `0.008333`. This IS an optimal-control case for the shear studies. **Shear mapping** - Boundary saturation: 1/120 cross-multiply of *accumulated* products blows 64-bit; wrap = logic shear - String-backed / limb isolation: `/language-invariant/rational/boundary` expands exact rational state, no truncation - Substrate consensus: localized int shear = silent fork; strings/limbs over bounded int/uint The court **verifies** a presented integer face tuple. It does not search for faces. Deriving an unknown configuration by iteration is the 2D fallacy (LAW 4 / LAW 9). --- ## Integer keys | Key | Kind | Rule | |---|---|---| | `die_a`…`die_e` | Int64 lists | five published 60-face lists, strictly increasing | | `cited_id` | exact token | `meyer-2023-5d60` | | `n_players` | Int64 | 5 | | `face_counts` | Int64 list | `[60,60,60,60,60]` | | `perm_num` / `perm_den` | Int64 | exact Rational `1/120` via `!(p