claimroutine
Eight controlled additions flip parity
Eight controlled additions flip a parity when the control is 1
arithmetic core of the packed XOR step
Statement (paper)
For a Boolean control and arbitrary integers , the eight operations , performed in the displayed order with every predicate evaluated on the current values, do nothing if , and if they produce , where also for negative . Thus the parity of is flipped precisely when , both quotients under division by two are preserved, the auxiliary integer is restored, and each coordinate is displaced from its initial value by at most four at every stage.
In plain English
For a Boolean control and integers , the eight prescribed controlled additions, applied in order with predicates evaluated on current values, do nothing when . When they change to (flipping its parity, with even for negative ) and leave unchanged.
Why it's here
This is the arithmetic core of the XOR step: it shows the eight additions act as a conditional parity flip, preserving both quotients by two and restoring the auxiliary integer , with every coordinate moving by at most four at any stage. The next claim uses this to compare the packed cyclic-shift implementation with the ideal XOR away from a bad set.
Classified routine:
A direct case check over the parity of u and the control bit c, a small bookkeeping verification of a specific gadget (eight controlled additions) built for the paper's packed XOR step; it relies on no deep known result.
Uses
Nothing else in the paper
Used by
Sources
PaperOpen
- Section
- §5.2 Packed changes of selected address bits
- Page
- —
- Label
—- Line
sections/05-layers.tex:252
Leannot aligned
Phase 2 aligns this node to a Lean declaration.