FA-50111 / PCM sample encoding / Open access

Pcm seeded adaptive block: block concatenation · case 01

Later independently seeded blocks replace earlier PCM.

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

ROOT CAUSE

Later independently seeded blocks replace earlier PCM.

VERIFIED REPAIR

Use the stated conversion contract at block concatenation.

Unsuccessful approach: Reversing within blocks changes temporal order while preserving block order.

Case contract

Decode independent seeded differential PCM blocks; seed is the first presented sample and declared sample count includes it, excluding padded residuals.

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(blocks):
    out=[]
    for seed,deltas,declared in blocks:
        decoded=[seed]
        previous=seed
        for delta in deltas:
            previous+=delta
            decoded.append(previous)
        out=decoded[:max(0,declared)]
    return out
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('oracle 1', solve(*([[10, [1, 2], 3], [2, [-1, 3], 3]],)), [10, 11, 13, 2, 1, 4])
check('oracle 2', solve(*([[7, [1, 1], 1]],)), [7])
check('oracle 3', solve(*([[4, [], 0], [5, [], 1]],)), [5])
check('oracle 4', solve(*([],)), [])
check('oracle 5', solve(*([[-3, [2, -2], 2]],)), [-3, -1])
check('oracle 6', solve(*([[1, [1, 1, 1], 8]],)), [1, 2, 3, 4])
check('oracle 7', solve(*([[9, [1], 0], [3, [2], 2]],)), [3, 5])
if N == 1: check('variant packet 1', solve(*[[[10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3]]]), [10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4])
if N == 2: check('variant packet 2', solve(*[[[10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3]]]), [10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4])
if N == 3: check('variant packet 3', solve(*[[[10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3]]]), [10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4])
if N == 4: check('variant packet 4', solve(*[[[10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3]]]), [10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4])
if N == 5: check('variant packet 5', solve(*[[[10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3]]]), [10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4])
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	`[2, 1, 4]`	`[10, 11, 13, 2, 1, 4]`	Failed
oracle 2	`[7]`	`[7]`	Passed
oracle 3	`[5]`	`[5]`	Passed
oracle 4	`[]`	`[]`	Passed
oracle 5	`[-3, -1]`	`[-3, -1]`	Passed
oracle 6	`[1, 2, 3, 4]`	`[1, 2, 3, 4]`	Passed
oracle 7	`[3, 5]`	`[3, 5]`	Passed
variant packet 1	`[2, 1, 4]`	`[10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4]`	Failed

SHA-256 / a30b3796e877fa79db5e78491f8a92f065e90d7fad9d5a906ff4cff29b5188d3

2 / The unsuccessful fix

Exit 1

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

N = 1
observations = []
def solve(blocks):
    out=[]
    for seed,deltas,declared in blocks:
        decoded=[seed]
        previous=seed
        for delta in deltas:
            previous+=delta
            decoded.append(previous)
        out.extend(reversed(decoded[:max(0,declared)]))
    return out
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('oracle 1', solve(*([[10, [1, 2], 3], [2, [-1, 3], 3]],)), [10, 11, 13, 2, 1, 4])
check('oracle 2', solve(*([[7, [1, 1], 1]],)), [7])
check('oracle 3', solve(*([[4, [], 0], [5, [], 1]],)), [5])
check('oracle 4', solve(*([],)), [])
check('oracle 5', solve(*([[-3, [2, -2], 2]],)), [-3, -1])
check('oracle 6', solve(*([[1, [1, 1, 1], 8]],)), [1, 2, 3, 4])
check('oracle 7', solve(*([[9, [1], 0], [3, [2], 2]],)), [3, 5])
if N == 1: check('variant packet 1', solve(*[[[10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3]]]), [10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4])
if N == 2: check('variant packet 2', solve(*[[[10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3]]]), [10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4])
if N == 3: check('variant packet 3', solve(*[[[10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3]]]), [10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4])
if N == 4: check('variant packet 4', solve(*[[[10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3]]]), [10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4])
if N == 5: check('variant packet 5', solve(*[[[10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3]]]), [10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4])
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, 10, 4, 1, 2]`	`[10, 11, 13, 2, 1, 4]`	Failed
oracle 2	`[7]`	`[7]`	Passed
oracle 3	`[5]`	`[5]`	Passed
oracle 4	`[]`	`[]`	Passed
oracle 5	`[-1, -3]`	`[-3, -1]`	Failed
oracle 6	`[4, 3, 2, 1]`	`[1, 2, 3, 4]`	Failed
oracle 7	`[5, 3]`	`[3, 5]`	Failed
variant packet 1	`[13, 11, 10, 4, 1, 2, 13, 11, 10, 4, 1, 2]`	`[10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4]`	Failed

SHA-256 / 63c7688f27945eb9f710d2aa64266b40b9fd06893d87c04ebd70d54f320fa571

3 / The verified repair

Exit 0

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

N = 1
observations = []
def solve(blocks):
    out=[]
    for seed,deltas,declared in blocks:
        decoded=[seed]
        previous=seed
        for delta in deltas:
            previous+=delta
            decoded.append(previous)
        out.extend(decoded[:max(0,declared)])
    return out
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('oracle 1', solve(*([[10, [1, 2], 3], [2, [-1, 3], 3]],)), [10, 11, 13, 2, 1, 4])
check('oracle 2', solve(*([[7, [1, 1], 1]],)), [7])
check('oracle 3', solve(*([[4, [], 0], [5, [], 1]],)), [5])
check('oracle 4', solve(*([],)), [])
check('oracle 5', solve(*([[-3, [2, -2], 2]],)), [-3, -1])
check('oracle 6', solve(*([[1, [1, 1, 1], 8]],)), [1, 2, 3, 4])
check('oracle 7', solve(*([[9, [1], 0], [3, [2], 2]],)), [3, 5])
if N == 1: check('variant packet 1', solve(*[[[10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3]]]), [10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4])
if N == 2: check('variant packet 2', solve(*[[[10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3]]]), [10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4])
if N == 3: check('variant packet 3', solve(*[[[10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3]]]), [10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4])
if N == 4: check('variant packet 4', solve(*[[[10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3]]]), [10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4])
if N == 5: check('variant packet 5', solve(*[[[10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3], [10, [1, 2], 3], [2, [-1, 3], 3]]]), [10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4])
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, 11, 13, 2, 1, 4]`	`[10, 11, 13, 2, 1, 4]`	Passed
oracle 2	`[7]`	`[7]`	Passed
oracle 3	`[5]`	`[5]`	Passed
oracle 4	`[]`	`[]`	Passed
oracle 5	`[-3, -1]`	`[-3, -1]`	Passed
oracle 6	`[1, 2, 3, 4]`	`[1, 2, 3, 4]`	Passed
oracle 7	`[3, 5]`	`[3, 5]`	Passed
variant packet 1	`[10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4]`	`[10, 11, 13, 2, 1, 4, 10, 11, 13, 2, 1, 4]`	Passed

SHA-256 / 21fba3d870c926d5c6de9acd94c7a94592f15e69fbd460b8b605c9c21a6da86c

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.110410+00:00.

Case digest / aa4df7ba4804ab606e27b0caefb3937379ad4226919c416e754c544e6250dc19