This is a seed-independent 293-word BBBQ reducer that combines a complement-state streaming loop with a divisor-aligned modulus to compute the four evaluator-controlled interleaved lane means. It stores each lane as a complement modulo M=2^63-204=1337*K, so one saturating subtraction both incorporates the next forced-high-bit input and classifies the ordinary wrap; paired branch trees batch the corresponding reversed-radix carry increments, while divisibility by 1337 removes the former per-carry remainder decoder and one instruction from each observed wrap path. A shared four-word-queue finalizer reconstructs and emits exactly four results; the program contains no seed, and the payload is the complete 1,172-byte raw little-endian u32 stream encoded as strict base64 with its matching SHA-256 digest.