Skip to content

Tags: Guayaba221/gnark

Tags

v0.11.0

Toggle v0.11.0's commit message

Verified

This commit was created on GitHub.com and signed with GitHub’s verified signature.
release: v0.11.0 (Consensys#1272)

* chore: update version

* chore: update CHANGELOG

* chore: update citation

* chore: remove unrelease in changelog

v0.10.0

Toggle v0.10.0's commit message

Verified

This commit was created on GitHub.com and signed with GitHub’s verified signature.
Merge pull request Consensys#1044 from Consensys/feat/plonk_update

Feat/plonk update

v0.9.1

Toggle v0.9.1's commit message

Verified

This commit was created on GitHub.com and signed with GitHub’s verified signature. The key has expired.
Merge pull request from GHSA-7p92-x423-vwj6

* feat: bumped gnark-crypto

* fix: fixed challenge generation

* build: update to gnark-crypto v0.12.1

* fixed: calldataload -> mload

* fix: fixed template (declatration of _mPtr)

* feat: bumped gnark-crypto

* fix: fixed non critical issues

* fix: check number of public inputs

* build: udpate to latest gnark-crypto

---------

Co-authored-by: Gautam Botrel <[email protected]>

v0.9.0

Toggle v0.9.0's commit message

Verified

This commit was created on GitHub.com and signed with GitHub’s verified signature. The key has expired.
fix: assert that the binary decomposition of a variable is less than …

…the modulus (Consensys#835)

The issue was reported by Marcin Kostrzewa @ Reilabs (@kustosz).

* test: add internal regression test pacakge for tracking filed bugs

* test: add test for reproducing non-unique binary decomposition

* refactor: make comparison against a constant bound public

Even though the method is public this method is not listable as we export
interfaces with smaller method sets. The method can be accessed by implicitly
implementing interface with the method `MustBeLessOrEqCst(aBits
[]frontend.Variable, bound *big.Int, aForDebug frontend.Variable)`.

We use the method for checking in `std/math/bits` package that the binary
decomposition of the bound returned by hint is less than the modulus.

* feat: add option to omit uniqueness check when binary decomposing value

* fix: check that the binary decomposition is unique when nbBits=modlen

* refactor: use bits gadget directly for option control

* docs: describe in documentation alternatives to Cmp and LEQ

* test: add test for math/cmp cases

* feat: add TestEngine checking

* test: reduce binary decomposition length to accomodate tinyfield

* refactor: rename to OmitModulusCheck

* fix: limit decomposition length to fieldbitlen

* feat: allow less than nbBits in constant comparison

* test: update circuit statistics

* feat: allow decomposition length be longer than field length

* Revert "feat: add TestEngine checking"

This reverts commit 8da5d07.

* test: implement constant comparison for test engine

* test: rename file to track issue

v0.9.0-alpha

Toggle v0.9.0-alpha's commit message

Verified

This commit was created on GitHub.com and signed with GitHub’s verified signature. The key has expired.
Merge pull request Consensys#814 from Consensys/develop

v0.9.0 placeholder

v0.8.1

Toggle v0.8.1's commit message

Verified

This commit was created on GitHub.com and signed with GitHub’s verified signature. The key has expired.
Merge pull request Consensys#771 from Consensys/release/v0.8.1

release: v0.8.1

v0.8.0

Toggle v0.8.0's commit message
feat: update gnark version to v0.8.0