Unbounded fan-in OR

Source paper suggests some elaborate argument, but actually we can just negate every bit ($x_i \rightarrow 1-x_i$), multiply them and negate the answer back, so we don't really see what's the point. It is also much faster.

Prefix-or is computed similarly, using running product construction.