FA-100631 / Mixture of experts dispatch / Open access

Tokens with too few available routes are partially dispatched · case 01

Tokens with too few available routes are partially dispatched.

Verified by executionVariant 1 · 6 checks per implementationDownload source bundle ↓JSON ↗

ROOT CAUSE

The router returns a partial assignment despite a minimum route contract.

THE FAILURE

The router returns a partial assignment despite a minimum route contract.

Unsuccessful approach: Checking the minimum before capacity drops can keep a token that later falls below minimum.

Case contract

For each token’s ranked routes, select up to k experts; emit the token with its selected list only if at least minimum routes survive.

Why this case matters

A deterministic toy router makes this dispatch decision independently inspectable.

1 / The failure

Exit 1

"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(choices,k,minimum):
    return [[i,row[:k]] for i,row in enumerate(choices)]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
e='e'+str(N); f='f'+str(N); rows=[[(e,3),(f,2)],[(e,1)],[]]
check('minimum two',solve(rows,2,2),[[0,[(e,3),(f,2)]]])
check('minimum one',solve(rows,1,1),[[0,[(e,3)]],[1,[(e,1)]]])
check('zero minimum',solve(rows,1,0),[[0,[(e,3)]],[1,[(e,1)]],[2,[]]])
check('empty choices',solve([],N,1),[])
check('k below minimum',solve(rows,1,2),[])
check('exact minimum',solve([[(e,1),(f,2)]],2,2),[[0,[(e,1),(f,2)]]])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)

Boundary fixture	Actual	Expected	Outcome
minimum two	`[[0, [['e1', 3], ['f1', 2]]], [1, [['e1', 1]]], [2, []]]`	`[[0, [['e1', 3], ['f1', 2]]]]`	Failed
minimum one	`[[0, [['e1', 3]]], [1, [['e1', 1]]], [2, []]]`	`[[0, [['e1', 3]]], [1, [['e1', 1]]]]`	Failed
zero minimum	`[[0, [['e1', 3]]], [1, [['e1', 1]]], [2, []]]`	`[[0, [['e1', 3]]], [1, [['e1', 1]]], [2, []]]`	Passed
empty choices	`[]`	`[]`	Passed
k below minimum	`[[0, [['e1', 3]]], [1, [['e1', 1]]], [2, []]]`	`[]`	Failed
exact minimum	`[[0, [['e1', 1], ['f1', 2]]]]`	`[[0, [['e1', 1], ['f1', 2]]]]`	Passed

SHA-256 / eb168e083de139507cba1254d26c83e457f6aca9816c99e6fb3d33e2cfa79ab4

2 / The unsuccessful fix

Exit 1

"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(choices,k,minimum):
    return [[i,row[:k]] for i,row in enumerate(choices) if len(row)>=minimum]
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
e='e'+str(N); f='f'+str(N); rows=[[(e,3),(f,2)],[(e,1)],[]]
check('minimum two',solve(rows,2,2),[[0,[(e,3),(f,2)]]])
check('minimum one',solve(rows,1,1),[[0,[(e,3)]],[1,[(e,1)]]])
check('zero minimum',solve(rows,1,0),[[0,[(e,3)]],[1,[(e,1)]],[2,[]]])
check('empty choices',solve([],N,1),[])
check('k below minimum',solve(rows,1,2),[])
check('exact minimum',solve([[(e,1),(f,2)]],2,2),[[0,[(e,1),(f,2)]]])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)

Boundary fixture	Actual	Expected	Outcome
minimum two	`[[0, [['e1', 3], ['f1', 2]]]]`	`[[0, [['e1', 3], ['f1', 2]]]]`	Passed
minimum one	`[[0, [['e1', 3]]], [1, [['e1', 1]]]]`	`[[0, [['e1', 3]]], [1, [['e1', 1]]]]`	Passed
zero minimum	`[[0, [['e1', 3]]], [1, [['e1', 1]]], [2, []]]`	`[[0, [['e1', 3]]], [1, [['e1', 1]]], [2, []]]`	Passed
empty choices	`[]`	`[]`	Passed
k below minimum	`[[0, [['e1', 3]]]]`	`[]`	Failed
exact minimum	`[[0, [['e1', 1], ['f1', 2]]]]`	`[[0, [['e1', 1], ['f1', 2]]]]`	Passed

SHA-256 / c1bdc45891148e677ab723956b50f52b4436fa9add7a4c1c397aaef28c4ac84d

HELD IN THE MEMBER ARCHIVE

The verified repair and its recorded checks are member-only.

This mechanism has 6 recorded checks per implementation. The open-access tier publishes the failure and the unsuccessful fix; the repaired source that passes every check, and the observations that prove it, are available to members.

Every case sharing this mechanism uses the same contract and the same repair, so this one record is held back for all of them.

Member access is invitation-based. Sign in with your invited account to inspect the repair.

Verification & scope

Inputs are finite toy scores and routes; the contract does not model a production model, accelerator, or learned routing quality. This reproducer isolates one failure mechanism. Results cover the supplied fixtures. Variants within a family share a test contract and should remain grouped when constructing evaluation splits. Related mechanisms with a shared evaluation_group must also remain together; these controlled models are not independent production incidents.

Observations recorded using Python 3.12.14 at 2026-09-30T16:48:37.646367+00:00.

Case digest / 2dc7e0a48c72e241b77eeedcef1d450ff33b09d4d730fe56e028b660cb571224