Spaces:
Runtime error
Runtime error
File size: 11,075 Bytes
711e9c6 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 |
---
sidebar_position: 5
---
# Tutorial 5: Zero Knowledge Proofs
## Overview
In this tutorial we will go over how to create a zero-knowledge proof (ZKP) and verify it on Bitcoin using sCrypt.
### What are zk-SNARKS?
SNARK (zero-knowledge Succinct Non-interactive ARguments of Knowledge) is a type of ZKP that is amenable for blockchains. The generated proof is “succinct” and “non-interactive”: a proof is only a few hundred bytes and can be verified in constant time and within a few milliseconds, without needing to ask additional questions of the prover. Together, these properties make zk-SNARK especially suitable for blockchains, where on-chain storage and computation can be expensive and senders often go offline after sending a transaction.
A proof is constructed off-chain by a prover who generates the proof using a secret input (often referred to as the "witness") and a public input. The prover can then use this proof as an input for an sCrypt smart contract, which can verify the validity of the proof using a verification key and the public input.

[Credit: altoros](https://www.altoros.com/blog/securing-a-blockchain-with-a-noninteractive-zero-knowledge-proof/)
There are many tools for creating such proofs, [ZoKrates](https://github.com/sCrypt-Inc/zokrates) and [SnarkJS](https://github.com/sCrypt-Inc/snarkjs) are among the most popular.
In this example we will use ZoKrates. It provides a python-like higher-level language for developers to code the computational problem they want to prove.
For a more comprehensive explanation of zk-SNARKS and how they work, we recommend reading [this blog post](https://xiaohuiliu.medium.com/zk-snarks-on-bitcoin-239d96d182bd).
## Install ZoKrates
Run the following command to install [released binaries](https://github.com/sCrypt-Inc/zokrates/releases):
```sh
curl -Ls https://scrypt.io/scripts/setup-zokrates.sh | sh -s -
```
or build from source:
```sh
git clone https://github.com/sCrypt-Inc/zokrates
cd ZoKrates
cargo +nightly build -p zokrates_cli --release
cd target/release
```
## ZoKrates Workflow
### 1. Design a circuit
Create a new ZoKrates file named `factor.zok` with the following content:
```python
// p, q are the factors of n
def main(private field p, private field q, field n) {
assert(p * q == n);
assert(p > 1);
assert(q > 1);
return;
}
```
This simple circuit/program proves one knows a factorization of an integer `n` into two integers, without revealing the factors. The circuit has two private inputs named `p` and `q` and one public input named `n`.
### 2. Compile the circuit
Compile the circuit with the following command:
```sh
zokrates compile -i factor.zok
```
This generates two files that encode the circuit in binary and human-readable format.
### 3. Setup
This generates a proving key and a verification key for this circuit.
```sh
zokrates setup
```
### 4. Calculate a witness
A proof attests that a prover knows some secret/private information that satisfies the original program. This secret information is called witness. In the following example, `7` and `13` are the witnesses, as they are factors of `91`.
```sh
zokrates compute-witness -a 7 13 91
```
A file named `witness` is generated.
### 5. Creating a proof
The following command produces a proof, using both the proving key and the witness:
```sh
zokrates generate-proof
```
The resulting file `proof.json` looks like the following:
```json
{
"scheme": "g16",
"curve": "bn128",
"proof": {
"a": [
"0x0a7ea3ca37865347396645d017c7623431d13103e9107c937d722e5da15f352b",
"0x040c202ba8fa153f84af8dabc2ca40ff534f54efeb3271acc04a70c41afd079b"
],
"b": [
[
"0x0ec1e4faea792762de35dcfd0da0e6859ce491cafad455c334d2c72cb8b24550",
"0x0985ef1d036b41d44376c1d42ff803b7cab9f9d4cf5bd75298e0fab2d109f096"
],
[
"0x265151afd8626b4c72dfefb86bac2b63489423d6cf895ed9fa186548b0b9e3f3",
"0x301f2b356621408e037649d0f5b4ad5f4b2333f58453791cc24f07d5673349bf"
]
],
"c": [
"0x2b75a257d68763100ca11afb3beae511732c1cd1d3f1ce1804cbc0c26043cb6b",
"0x2f80c706b58482eec9e759fce805585595a76c27e37b67af3463414246fbabbd"
]
},
"inputs": [
"0x000000000000000000000000000000000000000000000000000000000000005b"
]
}
```
### 6. Export an sCrypt verifier
Using our version of ZoKrates, we can export a project template, which will contain a verifier for our circuit. Simply run the following command:
```sh
zokrates export-verifier-scrypt
```
This will create a directory named `verifier`, containing the project. Let's set it up. Run the following:
```sh
cd verifier && git init && npm i
```
Now the verifier is ready to be used. In the following section we will go over the code and show how to use it.
### 7. Run the sCrypt Verifier
In the generated project, let's open the file `src/contracts/verifier.ts`. This file contains an sCrypt smart contract, named `Verifier`, which can be unlocked by providing a valid ZK proof.
Under the hood it uses the `SNARK` library from `src/contracts/snark.ts`. This file includes an elliptic curve implementation along with a library that implements pairings over that elliptic curve and lastly the implementation of the proof verification algorithm. In our example the [`BN-256` elliptic curve](https://hackmd.io/@jpw/bn254) is being used along with the [`Groth-16` proof system](https://eprint.iacr.org/2016/260.pdf)..
Let's take a look at the implementation of `Verifier`:
```ts
export class Verifier extends SmartContract {
@prop()
vk: VerifyingKey
@prop()
publicInputs: FixedArray<bigint, typeof N_PUB_INPUTS>,
constructor(
vk: VerifyingKey,
publicInputs: FixedArray<bigint, typeof N_PUB_INPUTS>,
) {
super(...arguments)
this.vk = vk
this.publicInputs = publicInputs
}
@method()
public verifyProof(
proof: Proof
) {
assert(SNARK.verify(this.vk, this.publicInputs, proof))
}
}
```
As we can see, the contract has two properties, namely the verification key and the value(s) of the public inputs to our ZK program.
The contract also has a public method named `verifyProof`. As the name implies it verifies a ZK proof and can be unlocked by a valid one. The proof is passed as a parameter. The method calls the proof verification function:
```ts
SNARK.verify(this.vk, this.publicInputs, proof)
```
The function takes as parameters the verification key, the public inputs and the proof. It's important to note that the proof is cryptographically tied to the verification key and thus must be a proof about the correct ZoKrates program (`factor.zok`).
The generated project will also contain a deployment script `deploy.ts`. Let's take a look at the code:
```ts
async function main() {
await Verifier.compile()
// TODO: Adjust the amount of satoshis locked in the smart contract:
const amount = 100
// TODO: Insert public input values here:
const publicInputs: FixedArray<bigint, typeof N_PUB_INPUTS> = [ 0n ]
let verifier = new Verifier(
prepareVerifyingKey(VERIFYING_KEY_DATA),
publicInputs
)
// Connect to a signer.
await verifier.connect(getDefaultSigner())
// Deploy:
const deployTx = await verifier.deploy(amount)
console.log('Verifier contract deployed: ', deployTx.id)
}
main()
```
We can observe that we need to adjust two things. First, we need to set the amount of satoshis we will lock into the deployed smart contract. The second thing is the public input value, i.e. the product of the secret factors. Let's set it to the value `91`:
```ts
const publicInputs: FixedArray<bigint, typeof N_PUB_INPUTS> = [ 91n ]
```
Note also, that ZoKrates already provided us with the values of the verification key, that we created during the setup phase.
Now, we can build and deploy the contract. Simply run:
```sh
npm run deploy
```
The first time you run the command, it will ask you to fund a testnet address. You can fund it using [our faucet](https://scrypt.io/faucet/).
After a successful run you should see something like the following:
```
Verifier contract deployed: 2396a4e52555cdc29795db281d17de423697bd5cbabbcb756cb14cea8e947235
```
The smart contract is now deployed and can be unlocked using a valid proof, that proves the knowledge of the factors for the integer `91`. You can see [the transaction](https://test.whatsonchain.com/tx/2396a4e52555cdc29795db281d17de423697bd5cbabbcb756cb14cea8e947235) using a block explorer.
Let's call the deployed contract. Let's create a file named `call.ts` with the following content:
```ts
import { DefaultProvider } from 'scrypt-ts'
import { parseProofFile } from './src/util'
import { Verifier } from './src/contracts/verifier'
import { Proof } from './src/contracts/snark'
import { getDefaultSigner } from './tests/utils/helper'
import { PathLike } from 'fs'
export async function call(txId: string, proofPath: PathLike) {
await Verifier.compile()
// Fetch TX via provider and reconstruct contract instance
const provider = new DefaultProvider()
const tx = await provider.getTransaction(txId)
const verifier = Verifier.fromTx(tx, 0)
// Connect signer
await verifier.connect(getDefaultSigner())
// Parse proof.json
const proof: Proof = parseProofFile(proofPath)
// Call verifyProof()
const { tx: callTx } = await verifier.methods.verifyProof(
proof
)
console.log('Verifier contract unlocked: ', callTx.id)
}
(async () => {
await call('2396a4e52555cdc29795db281d17de423697bd5cbabbcb756cb14cea8e947235', '../proof.json')
})()
```
The function `call` will create the contract instance from the passed [TXID](https://wiki.bitcoinsv.io/index.php/TXID) and call its `verifyProof` method. The proof gets parsed from `proof.json`, which we already created in the section above.
Let's unlock our contract by running the following command:
```
npx ts-node call.ts
```
If everything goes as expected, we have now unlocked the verifier smart contract. You'll see an output similar to the following:
```
Verifier contract unlocked: 30127e0c340878d3fb7c165e2d082267eef2c8df79b5cf750896ef565ca7651d
```
Take a look at it using [a block explorer](https://test.whatsonchain.com/tx/30127e0c340878d3fb7c165e2d082267eef2c8df79b5cf750896ef565ca7651d).
## Conclusion
Congratulations! You have successfully created a zk-SNARK and verified it on-chain!
If you want to learn how you can integrate zk-SNARKS into a fully fledged Bitcoin web application, take a look at our free [course](https://academy.scrypt.io/en/courses/Build-a-zkSNARK-based-Battleship-Game-on-Bitcoin-64187ae0d1a6cb859d18d72a), which will teach you how to create a ZK Battleship game.
Additionally, it teaches you to use [snarkjs/circom](https://github.com/sCrypt-Inc/snarkjs).
To know more about ZKP, you can refer to [this awesome list](https://github.com/sCrypt-Inc/awesome-zero-knowledge-proofs).
|