arnaucube/Nova
1
0
Fork 0
mirror of https://github.com/arnaucube/Nova.git synced 2026-01-11 08:31:29 +01:00
Code Issues Projects Releases Wiki Activity
110 Commits 2 Branches 0 Tags
faf28e71cd2075ce38cbb84eb60af198dae51bf8
Commit Graph

110 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Srinath Setty
faf28e71cd update version (#108) 2022-08-16 11:51:23 -07:00
Srinath Setty
ccc6ccd4c7 Support for arbitrary arity for step circuit's IO (#107) 
* support for arbitrary arity for F

* revive MinRoot example

* revive tests

* revive ecdsa

* remove unused code

* use None instead of Some(1u32)

* revive benches

* fix clippy warning
 2022-08-16 11:35:17 -07:00
Srinath Setty
0a7cbf925f integrate with neptune's sponge (#105) 
* integrate with neptune's sponge

* fix clippy warning

* add checks to ensure at most one squeeze

* add checks to ensure at most one squeeze
 2022-08-11 19:03:44 -07:00
Srinath Setty
ddd90f7373 Update crate versions (#104) 
* update crates to their latest version

* use latest pasta-msm
 2022-08-10 10:57:43 -07:00
Srinath Setty
c7e8782f11 pad two IPA instances to the same size when folding (#103) 2022-07-27 22:21:47 -07:00
Srinath Setty
a56f823ace optimize the non-native arithmetic and hashing costs by using 4 limbs instead of 8 (#102) 2022-07-27 17:09:49 -07:00
Srinath Setty
111abcab38 optimize MinRoot constraint system (#101) 
* optimize MinRoot constraint system to not allocate unneeded advice variables

run with multiple MinRoot iterations per Nova step in a loop

* fix clippy warnings
 2022-07-27 15:48:03 -07:00
Srinath Setty
06192ac3d4 Optimizations (#100) 
* avoid creating commitments to zero vectors

* reduce the number of constraints in each iteration from 4 to 3
 2022-07-27 14:07:44 -07:00
Srinath Setty
3dc26fd7e4 Simplifications in Nova's RO (#98) 
* rename methods for better clarity

* rename

* Bump version
 2022-07-25 12:22:41 -07:00
Srinath Setty
c6fa4d44eb Fix benches so it varies the number of constraints in the augmented circuit in powers of 2 (#97) 
* vary the number of constraints in the step circuit

* use a different starting state
 2022-07-21 15:00:01 -07:00
Srinath Setty
5d5b9aa244 Fix bench name (#95) 
* fix name

* Add 14
 2022-07-20 16:05:43 -07:00
Srinath Setty
7d54d992a4 update benches (#94) 2022-07-20 14:31:24 -07:00
Srinath Setty
87a5b07bdd name changes for improved clarity (#93) 2022-07-20 14:09:25 -07:00
Arthur Greef
ed915b2540 ecdsa signature proof (#92) 
* ecdsa signature proof

* use the library-provided default circuit

* small reorg

Co-authored-by: Srinath Setty <srinath@microsoft.com>
 2022-07-19 13:06:38 -07:00
Srinath Setty
35cb03f977 reorganize traits into a module; cut boilerplate code (#91) 
use a default implementation for step circuit
 2022-07-14 16:15:45 -07:00
Srinath Setty
704d48b528 update to the latest pasta-msm crate (#89) 2022-07-13 17:00:16 -07:00
Srinath Setty
e373f4633d edits to address clippy with the latest Rust (#90) 2022-07-13 14:46:13 -07:00
Srinath Setty
a04566bb81 MinRoot example improvements (#88) 
* support multiple iterations of MinRoot per Nova step

* small edits to println

* fix declaration
 2022-07-11 13:00:42 -07:00
Srinath Setty
ff40d17cc4 Nova-based VDF using MinRoot as an example (#86) 
* add the MinRoot VDF example

* optimize a bit

* optimization and cleanup

* clippy

* add examples to CI

* use inbuilt pow_vartime
 2022-07-07 18:30:43 -07:00
Srinath Setty
63f08c0e4a Support non-determinism with a minimal API (#85) 
* support non-determinism with small changes to the interface

* update benches to use the new API

* add an example that exercises non-deterministic advice at each step of recursion

* tiny rename

* Address clippy; update version
 2022-07-07 12:17:56 -07:00
Srinath Setty
6667d2f8b5 Abstract the RO used in the circuit with traits (#84) 
* cleanup RO usage inside the circuit: use traits

* Add a note

* rename types for clarity
 2022-07-05 16:24:12 -07:00
Srinath Setty
0863a732ff Add asserts for constraint count (#83) 
* Add asserts for constraint count

* switch to Standard strength
 2022-07-05 14:50:17 -07:00
Srinath Setty
c29030b2d7 Release Candidate (#82) 
* update version and README

* move tests to bellperson adapter and remove tests folder; make bellperson adapter private
 2022-07-01 16:03:19 -07:00
Srinath Setty
0ff2e57bfa Spartan variant with an IPA-based polynomial commitment scheme for compressing IVC proofs (#80) 
* cleanup code

* compiles

* additional plumbing

* add padding

* Add missing file

* integrate

* add a separate test

* cleanup

* cleanup

* add checks for outer sum-check

* sum-checks pass

* sum-checks pass

* sum-checks pass

* Add polycommit checks to the end

* switch to pasta_msm

* clippy

* remove int_log

* switch to pasta_curves

* clippy

* clippy

* add a special case for bases.len() = 1

* use naive MSM to avoid SIGFE error for smaller MSMs

* add rayon parallelism to naive MSM

* update comment since we already implement it

* address clippy

* cleanup map and reduce code

* add parallelism to final SNARK creation and verification

* add par

* add par

* add par

* add par

* store padded shapes in the parameters

* Address clippy

* pass padded shape in params

* pass padded shape in params

* cargo fmt

* add par

* add par

* Add par

* cleanup with a reorg

* factor out spartan-based snark into a separate module

* create traits for RelaxedR1CSSNARK

* make CompressedSNARK parameterized by a SNARK satisfying our new trait

* fix benches

* cleanup code

* remove unused

* move code to Spartan-based SNARK

* make unused function private

* rename IPA types for clarity

* cleanup

* return error types; rename r_j to r_i

* fix duplicate code
 2022-07-01 15:53:00 -07:00
iontzialla
81b12232fe Add benches (#79) 
* add benches

* fix error

* put snark in a black_box when benchmarking verification time

* fix error in benches
 2022-06-14 12:32:44 -07:00
iontzialla
bf35556b90 Complete addition: handle addition of equal numbers and addition of negation (#78) 
* make addition complete. test addition corner cases. optimizations

* optimization and comment

* fix errors

* all tests pass
 2022-06-09 11:22:15 -07:00
Srinath Setty
a7da105677 IVC proof compression APIs and implementation (#77) 
We currently implement a constant-factor compression, but in the future we will provide an exponential reduction in proof sizes
 2022-05-27 01:05:01 -07:00
Srinath Setty
8308c29f94 use pasta_msm crate for MSM (#75) 
* use pasta_msm crate for MSM

* add repr-c to pasta_curves

* add +stable

* update pasta-msm version
 2022-05-26 17:27:19 +05:30
Srinath Setty
0154358469 Verifier's checks (#73) 
* begin adding verification checks

* add verifier checks

* remove unnecessary dead_code
 2022-05-18 15:42:02 +05:30
Srinath Setty
b080bac949 Update README.md (#72) 2022-05-18 09:03:24 +05:30
Srinath Setty
4970826f0f small cleanup (#71) 2022-05-18 08:23:07 +05:30
Samuel Burnham
25cd5ec279 Fix Wasm support (#64) 
* Fix dependencies

* Replace rug with num-bigint
 2022-05-17 18:51:48 +05:30
Srinath Setty
dbe8837991 Update README.md (#70) 
* Update README.md

* Update README.md
 2022-05-17 18:51:31 +05:30
Srinath Setty
188a7c5640 Add a non-trivial step circuit (#66) 2022-05-17 06:08:42 -07:00
Srinath Setty
1fd4eee2b6 Recursion implementation (#65) 
* recursion attempt

* address clippy

* initialize the running instance and witness of the primary correctly

* add asserts for debugging

* fix a bug in AllocatedPoint

* add debug statements

* fix an issue with how we inputize hashes; remove debug statements

* rename

* cleanup

* speedup tests

* require step_circuit implementors to provide a way to execute step computation
 2022-05-17 05:59:29 -07:00
Srinath Setty
4311ad1c1b cleanup trivial (#63) 2022-05-15 06:59:10 -07:00
Srinath Setty
07b3c4289b Recursion APIs (#62) 
* recursion APIs (WIP)

* PublicParams struct and associated new

* fix build

* draft of APIs

* start with tests

* add a test case for the base case of recursion
 2022-05-15 12:05:18 +05:30
Srinath Setty
e8a6e45b3c move StepSNARK to nifs.rs in prep for recursion APIs (#61) 
* move StepSNARK to nifs.rs in prep for recursion APIs

* clippy
 2022-05-14 18:59:42 -07:00
iontzialla
9f7c12dbc5 Base case for second circuit (#60) 
* output the incoming instance as the running instance in one of the circuits

* Make some verifier circuit inputs optional (for base case)
 2022-05-14 07:56:57 -07:00
Srinath Setty
3193d67bce delegate sampling of generators to trait implementors (#59) 2022-05-14 12:16:22 +05:30
Srinath Setty
36d4be2145 take ro_constants as a parameter (#58) 2022-05-14 10:50:10 +05:30
Srinath Setty
6ac9c7706d precompute R1CSShape's digest (#57) 2022-05-13 07:53:21 -07:00
Srinath Setty
fab07689eb remove unneeded tracking and checks (#55) 
* remove unneeded tracking and checks

* remove unused error type
 2022-05-13 14:50:42 +05:30
Srinath Setty
562fa71027 move from rug to num-bigint (#53) 2022-05-13 01:50:37 -07:00
Srinath Setty
677fe23673 Switch RO to use the one in the Group trait (#54) 
* switch to RO in the Group trait

* simplify compression

* absorb IO as bignum for relaxedR1CS
 2022-05-13 01:49:34 -07:00
Srinath Setty
82b7fabd9d absorb running instance separately (for clarity) (#52) 2022-05-12 23:18:53 -07:00
Srinath Setty
706d688a13 add hash(params, U, z0, zi, i) when generating a challenge (#51) 
* add hash(params, U, z0, zi, i) when generating a challenge

* address clippy
 2022-05-12 22:34:12 -07:00
Srinath Setty
ccc6dc3a04 Truncate digest bits (#50) 
* apply a hash function before adding to transcript

* truncate shape_digest into 250 bits

* add missing file

* fix clippy

* cargo fmt
 2022-05-12 22:08:43 -07:00
Srinath Setty
0d53db18e3 implement transcript methods for various types (#49) 
* implement transcript methods for various types

* address clippy

* add shape to transcript
 2022-05-11 23:58:43 -07:00
Srinath Setty
485eb3fac6 fix build (#48) 
* fix build

* switch to stable
 2022-05-10 23:27:27 -07:00