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.

Sign up for GitHub

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

fix typo: correct 'rquirements' to 'requirements' and format 'e.g.' #119

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

fix typo: correct 'rquirements' to 'requirements' and format 'e.g.' #119

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion notes/constraints.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -35,7 +35,7 @@ And how do we verify a constraint ? (in the prover)

Data you want to constrain is commited to as the evaluations of polynomials over a certain FFT friendly subset of a field. Some coset of a multiplicative subgroup of the units of a field.

We have some fixed size rquirements, e.G. the cosets all have size 2^22. This is realistic for say HUB and RAM.
We have some fixed size requirements, e.g., the cosets all have size 2^22. This is realistic for say HUB and RAM.

What we prove on chain is the satisfaction of a SNARK circuit (of Plonk type) with fixed sizes that verifies a proof of our type (general huge constraint system.) It's a proof of a proof of a proof of a... (maybe 3 or 4 times). With every recursion step reduce size by a factor of sqrt(n). Vortex.

Expand Down