mirror of
https://github.com/arnaucube/circom.git
synced 2026-02-07 11:16:42 +01:00
Compare commits
7 Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
1965dd7f78 | ||
|
|
145a3eefeb | ||
|
|
38fa024745 | ||
|
|
5020d3f4ee | ||
|
|
ed63f08aeb | ||
|
|
c2a54e9187 | ||
|
|
3f99f4eb53 |
12
README.md
12
README.md
@@ -1,6 +1,6 @@
|
|||||||
# Circom
|
# Circom
|
||||||
|
|
||||||
Circon is a language designed to write arithmetic circuits that can be used in zero knowledge proofs.
|
Circom is a language designed to write arithmetic circuits that can be used in zero knowledge proofs.
|
||||||
|
|
||||||
In particular, it is designed to work in [zksnarks JavaScript library](https://github.com/iden3/zksnark).
|
In particular, it is designed to work in [zksnarks JavaScript library](https://github.com/iden3/zksnark).
|
||||||
|
|
||||||
@@ -25,7 +25,7 @@ template NAND() {
|
|||||||
component main = NAND();
|
component main = NAND();
|
||||||
```
|
```
|
||||||
|
|
||||||
The language uses mainly JavaScript/C syntax together with 5 extra operators to define the constraints:
|
The language uses mainly JavaScript/C syntax together with 5 extra operators to define the following constraints:
|
||||||
|
|
||||||
`<==` , `==>` : These two operators are used to connect signals and at the same time imply a constraint.
|
`<==` , `==>` : These two operators are used to connect signals and at the same time imply a constraint.
|
||||||
|
|
||||||
@@ -39,7 +39,7 @@ In the above example, both inputs are forced to be binary by adding the constrai
|
|||||||
|
|
||||||
### Compilation the circuit
|
### Compilation the circuit
|
||||||
|
|
||||||
First of all, the compiler must be installed typing:
|
First of all, the compiler must be installed by typing:
|
||||||
|
|
||||||
```
|
```
|
||||||
npm install -g circom
|
npm install -g circom
|
||||||
@@ -48,7 +48,7 @@ npm install -g circom
|
|||||||
The circuit is compiled with the following command:
|
The circuit is compiled with the following command:
|
||||||
|
|
||||||
```
|
```
|
||||||
circom -s mycircuit.circom -o mycircuit.json
|
circom mycircuit.circom -o mycircuit.json
|
||||||
```
|
```
|
||||||
|
|
||||||
The resulting output ( `mycircuit.json` ) can be used in the [zksnarks JavaScript library](https://github.com/iden3/zksnark).
|
The resulting output ( `mycircuit.json` ) can be used in the [zksnarks JavaScript library](https://github.com/iden3/zksnark).
|
||||||
@@ -91,7 +91,7 @@ in === out[0]*2**0 + out[1]*2**1 + out[2]*2**2 + ... + out[n-1]*2**(n-1)
|
|||||||
```
|
```
|
||||||
|
|
||||||
We do this by using a variable `lc1` and adding each signal multiplied by its coefficient.
|
We do this by using a variable `lc1` and adding each signal multiplied by its coefficient.
|
||||||
This variable does not hold a value in compilation time, but it holds a linear combination and it is used in the last constraint:
|
This variable does not hold a value at compilation time, but it holds a linear combination and it is used in the last constraint:
|
||||||
|
|
||||||
```
|
```
|
||||||
lc1 === in;
|
lc1 === in;
|
||||||
@@ -256,7 +256,7 @@ In this example we have shown how to design a top-down circuit with many subcirc
|
|||||||
|
|
||||||
## License
|
## License
|
||||||
|
|
||||||
Circon is part of the iden3 project copyright 2018 0KIMS association and published with GPL-3 license. Please check the COPYING file for more details.
|
Circom is part of the iden3 project copyright 2018 0KIMS association and published with GPL-3 license. Please check the COPYING file for more details.
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|||||||
2
package-lock.json
generated
2
package-lock.json
generated
@@ -1,6 +1,6 @@
|
|||||||
{
|
{
|
||||||
"name": "circom",
|
"name": "circom",
|
||||||
"version": "0.0.20",
|
"version": "0.0.21",
|
||||||
"lockfileVersion": 1,
|
"lockfileVersion": 1,
|
||||||
"requires": true,
|
"requires": true,
|
||||||
"dependencies": {
|
"dependencies": {
|
||||||
|
|||||||
@@ -1,6 +1,6 @@
|
|||||||
{
|
{
|
||||||
"name": "circom",
|
"name": "circom",
|
||||||
"version": "0.0.20",
|
"version": "0.0.21",
|
||||||
"description": "Language to generate logic circuits",
|
"description": "Language to generate logic circuits",
|
||||||
"main": "index.js",
|
"main": "index.js",
|
||||||
"directories": {
|
"directories": {
|
||||||
@@ -38,6 +38,6 @@
|
|||||||
"eslint": "^5.0.1",
|
"eslint": "^5.0.1",
|
||||||
"eslint-plugin-mocha": "^5.0.0",
|
"eslint-plugin-mocha": "^5.0.0",
|
||||||
"jison": "^0.4.18",
|
"jison": "^0.4.18",
|
||||||
"snarkjs": "0.1.6"
|
"snarkjs": "0.1.7"
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -78,6 +78,7 @@ include { return 'include'; }
|
|||||||
\- { return '-'; }
|
\- { return '-'; }
|
||||||
\* { return '*'; }
|
\* { return '*'; }
|
||||||
\/ { return '/'; }
|
\/ { return '/'; }
|
||||||
|
\\ { return '\\'; }
|
||||||
\% { return '%'; }
|
\% { return '%'; }
|
||||||
\^ { return '^'; }
|
\^ { return '^'; }
|
||||||
\& { return '&'; }
|
\& { return '&'; }
|
||||||
@@ -118,7 +119,7 @@ include { return 'include'; }
|
|||||||
%left '<<' '>>'
|
%left '<<' '>>'
|
||||||
|
|
||||||
%left '+' '-'
|
%left '+' '-'
|
||||||
%left '*' '/' '%'
|
%left '*' '/' '\\' '%'
|
||||||
%left '**'
|
%left '**'
|
||||||
%right '++' '--' UMINUS UPLUS '!' '~'
|
%right '++' '--' UMINUS UPLUS '!' '~'
|
||||||
%left '.'
|
%left '.'
|
||||||
@@ -627,7 +628,7 @@ e7
|
|||||||
{
|
{
|
||||||
if (($1.type == "NUMBER") && ($3.type == "NUMBER")) {
|
if (($1.type == "NUMBER") && ($3.type == "NUMBER")) {
|
||||||
let v = $3.value.greater(256) ? 256 : $3.value.value;
|
let v = $3.value.greater(256) ? 256 : $3.value.value;
|
||||||
$$ = {t1ype: "NUMBER", value: $1.value.shiftRight(v).and(__MASK__) };
|
$$ = {type: "NUMBER", value: $1.value.shiftRight(v).and(__MASK__) };
|
||||||
} else {
|
} else {
|
||||||
$$ = { type: "OP", op: ">>", values: [$1, $3] };
|
$$ = { type: "OP", op: ">>", values: [$1, $3] };
|
||||||
}
|
}
|
||||||
@@ -684,6 +685,15 @@ e5
|
|||||||
}
|
}
|
||||||
setLines($$, @1, @3);
|
setLines($$, @1, @3);
|
||||||
}
|
}
|
||||||
|
| e5 '\\' e4
|
||||||
|
{
|
||||||
|
if (($1.type == "NUMBER") && ($3.type == "NUMBER")) {
|
||||||
|
$$ = { type: "NUMBER", value: ($1.value.divide($3.value)) };
|
||||||
|
} else {
|
||||||
|
$$ = { type: "OP", op: "\\", values: [$1, $3] };
|
||||||
|
}
|
||||||
|
setLines($$, @1, @3);
|
||||||
|
}
|
||||||
| e5 '%' e4
|
| e5 '%' e4
|
||||||
{
|
{
|
||||||
if (($1.type == "NUMBER") && ($3.type == "NUMBER")) {
|
if (($1.type == "NUMBER") && ($3.type == "NUMBER")) {
|
||||||
|
|||||||
144
parser/jaz.js
144
parser/jaz.js
File diff suppressed because one or more lines are too long
52
src/exec.js
52
src/exec.js
@@ -80,10 +80,16 @@ function exec(ctx, ast) {
|
|||||||
return execPlusPlusLeft(ctx, ast);
|
return execPlusPlusLeft(ctx, ast);
|
||||||
} else if (ast.op == "/") {
|
} else if (ast.op == "/") {
|
||||||
return execDiv(ctx, ast);
|
return execDiv(ctx, ast);
|
||||||
|
} else if (ast.op == "\\") {
|
||||||
|
return execIDiv(ctx, ast);
|
||||||
} else if (ast.op == "**") {
|
} else if (ast.op == "**") {
|
||||||
return execExp(ctx, ast);
|
return execExp(ctx, ast);
|
||||||
} else if (ast.op == "&") {
|
} else if (ast.op == "&") {
|
||||||
return execBAnd(ctx, ast);
|
return execBAnd(ctx, ast);
|
||||||
|
} else if (ast.op == "&&") {
|
||||||
|
return execAnd(ctx, ast);
|
||||||
|
} else if (ast.op == "||") {
|
||||||
|
return execOr(ctx, ast);
|
||||||
} else if (ast.op == "<<") {
|
} else if (ast.op == "<<") {
|
||||||
return execShl(ctx, ast);
|
return execShl(ctx, ast);
|
||||||
} else if (ast.op == ">>") {
|
} else if (ast.op == ">>") {
|
||||||
@@ -546,6 +552,8 @@ function execPin(ctx, ast) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
function execFor(ctx, ast) {
|
function execFor(ctx, ast) {
|
||||||
|
|
||||||
|
ctx.scopes.push({});
|
||||||
exec(ctx, ast.init);
|
exec(ctx, ast.init);
|
||||||
if (ctx.error) return;
|
if (ctx.error) return;
|
||||||
|
|
||||||
@@ -564,6 +572,7 @@ function execFor(ctx, ast) {
|
|||||||
if (ctx.error) return;
|
if (ctx.error) return;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
ctx.scopes.pop();
|
||||||
}
|
}
|
||||||
|
|
||||||
function execWhile(ctx, ast) {
|
function execWhile(ctx, ast) {
|
||||||
@@ -722,6 +731,34 @@ function execBAnd(ctx, ast) {
|
|||||||
};
|
};
|
||||||
}
|
}
|
||||||
|
|
||||||
|
function execAnd(ctx, ast) {
|
||||||
|
const a = exec(ctx, ast.values[0]);
|
||||||
|
if (ctx.error) return;
|
||||||
|
if (a.type != "NUMBER") return { type: "NUMBER" };
|
||||||
|
const b = exec(ctx, ast.values[1]);
|
||||||
|
if (ctx.error) return;
|
||||||
|
if (b.type != "NUMBER") return { type: "NUMBER" };
|
||||||
|
if (!a.value || !b.value) return { type: "NUMBER" };
|
||||||
|
return {
|
||||||
|
type: "NUMBER",
|
||||||
|
value: (a.value.neq(0) && a.value.neq(0)) ? bigInt(1) : bigInt(0)
|
||||||
|
};
|
||||||
|
}
|
||||||
|
|
||||||
|
function execOr(ctx, ast) {
|
||||||
|
const a = exec(ctx, ast.values[0]);
|
||||||
|
if (ctx.error) return;
|
||||||
|
if (a.type != "NUMBER") return { type: "NUMBER" };
|
||||||
|
const b = exec(ctx, ast.values[1]);
|
||||||
|
if (ctx.error) return;
|
||||||
|
if (b.type != "NUMBER") return { type: "NUMBER" };
|
||||||
|
if (!a.value || !b.value) return { type: "NUMBER" };
|
||||||
|
return {
|
||||||
|
type: "NUMBER",
|
||||||
|
value: (a.value.neq(0) || a.value.neq(0)) ? bigInt(1) : bigInt(0)
|
||||||
|
};
|
||||||
|
}
|
||||||
|
|
||||||
function execShl(ctx, ast) {
|
function execShl(ctx, ast) {
|
||||||
const a = exec(ctx, ast.values[0]);
|
const a = exec(ctx, ast.values[0]);
|
||||||
if (ctx.error) return;
|
if (ctx.error) return;
|
||||||
@@ -796,6 +833,21 @@ function execDiv(ctx, ast) {
|
|||||||
};
|
};
|
||||||
}
|
}
|
||||||
|
|
||||||
|
function execIDiv(ctx, ast) {
|
||||||
|
const a = exec(ctx, ast.values[0]);
|
||||||
|
if (ctx.error) return;
|
||||||
|
if (a.type != "NUMBER") return { type: "NUMBER" };
|
||||||
|
const b = exec(ctx, ast.values[1]);
|
||||||
|
if (ctx.error) return;
|
||||||
|
if (b.type != "NUMBER") return { type: "NUMBER" };
|
||||||
|
if (!a.value || !b.value) return { type: "NUMBER" };
|
||||||
|
if (b.value.isZero()) return error(ctx, ast, "Division by zero");
|
||||||
|
return {
|
||||||
|
type: "NUMBER",
|
||||||
|
value: a.value.divide(b.value)
|
||||||
|
};
|
||||||
|
}
|
||||||
|
|
||||||
function execAdd(ctx, ast) {
|
function execAdd(ctx, ast) {
|
||||||
const a = exec(ctx, ast.values[0]);
|
const a = exec(ctx, ast.values[0]);
|
||||||
if (ctx.error) return;
|
if (ctx.error) return;
|
||||||
|
|||||||
@@ -67,8 +67,14 @@ function gen(ctx, ast) {
|
|||||||
return genExp(ctx, ast);
|
return genExp(ctx, ast);
|
||||||
} else if (ast.op == "/") {
|
} else if (ast.op == "/") {
|
||||||
return genDiv(ctx, ast);
|
return genDiv(ctx, ast);
|
||||||
|
} else if (ast.op == "\\") {
|
||||||
|
return genIDiv(ctx, ast);
|
||||||
} else if (ast.op == "&") {
|
} else if (ast.op == "&") {
|
||||||
return genBAnd(ctx, ast);
|
return genBAnd(ctx, ast);
|
||||||
|
} else if (ast.op == "&&") {
|
||||||
|
return genAnd(ctx, ast);
|
||||||
|
} else if (ast.op == "||") {
|
||||||
|
return genOr(ctx, ast);
|
||||||
} else if (ast.op == "<<") {
|
} else if (ast.op == "<<") {
|
||||||
return genShl(ctx, ast);
|
return genShl(ctx, ast);
|
||||||
} else if (ast.op == ">>") {
|
} else if (ast.op == ">>") {
|
||||||
@@ -457,6 +463,15 @@ function genDiv(ctx, ast) {
|
|||||||
return `bigInt(${a}).mul( bigInt(${b}).inverse(__P__) ).mod(__P__)`;
|
return `bigInt(${a}).mul( bigInt(${b}).inverse(__P__) ).mod(__P__)`;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
function genIDiv(ctx, ast) {
|
||||||
|
const a = gen(ctx, ast.values[0]);
|
||||||
|
if (ctx.error) return;
|
||||||
|
const b = gen(ctx, ast.values[1]);
|
||||||
|
if (ctx.error) return;
|
||||||
|
|
||||||
|
return `bigInt(${a}).div( bigInt(${b}))`;
|
||||||
|
}
|
||||||
|
|
||||||
function genExp(ctx, ast) {
|
function genExp(ctx, ast) {
|
||||||
const a = gen(ctx, ast.values[0]);
|
const a = gen(ctx, ast.values[0]);
|
||||||
if (ctx.error) return;
|
if (ctx.error) return;
|
||||||
@@ -473,6 +488,22 @@ function genBAnd(ctx, ast) {
|
|||||||
return `bigInt(${a}).and(bigInt(${b})).and(__MASK__)`;
|
return `bigInt(${a}).and(bigInt(${b})).and(__MASK__)`;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
function genAnd(ctx, ast) {
|
||||||
|
const a = gen(ctx, ast.values[0]);
|
||||||
|
if (ctx.error) return;
|
||||||
|
const b = gen(ctx, ast.values[1]);
|
||||||
|
if (ctx.error) return;
|
||||||
|
return `((bigInt(${a}).neq(bigInt(0)) && bigInt(${b}).neq(bigInt(0))) ? bigInt(1) : bigInt(0))`;
|
||||||
|
}
|
||||||
|
|
||||||
|
function genOr(ctx, ast) {
|
||||||
|
const a = gen(ctx, ast.values[0]);
|
||||||
|
if (ctx.error) return;
|
||||||
|
const b = gen(ctx, ast.values[1]);
|
||||||
|
if (ctx.error) return;
|
||||||
|
return `((bigInt(${a}).neq(bigInt(0)) || bigInt(${b}).neq(bigInt(0))) ? bigInt(1) : bigInt(0))`;
|
||||||
|
}
|
||||||
|
|
||||||
function genShl(ctx, ast) {
|
function genShl(ctx, ast) {
|
||||||
const a = gen(ctx, ast.values[0]);
|
const a = gen(ctx, ast.values[0]);
|
||||||
if (ctx.error) return;
|
if (ctx.error) return;
|
||||||
|
|||||||
@@ -1,7 +1,8 @@
|
|||||||
const chai = require("chai");
|
const chai = require("chai");
|
||||||
const path = require("path");
|
const path = require("path");
|
||||||
const snarkjs = require("snarkjs");
|
const snarkjs = require("snarkjs");
|
||||||
const crypto = require("crypto");
|
|
||||||
|
const bigInt = snarkjs.bigInt;
|
||||||
|
|
||||||
const compiler = require("../index.js");
|
const compiler = require("../index.js");
|
||||||
|
|
||||||
@@ -11,4 +12,25 @@ describe("Sum test", () => {
|
|||||||
it("Should compile a code with an undefined if", async () => {
|
it("Should compile a code with an undefined if", async () => {
|
||||||
await compiler(path.join(__dirname, "circuits", "undefinedif.circom"));
|
await compiler(path.join(__dirname, "circuits", "undefinedif.circom"));
|
||||||
});
|
});
|
||||||
|
it("Should compile a code with vars inside a for", async () => {
|
||||||
|
const cirDef = await compiler(path.join(__dirname, "circuits", "forvariables.circom"));
|
||||||
|
|
||||||
|
const circuit = new snarkjs.Circuit(cirDef);
|
||||||
|
|
||||||
|
const witness = circuit.calculateWitness({ "in": 111});
|
||||||
|
assert(witness[0].equals(bigInt(1)));
|
||||||
|
assert(witness[1].equals(bigInt(114)));
|
||||||
|
assert(witness[2].equals(bigInt(111)));
|
||||||
|
|
||||||
|
});
|
||||||
|
it("Should compile a code with an undefined if", async () => {
|
||||||
|
const cirDef = await compiler(path.join(__dirname, "circuits", "mixvarsignal.circom"));
|
||||||
|
|
||||||
|
const circuit = new snarkjs.Circuit(cirDef);
|
||||||
|
|
||||||
|
const witness = circuit.calculateWitness({ "i": 111});
|
||||||
|
assert(witness[0].equals(bigInt(1)));
|
||||||
|
assert(witness[1].equals(bigInt(111)));
|
||||||
|
assert(witness[2].equals(bigInt(111)));
|
||||||
|
});
|
||||||
});
|
});
|
||||||
|
|||||||
12
test/circuits/declareandistantiate.circom
Normal file
12
test/circuits/declareandistantiate.circom
Normal file
@@ -0,0 +1,12 @@
|
|||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
template A() {
|
||||||
|
signal a;
|
||||||
|
}
|
||||||
|
|
||||||
|
template B() {
|
||||||
|
component a[2] = A();
|
||||||
|
}
|
||||||
|
|
||||||
|
component main = B();
|
||||||
19
test/circuits/forvariables.circom
Normal file
19
test/circuits/forvariables.circom
Normal file
@@ -0,0 +1,19 @@
|
|||||||
|
template A() {
|
||||||
|
signal input in;
|
||||||
|
signal output out;
|
||||||
|
|
||||||
|
var acc = 0;
|
||||||
|
for (var i=0; i<3; i++) {
|
||||||
|
if (i==1) {
|
||||||
|
var accIn = 0;
|
||||||
|
for (var j=0; j<3; j++) {
|
||||||
|
accIn= accIn+1;
|
||||||
|
}
|
||||||
|
acc = acc + accIn;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
out <== in + acc;
|
||||||
|
}
|
||||||
|
|
||||||
|
component main = A();
|
||||||
14
test/circuits/mixvarsignal.circom
Normal file
14
test/circuits/mixvarsignal.circom
Normal file
@@ -0,0 +1,14 @@
|
|||||||
|
template X() {
|
||||||
|
signal input i;
|
||||||
|
signal output out;
|
||||||
|
|
||||||
|
var r = 0;
|
||||||
|
for (var n=0; n<i; n++) {
|
||||||
|
r++;
|
||||||
|
}
|
||||||
|
|
||||||
|
i === r;
|
||||||
|
out <== r;
|
||||||
|
}
|
||||||
|
|
||||||
|
component main = X();
|
||||||
File diff suppressed because it is too large
Load Diff
Reference in New Issue
Block a user