FA-50186 / PCM sample encoding / Open access
Pcm residual partition seeds: partition sample order · case 01
Reconstructed sample order reverses inside each partition.
ROOT CAUSE
Reconstructed sample order reverses inside each partition.
VERIFIED REPAIR
Use the stated conversion contract at partition sample order.
Unsuccessful approach: Emitting the partition seed repeats a constant level.
Case contract
PCM residual partitions optionally replace predictor with an absolute seed; continuation partitions ignore their seed field and empty partitions retain state transitions.
Why this case matters
Offline PCM interchange uses these exact bounded packet and sample representation decisions.
1 / The failure
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(partitions, initial):
state=initial
out=[]
for reset,seed,residuals in partitions:
if reset:
state=seed
section=[]
for residual in residuals:
state+=residual
section.insert(0,state)
out.append(section)
return [out,state]
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('oracle 1', solve(*([[True, 10, [1, 2]], [False, 99, [-1]]], 0)), [[[11, 13], [12]], 12])
check('oracle 2', solve(*([[True, 0, [2]], [False, 5, [1]]], 7)), [[[2], [3]], 3])
check('oracle 3', solve(*([[True, 4, []], [False, 0, [1]]], 0)), [[[], [5]], 5])
check('oracle 4', solve(*([], 3)), [[], 3])
check('oracle 5', solve(*([[False, 99, [1, 1]]], 2)), [[[3, 4]], 4])
check('oracle 6', solve(*([[True, -3, [-1, 2]]], 5)), [[[-4, -2]], -2])
check('oracle 7', solve(*([[False, 0, []]], 4)), [[[]], 4])
if N == 1: check('variant packet 1', solve(*[[[True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]]], 0]), [[[11, 13], [12], [11, 13], [12]], 12])
if N == 2: check('variant packet 2', solve(*[[[True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]]], 0]), [[[11, 13], [12], [11, 13], [12], [11, 13], [12]], 12])
if N == 3: check('variant packet 3', solve(*[[[True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]]], 0]), [[[11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12]], 12])
if N == 4: check('variant packet 4', solve(*[[[True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]]], 0]), [[[11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12]], 12])
if N == 5: check('variant packet 5', solve(*[[[True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]]], 0]), [[[11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12]], 12])
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 |
|---|---|---|---|
| oracle 1 | [[[13, 11], [12]], 12] | [[[11, 13], [12]], 12] | Failed |
| oracle 2 | [[[2], [3]], 3] | [[[2], [3]], 3] | Passed |
| oracle 3 | [[[], [5]], 5] | [[[], [5]], 5] | Passed |
| oracle 4 | [[], 3] | [[], 3] | Passed |
| oracle 5 | [[[4, 3]], 4] | [[[3, 4]], 4] | Failed |
| oracle 6 | [[[-2, -4]], -2] | [[[-4, -2]], -2] | Failed |
| oracle 7 | [[[]], 4] | [[[]], 4] | Passed |
| variant packet 1 | [[[13, 11], [12], [13, 11], [12]], 12] | [[[11, 13], [12], [11, 13], [12]], 12] | Failed |
SHA-256 / 68b9b25b4652451d4035e413b655dd08ed0cd7daa70aa1d2075c3c75a81b401a
2 / The unsuccessful fix
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(partitions, initial):
state=initial
out=[]
for reset,seed,residuals in partitions:
if reset:
state=seed
section=[]
for residual in residuals:
state+=residual
section.append(seed)
out.append(section)
return [out,state]
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('oracle 1', solve(*([[True, 10, [1, 2]], [False, 99, [-1]]], 0)), [[[11, 13], [12]], 12])
check('oracle 2', solve(*([[True, 0, [2]], [False, 5, [1]]], 7)), [[[2], [3]], 3])
check('oracle 3', solve(*([[True, 4, []], [False, 0, [1]]], 0)), [[[], [5]], 5])
check('oracle 4', solve(*([], 3)), [[], 3])
check('oracle 5', solve(*([[False, 99, [1, 1]]], 2)), [[[3, 4]], 4])
check('oracle 6', solve(*([[True, -3, [-1, 2]]], 5)), [[[-4, -2]], -2])
check('oracle 7', solve(*([[False, 0, []]], 4)), [[[]], 4])
if N == 1: check('variant packet 1', solve(*[[[True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]]], 0]), [[[11, 13], [12], [11, 13], [12]], 12])
if N == 2: check('variant packet 2', solve(*[[[True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]]], 0]), [[[11, 13], [12], [11, 13], [12], [11, 13], [12]], 12])
if N == 3: check('variant packet 3', solve(*[[[True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]]], 0]), [[[11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12]], 12])
if N == 4: check('variant packet 4', solve(*[[[True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]]], 0]), [[[11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12]], 12])
if N == 5: check('variant packet 5', solve(*[[[True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]]], 0]), [[[11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12]], 12])
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 |
|---|---|---|---|
| oracle 1 | [[[10, 10], [99]], 12] | [[[11, 13], [12]], 12] | Failed |
| oracle 2 | [[[0], [5]], 3] | [[[2], [3]], 3] | Failed |
| oracle 3 | [[[], [0]], 5] | [[[], [5]], 5] | Failed |
| oracle 4 | [[], 3] | [[], 3] | Passed |
| oracle 5 | [[[99, 99]], 4] | [[[3, 4]], 4] | Failed |
| oracle 6 | [[[-3, -3]], -2] | [[[-4, -2]], -2] | Failed |
| oracle 7 | [[[]], 4] | [[[]], 4] | Passed |
| variant packet 1 | [[[10, 10], [99], [10, 10], [99]], 12] | [[[11, 13], [12], [11, 13], [12]], 12] | Failed |
SHA-256 / 3d1fb569dd673b246887a4dbf43846ee5d75e50519a3155454e76f20c00ba0b5
3 / The verified repair
Exit 0"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(partitions, initial):
state=initial
out=[]
for reset,seed,residuals in partitions:
if reset:
state=seed
section=[]
for residual in residuals:
state+=residual
section.append(state)
out.append(section)
return [out,state]
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('oracle 1', solve(*([[True, 10, [1, 2]], [False, 99, [-1]]], 0)), [[[11, 13], [12]], 12])
check('oracle 2', solve(*([[True, 0, [2]], [False, 5, [1]]], 7)), [[[2], [3]], 3])
check('oracle 3', solve(*([[True, 4, []], [False, 0, [1]]], 0)), [[[], [5]], 5])
check('oracle 4', solve(*([], 3)), [[], 3])
check('oracle 5', solve(*([[False, 99, [1, 1]]], 2)), [[[3, 4]], 4])
check('oracle 6', solve(*([[True, -3, [-1, 2]]], 5)), [[[-4, -2]], -2])
check('oracle 7', solve(*([[False, 0, []]], 4)), [[[]], 4])
if N == 1: check('variant packet 1', solve(*[[[True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]]], 0]), [[[11, 13], [12], [11, 13], [12]], 12])
if N == 2: check('variant packet 2', solve(*[[[True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]]], 0]), [[[11, 13], [12], [11, 13], [12], [11, 13], [12]], 12])
if N == 3: check('variant packet 3', solve(*[[[True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]]], 0]), [[[11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12]], 12])
if N == 4: check('variant packet 4', solve(*[[[True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]]], 0]), [[[11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12]], 12])
if N == 5: check('variant packet 5', solve(*[[[True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]], [True, 10, [1, 2]], [False, 99, [-1]]], 0]), [[[11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12], [11, 13], [12]], 12])
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 |
|---|---|---|---|
| oracle 1 | [[[11, 13], [12]], 12] | [[[11, 13], [12]], 12] | Passed |
| oracle 2 | [[[2], [3]], 3] | [[[2], [3]], 3] | Passed |
| oracle 3 | [[[], [5]], 5] | [[[], [5]], 5] | Passed |
| oracle 4 | [[], 3] | [[], 3] | Passed |
| oracle 5 | [[[3, 4]], 4] | [[[3, 4]], 4] | Passed |
| oracle 6 | [[[-4, -2]], -2] | [[[-4, -2]], -2] | Passed |
| oracle 7 | [[[]], 4] | [[[]], 4] | Passed |
| variant packet 1 | [[[11, 13], [12], [11, 13], [12]], 12] | [[[11, 13], [12], [11, 13], [12]], 12] | Passed |
SHA-256 / 9db0e32dd0a9f4b2466e8b228582dfc277b2739ac65d890b0d6b6e869ad85988
Verification & scope
Stipulated finite model; no claim of hardware timing or full file-format conformance. 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-29T14:45:06.782623+00:00.
Case digest / c2e8ad9deb5ff0b88af18be7cad025f2bbd040ee49baa03053373a3cb66d3b07