Packed homomorphic encryption evaluates slotwise operations in parallel, but nonlocal communication is realized by cyclic rotations whose cost depends on the physical slot layout. We study ordered prefix computation on elements of an associative, possibly noncommutative monoid stored in bit-reversed order. A direct transported-predecessor scan uses rotations because one logical shift decomposes into several cyclic displacement classes. We introduce a replicated-aggregate invariant: every slot of an aligned logical block stores the same complete block aggregate. Since these copies are semantically interchangeable, one global rotation per level supplies each slot with a valid sibling aggregate, without reaching the exact logical partner. The resulting inclusive or exclusive scan uses rotations, depth , two live state vectors, and at most packed monoid compositions. In a model where all non-routing operations are slotwise and every cyclic rotation invocation is counted, these bounds are exact: . Equality is rigid: the offsets contain exactly one representative of each -adic valuation. With at most directly keyed offsets, we prove a product lower bound and an exact frontier whenever divides . We instantiate the exclusive scan for radix carry and borrow in bit-reversed \CKKS slots, avoiding layout restoration and the final logical-predecessor shift. In our implementation at , the replicated scan reduces the direct bit-reversed baseline from to rotations, lowers evaluation-key storage by , lowers peak heap usage by , and improves isolated scan latency by . In a depth- downstream pipeline, retaining six additional modulus levels avoids one bootstrap and gives a mean paired speedup of with confidence interval .

生成讲解博客的中文版本

生成AI智能校验的中文版本