FA-98045 / Sequence batch packing / Member archive
Greedy packing flushes one token too early · case 05
Greedy packing flushes one token too early.
Case contract
Append sequences in order to the current bin; flush only when adding the next sequence would exceed capacity. Return bins of sequences.
Why this case matters
This deterministic toy packing rule models a common boundary in preparing bounded training sequences.
One recorded failure
Sample boundary fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| exact fill | [[[5]], [[2, 2, 2, 2, 2]]] | [[[5], [2, 2, 2, 2, 2]]] | Failed |
MEMBER ARCHIVE
The complete case is available to members.
This record includes three runnable implementations, regression fixtures, execution results, and source hashes.
Member access is invitation-based. Sign in with your invited account to inspect the sources.
Sign in to the archive ↗