-
Notifications
You must be signed in to change notification settings - Fork 198
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
v0.9.1 #342
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This reverts commit b05a402.
Pedersen hash on stark-curve
* feat: introduction of iop arguments * feat: struct for polyonmial * feat: addition of first version of accRatio function * feat: tests putInLagrangeForm OK * feat: cleaned comments * feat: generation of the support of the identity permutation * feat: factoring the creation of the domain * feat: fixed permutation arg ok, not tested * feat: test ratio ok * feat: test ratio shuffled vectors ok * refactor: putInExpectedFrom has its own function * refactor: built function for polynomials + permutation generation * fix: fixed support identity permutation * feat: test ratio specific permutation ok * fix: slice of *polynomials was accidentally modified * fix: fixed test shuffle specific permutation * feat: removed debug option * feat: comments polynomials format * refactor: changed names ti -> fromLagrang_i * feat: test toCanonical ok * refactor: checkSize takes variadic params * feat: addition of method to compute the total degree * feat: multivariate monomial evaluation * fix: added expo by 0 and 1 * feat: test for monomial * feat: test evaluation multivariate polynomial * feat: func to go from LagrangeCosetBR to expectedform * feat: add quotient.go * feat: computeH ok, no tests yet * feat: tests gen poly vanishing on x^n-1 * fix: fixed mix from<->to lagrange * fix: fixed test quotient * feat: expose multivariate polynomial and associated methods * feat: add quotient.go * feat: add constructor for multivariate polynomial * feat: use new Multivariate polynomial methods * refactor: errors are no longer defined in a specific file * feat: addition of template files * fix: fixed templates * fix: fixed template agian * feat: addition of iop/ files for all curves * feat: monomial methods take pointer receiver * feat: polynomial embeds Form struct now + update the test toLagrange * fix: fixed copyPoly after refactoring removing Info field in polynomial * fix: fixed utils_test * refactor: cleaned conversion (ToLagrange, ToCanonical) * feat: code gen with new conversion api * refactor: cleaned some methods * feat: removed dead code * feat: adapted copy constraint arg instead of generic permutaion * feat: updated templates + code gen * feat: fixed comments * refactor: functions for ratios no longer take pointers * feat: code gen for previous commit * feat: removed dead code * feat: cleaned code gen * refactor: cleaned copy constraints signature * refactor: bigInt like api for changing polynomials representation * refactor: deleted Status in Form struct * feat: code gen (previous commit) * feat: avoid unecessary copy of polynomials * feat: avoid copying polynomials in copy constraints * feat: addition of toLagrangeCoset method (for internal use only) * feat: addition of wrappedPolynomial struct * feat: integration of WrappedPolynomial, test is failing * fix: fixed quotient tests using wrappedPolynomials * feat: code gen for previous commit * fix: removed dead code + corrected imports * refactor: removed utils_test and moved the tests in polynomials_test * refactor: Evaluate -> EvaluateSinglePoint * refactor: cleaned quotient computation * refactor: export monomial * feat: MultivariatePolynomial stores a constant now * feat: MultivariatePolynomial evalutation used the constant * feat: ComputeQuotient takes heterogeneous formats * refactor: cleaned fields of WrappedPolynomial * feat: ratio of domains taken in account for computing the quotient * feat: simplified EvaluatePolynomials * feat: helper for creating WrappedPolynomials * feat: code gen for previous commit * feat: fixed wrapPolynomial * feat: addition of ToRegular,ToBitReverse for WrappedPolynomial * fix: fixed EvaluatePolynomials for multivariate polynomial * fix: fixed error handling in ComputeQuotient * fix: fixed imports in code gne * feat: addition of NewPolynomial(..) function * feat: ratios functions take slices of pointers on polynomials * feat: code gen (previous commit) * feat: addition of Evaluate + blinding for polynomials * fix: fixed polynomial blinding * feat: code gen (previous commit) * fix: removed printings * feat: Evaluate doesn't return an error anymore * feat: Blind panicsif the basis is wrong (simplify the api) * feat: addition of WrapMe method to differentiate from copy * feat: fixed WrapMe() * feat: Size is modified when a polynomial is blinded * feat: addition of field to track the blinded size * fix: fixed BlindedSize in WrapMe * feat: cleaner way to handle multivariate polynomials * feat: removed multivariate polynomials+cleaned quotient * style: cosmetic + add form enum for type-safe switches * refactor: iop, no copy apis * refactor: WrapMe -> NewWrappedPolynomial * refactor: WrappedPoly embeddes Poly * refactor: Copy -> Clone * refactor: Blind -> don't clone for consistency * refactor: make wrappedpolynomial attributes private, ShiftMe() -> Shift() * refactor: add BlindedSize() --------- Co-authored-by: Gautam Botrel <gautam.botrel@gmail.com>
fix: mimc pow7
* perf: iop.Evaluate in parallel * perf: parallel.Execute in iop * perf: a bit more parallelization. need global revisit
perf: gkr improvements
…-challenge-names 304 field agnostic fiat shamir challenge names
* fix: vector marshal methods on pointer type * feat: support for Vector encode / decode in Marshal
* refactor: replace MapHash with ConstHash in sumcheck test vectors * fix: _wip gkr tests to use const hash * refactor: gkr using const hash instead of map hash --------- Co-authored-by: Gautam Botrel <gautam.botrel@gmail.com>
* feat: rudimentary test vectors * rebase: develop * fix: text file permission * feat: multi-input * fix: remove randomizer
* fix: vector marshal methods on pointer type * feat: support for Vector encode / decode in Marshal * refactor: merge Polynomial and WrappedPolynomial * refactor: make Coefficients private and expose Slice access * recfactor: fix constructor with []fr.Element input * remove more apis with unexposed struct * remove more apis with unexposed struct * remove more apis with unexposed struct * refactor: most consistent APIs * style :code cleaning * refactor: resize -> grow * feat: added WriterTo and ReaderFrom to Polynomial * feat: simplified putInExpectedForm * refactor: coeffs of polynomial is no longer a pointer * Revert "refactor: coeffs of polynomial is no longer a pointer" This reverts commit 25425e6. --------- Co-authored-by: Thomas Piellard <thomas.piellard@consensys.net>
This reverts commit 8d294ca.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
No description provided.