Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add bitwise operations #10

Open
effectfully opened this issue Jul 3, 2019 · 2 comments
Open

Add bitwise operations #10

effectfully opened this issue Jul 3, 2019 · 2 comments

Comments

@effectfully
Copy link
Owner

All of them.

I assume we want to use the ones' complement representation, but I'll check this just to be sure.

@effectfully
Copy link
Owner Author

gosh it's a rabbit hole... So little-endian is "the least significant bit goes first", but that "first" can arbitrarily mean either "leftmost" or "rightmost" (both orderings are used).

So I'll just use the most common representation: "the least significant bit is the rightmost one" without talking about endianess.

I'll also use two's complement, because it also seems to be the most common thing

@effectfully
Copy link
Owner Author

It actually makes sense to have another type of variables: unpacked field elements (i.e. ones in binary form). This is because we do not want to unpack elements, perform an operation and pack everything back downstream, because we will want to perform several bitwise operations in a row.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant