 mottla
|
023d661571
|
more efficient matrix transpose
|
5 years ago |
|
mottla
|
ed4291eb07
|
writing test for proof generation and verification
|
5 years ago |
|
mottla
|
0096fbcaff
|
Preparing Pull Request
|
5 years ago |
|
mottla
|
2fc30d452a
|
multiplication gate reduction via reusing old gates with equivalent behaviour
multiplication gate reduction via reusing old gates with equivalent behaviour
|
5 years ago |
|
mottla
|
621b377127
|
adding test for various programs
changed parse logic. Merged two functions into one, once I noticed that its possible.
cleanup
|
5 years ago |
|
mottla
|
6244b7a2ef
|
improved circuit compiling
improved circuit compiling
still not fully working
improved circuit compiling
still not fully working
|
5 years ago |
|
mottla
|
0820a8129a
|
changing gate structure from entirely
|
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
|
dca8738d6e
|
update cli, update readme
|
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
|
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
|
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)
|
5 years ago |
|
arnaucube
|
d42dffff22
|
starting circuitcompiler, lexer and parser (simple version)
|
6 years ago |
|
arnaucube
|
f555ae4b18
|
snark trusted setup + generate proof + verify proof working. Added test to bn128 pairing
|
6 years ago |
|
arnaucube
|
7aafcfd5f3
|
bn128.NewFqR with field over R. Setup.Pk & .Vk
|
6 years ago |
|
arnaucube
|
439d894ee7
|
key generation for proofs, snark files to the root directory
|
6 years ago |
|
arnaucube
|
19f7216d0e
|
e(Vb, piB) == e(piB', g2) proof
|
6 years ago |
|
arnaucube
|
917eecaee0
|
proofs
|
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 |
|
arnaucube
|
e889b8b7dc
|
bn128 pairing, r1cs to qap
|
6 years ago |
 arnau
|
037c5c0a67
|
Initial commit
|
6 years ago |
