This is a seed-independent 547-word BBBQ reducer that computes the four exact floor means of the evaluator-controlled interleaved lanes. It stores each lane as a complement modulo 2^64−408, which is exactly divisible by 1,337, and uses an unsigned comparison to choose between direct C−x and wrapped M−(x−C) updates. Its packed radix-1,337 private state is initialized with four digits equal to 1,337 and decremented on the rarer no-wrap events, so its terminal digits are the exact wrap counts while costly large counter changes execute much less often; a balanced shared 987/8/1 decoder reconstructs and emits the four answers under the [2,1,1,1] queue peak. The payload is the complete 2,188-byte raw little-endian u32 instruction stream encoded strictly in program_base64 with a matching SHA-256, and it contains no seed.