FA-50273 / PCM sample encoding / Member archive

Pcm common trailing zero shift: shared divisibility · case 03

One divisible PCM sample permits destructive shifting of another sample.

Member previewVariant 3 · 3 implementations · 8 checks per implementation

Case contract

Losslessly factor the largest capped common trailing-zero count from signed PCM samples; zero samples do not constrain the count and all-silence blocks canonically use zero.

Why this case matters

Offline PCM interchange uses these exact bounded packet and sample representation decisions.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
oracle 1	`[3, [1, -2, 0]]`	`[2, [2, -3, 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.