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
|
24b4cf672e
|
minimal clean & update tests
|
5 years ago |
arnaucube
|
b379981087
|
add circuit compiler equals(a, b) syntax, complete flow working well (from compiler to verification)
|
5 years ago |
arnaucube
|
7d1d390a81
|
fixed full flow, now works, need to update circuit parser&compiler, and clean the code
|
5 years ago |
arnaucube
|
e0f427095e
|
add private & public inputs wrapper
|
5 years ago |
arnaucube
|
7d0c2ad53c
|
fixing Z(x), VkIC, Vkz, piH calculations
|
5 years ago |
arnaucube
|
6ac73415ab
|
add rho's for proof keys and verification keys calculation, Vk.IC, add alphas input soundness when generating trusted setup
|
5 years ago |
arnaucube
|
a7454213a0
|
circuit output in proof.PublicSignals for proof verification
|
5 years ago |
arnaucube
|
33de628a91
|
cli
|
5 years ago |
arnaucube
|
1375596a74
|
snark.Utils packed
|
5 years ago |
arnaucube
|
aefb298bb0
|
circuit CalculateWitness, added - & / in GenerateR1CS(), added doc
|
5 years ago |
arnaucube
|
0806af6b80
|
flat circuit code to R1CS working
|
5 years ago |
arnaucube
|
a239ffe221
|
circuit parser (wip)
|
6 years ago |
arnaucube
|
d42dffff22
|
starting circuitcompiler, lexer and parser (simple version)
|
6 years ago |