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

Carry around bounds on variables #26

Open
morganthomas opened this issue Sep 27, 2022 · 1 comment
Open

Carry around bounds on variables #26

morganthomas opened this issue Sep 27, 2022 · 1 comment

Comments

@morganthomas
Copy link
Contributor

morganthomas commented Sep 27, 2022

Attach a bound to each variable at each step of arithmetization up to but not necessarily including the arithmetic circuit, so that in logic circuits to arithmetic circuits, we know how many elements we need in the byte decomposition or if we can get away with a simple range check.

@morganthomas
Copy link
Contributor Author

These upper bounds are fixed (constant) and not required to be tight. We do not have to enforce them in the constraints. The quantifier bounds are variable and enforced. These bounds are for informational purposes so that we know how many bytes we need in a byte decomposition or if a simple range check suffices.

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