zk-SNARKs are zero-knowledge succinct non-interactive arguments of knowledge that allow a prover to convince a verifier of a statement without revealing details. They work by converting a function and its inputs/outputs into a quadratic arithmetic program (QAP) represented as polynomials. This allows a verifier to efficiently check a proof generated by the prover using techniques like Lagrange int
![【暗号通貨輪読会#14】confidential transaction](https://cdn-ak-scissors.b.st-hatena.com/image/square/ee334de33dd075ec84fd175ed91dacf720f32158/height=288;version=1;width=512/https%3A%2F%2Fcdn.slidesharecdn.com%2Fss_thumbnails%2F14confidentialtransaction-171219113600-thumbnail.jpg%3Fwidth%3D640%26height%3D640%26fit%3Dbounds)