Wallace trees are designs that [emphasize] contain components that perform this action. The Model K was devised by George Stibitz to showcase a proof of concept for this action. Kogge-Stone and Brent-Kung are examples of architectures that speed up this action. Those architectures introduce the logic vectors P and G to “look ahead” parts of this action and are significantly faster than the (*) “ripple” (-5[1])method. Two components that perform this operation are prefixed “half-” and (10[1])“full-” depending on the existence of a (-5[1])carry signal. The XOR (“X-or”) logic gate is equivalent to performing this action modulo (10[2])2. The (10[1])binary form of this action yields zero if both inputs are one. For 10 points, name this operation exemplified by “1 + 1 = 2.” ■END■