 mottla
|
023d661571
|
more efficient matrix transpose
|
5 years ago |
|
mottla
|
0096fbcaff
|
Preparing Pull Request
|
5 years ago |
|
mottla
|
7aaf0527e4
|
new variable renaming logic
new renaming logic preparations
new renaming logic preparations
|
5 years ago |
|
mottla
|
1ea0dbf32c
|
optimizing R1CS representation
extending parser
|
5 years ago |
|
mottla
|
de0e081494
|
reducing multiplication gates with constants
|
5 years ago |
|
mottla
|
705e500a5d
|
-initial commit,
-extending flat code compiler to a more general compiler
-reducing all gates to multiplication gates only in the R1CS description of a program.
|
5 years ago |
 arnaucube
|
de33c12283
|
small update, fix trusted setup ops over Field R
|
5 years ago |
|
arnaucube
|
7d0c2ad53c
|
fixing Z(x), VkIC, Vkz, piH calculations
|
5 years ago |
|
arnaucube
|
33de628a91
|
cli
|
6 years ago |
|
arnaucube
|
1375596a74
|
snark.Utils packed
|
6 years ago |
|
arnaucube
|
aefb298bb0
|
circuit CalculateWitness, added - & / in GenerateR1CS(), added doc
|
6 years ago |
|
arnaucube
|
f555ae4b18
|
snark trusted setup + generate proof + verify proof working. Added test to bn128 pairing
|
6 years ago |
|
arnaucube
|
19f7216d0e
|
e(Vb, piB) == e(piB', g2) proof
|
6 years ago |
|
arnaucube
|
6cd494f36f
|
doing trusted setup
|
6 years ago |
|
arnaucube
|
88c3e98cae
|
polynomial Division, SolPolynomials, DivisorPolynomial
|
6 years ago |
|
arnaucube
|
b1df15a497
|
r1cs to qap over finite field
|
6 years ago |
