Expandable XOR gate

[Azor_Ahai]

This is over-complicating a simple problem. Since xor is "chainable", a binary tree of xors would be sufficient (much smaller and O(log n) delay)

Like I said before, doesn't make it any more correct. Like I said, if you give it a different name that would suit it better, and the 1input, 1ouput gets the name XOR, it would make it more logical and the names would fit more. You could still use the binary tree.