Skip to content

Zero Knowledge Proofs and how they can be implemented in Quorum

Notifications You must be signed in to change notification settings

mandlamag/zero-knowledge-proofs

 
 

Repository files navigation

zero-knowledge-proofs

Zero Knowledge Proofs and how they can be implemented in Quorum

This is a SNARK implementation using libsnark for the following:

ZkPoK{ (R1, R2, R3): Hi = sha256(Ri) and R3 = R1 + R2 }

Read: given H1, H2, H3, prove you know R1, R2, R3 such that R1 is the preimage of H1, R2 is the preimage of H2, R3 is the preimage of H3, and R3 is R1 + R2.

This is an implementation and benchmark of the "Receive" zk-SNARK in the Confidential Transaction scheme from this article: https://media.consensys.net/introduction-to-zksnarks-with-examples-3283b554fc3b.

Code based on https://github.com/ebfull/lightning_circuit.

Some more background here: https://www.youtube.com/watch?v=0KhFhvdEpoA

howto

Required packages

  • On Ubuntu 16.04 LTS:

      `$ sudo apt-get install build-essential cmake git libgmp3-dev libprocps4-dev python-markdown libboost-all-dev libssl-dev`
    
  • On Ubuntu 14.04 LTS:

      `$ sudo apt-get install build-essential cmake git libgmp3-dev libprocps3-dev python-markdown libboost-all-dev libssl-dev`
    

Installation

./get-libsnark && make

npm install

Running

node index.js startBalance=10000

First select

  1. Single payment in and single payment out
  2. Multiple payments in and multiple payments out

Follow the prompts.

  1. Generate a key pair
  2. Generate a proof (single or multiple)
  3. Verify proof
  4. Quit

Generate a new key pair

This creates a new proving key and verification key from the circuit. They are saved to the files:

  • provingKey-single or provingKey-multi
  • verificationKey-single or verificationKey-multi

Generate a payment proof

This generates a proof using the proving key as well as the following values:

  • start balance
  • incoming payment/s
  • outgoing payment/s
  • end balance (start balance + incoming - outgoing)

The proof is:

  • start balance + incoming payments = end balance + outgoing payments

Verify payment proof

Verifies the above proofs

License

Copyright (C) 2017 The Quorum Zero Knowledge Proof Authors.

Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at

http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.

About

Zero Knowledge Proofs and how they can be implemented in Quorum

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C++ 75.4%
  • JavaScript 22.1%
  • Makefile 1.8%
  • Shell 0.7%