FA-15244 / Numerics / Member archive
Restricted growth strings: exact block count terminal · case 04
The exact restricted growth strings result violates the stated contract at exact block count terminal.
Case contract
Input length n (1..6), maximum blocks B>=1; return lexicographic restricted-growth strings a0=0, a_i<=1+max(prefix), using exactly B blocks.
Why this case matters
Exact discrete arithmetic with observable algorithmic state; no floating point approximation is used.
One recorded failure
Sample boundary fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| explicit oracle 0 | [] | [[0, 0, 0]] | 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 ↗