Open yangji721 opened 5 years ago
Any zero-knowledge proof system has some language constraints. There are some schemes with languages that sound more flexible than R1CS but all impose vaguely similar constraints.
We're also never doing fresh computations in zero knowledge proofs, but instead merely verifying computations, which improves performance enormously.
I read some documents and demos for usage of libsnark. But they only support tranforming R1CS language into a crypto proof. I was wondering if libsnark support verifying arbitary bounded program. (Load program into memory and check execution, front-end). It is better if there is a demo for it.