Skip to content

Conversation

@DraganLambic
Copy link

@DraganLambic DraganLambic commented May 29, 2025

Xor5 template is optimized. Instead of 4 constraints per bit, only 3 constraints are needed. Xor function is equal to parity check of the sum of inputs. Therefore, the value of least significant bit of sum of inputs is equal to the output of Xor.

Xor5 template is optimized. Instead of 4 constraints per bit, only 3 constraints are needed.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant