Compare commits

..

30 Commits

Author SHA1 Message Date
Jordi Baylina
42162b10c1 0.5.31 2020-11-21 20:40:27 +01:00
Jordi Baylina
a84873161f FIX discard unused signals 2020-11-21 20:40:11 +01:00
Jordi Baylina
9bf1354bf1 0.5.30 2020-10-14 09:50:22 +02:00
Jordi Baylina
ed4c4b4de0 Merge branch 'master' of github.com:iden3/circom 2020-10-14 09:49:51 +02:00
Jordi Baylina
a1f3f714ea 0.5.29 2020-10-14 09:49:29 +02:00
Jordi Baylina
dafc9db614 fix fasfile pageSize 2020-10-14 09:49:13 +02:00
Marta Bellés
6e4a192c6a Update README.md 2020-10-05 10:12:00 +02:00
Jordi Baylina
e1286c29c7 0.5.28 2020-09-24 19:18:59 +02:00
Jordi Baylina
a002bcbc25 bls12-381 fix and fast r1cs generation 2020-09-24 19:18:49 +02:00
Jordi Baylina
f9f1d0c13e High Removed array 2020-09-19 18:36:35 +02:00
Jordi Baylina
fc01aad8b6 Reduce mem 2020-09-17 22:53:06 +02:00
Jordi Baylina
3d5aa14cdc 0.5.27 2020-09-17 17:45:44 +02:00
Jordi Baylina
5dc54bb7d2 Optimize recursive constant dependency 2020-09-17 17:42:32 +02:00
Jordi Baylina
349a39dc95 0.5.26 2020-09-17 10:38:01 +02:00
Jordi Baylina
0a2aee9932 0.5.25 2020-09-17 10:34:57 +02:00
Jordi Baylina
bad8fad3d0 Optimize optimize constraints not BigArray for small circuits 2020-09-17 10:34:49 +02:00
Jordi Baylina
0a707648fc 0.5.24 2020-09-17 01:09:31 +02:00
Jordi Baylina
263dc73906 FIX Bad optimization 2020-09-17 01:09:24 +02:00
Jordi Baylina
8e730d93a4 64 size r1cs 2020-09-04 09:10:49 +02:00
Jordi Baylina
bbe10438e0 0.5.23 2020-08-31 11:28:23 +02:00
Jordi Baylina
c2cef8d80c deps 2020-08-31 11:28:11 +02:00
Jordi Baylina
2200408986 0.5.22 2020-08-31 11:18:06 +02:00
Jordi Baylina
5f13d37fdc Better info in signal not assigned 2020-08-31 11:13:26 +02:00
Jordi Baylina
3b46b74d4a 0.5.21 2020-08-24 09:31:42 +02:00
Jordi Baylina
aa2d768465 assert working 2020-08-24 09:31:35 +02:00
Jordi Baylina
f02ceb2508 Big component entry tables 2020-08-17 12:02:24 +02:00
Jordi Baylina
d014d67032 0.5.20 2020-08-17 11:22:40 +02:00
Jordi Baylina
2e1b35a94d Fix Offset referenced by an iteger 2020-08-17 11:22:21 +02:00
Jordi Baylina
7cef1be2c3 0.5.19 2020-08-13 18:56:39 +02:00
Jordi Baylina
4b631994ca c to cpp 2020-08-13 18:56:30 +02:00
15 changed files with 436 additions and 529 deletions

View File

@@ -1,12 +1,15 @@
# Circom # Circom
Circom 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).
## Usage ## Usage
### Circom Docs
You can read the details of circom in [the documentation webpage](https://docs.circom.io/).
### Tutorial ### Tutorial
A good starting point [is this tutorial](https://github.com/iden3/circom/blob/master/TUTORIAL.md) A good starting point [is this tutorial](https://github.com/iden3/circom/blob/master/TUTORIAL.md)

6
cli.js
View File

@@ -24,6 +24,7 @@
const fs = require("fs"); const fs = require("fs");
const path = require("path"); const path = require("path");
const Scalar = require("ffjavascript").Scalar; const Scalar = require("ffjavascript").Scalar;
const stringifyBigInts = require("ffjavascript").utils.stringifyBigInts;
const fastFile = require("fastfile"); const fastFile = require("fastfile");
const compiler = require("./src/compiler"); const compiler = require("./src/compiler");
@@ -87,6 +88,8 @@ async function run() {
if (argv.csource) { if (argv.csource) {
options.cSourceFile = await fastFile.createOverride(cSourceName); options.cSourceFile = await fastFile.createOverride(cSourceName);
const noExt = cSourceName.substr(0, cSourceName.lastIndexOf(".")) || cSourceName;
options.dataFile = await fastFile.createOverride(noExt+".dat");
} }
if (argv.wasm) { if (argv.wasm) {
options.wasmFile = await fastFile.createOverride(wasmName); options.wasmFile = await fastFile.createOverride(wasmName);
@@ -117,6 +120,7 @@ async function run() {
await compiler(fullFileName, options); await compiler(fullFileName, options);
if (options.cSourceFile) await options.cSourceFile.close(); if (options.cSourceFile) await options.cSourceFile.close();
if (options.dataFile) await options.dataFile.close();
if (options.wasmFile) await options.wasmFile.close(); if (options.wasmFile) await options.wasmFile.close();
if (options.watFile) await options.watFile.close(); if (options.watFile) await options.watFile.close();
let symDone = false; let symDone = false;
@@ -150,7 +154,7 @@ run().then(()=> {
if (argv.verbose) console.log(err.stack); if (argv.verbose) console.log(err.stack);
} }
if (err.ast) { if (err.ast) {
console.error(JSON.stringify(err.ast, null, 1)); console.error(JSON.stringify(stringifyBigInts(err.ast), null, 1));
} }
process.exit(1); process.exit(1);
}); });

86
package-lock.json generated
View File

@@ -1,6 +1,6 @@
{ {
"name": "circom", "name": "circom",
"version": "0.5.18", "version": "0.5.31",
"lockfileVersion": 1, "lockfileVersion": 1,
"requires": true, "requires": true,
"dependencies": { "dependencies": {
@@ -30,6 +30,11 @@
"js-tokens": "^4.0.0" "js-tokens": "^4.0.0"
} }
}, },
"@iden3/bigarray": {
"version": "0.0.2",
"resolved": "https://registry.npmjs.org/@iden3/bigarray/-/bigarray-0.0.2.tgz",
"integrity": "sha512-Xzdyxqm1bOFF6pdIsiHLLl3HkSLjbhqJHVyqaTxXt3RqXBEnmsUmEW47H7VOi/ak7TdkRpNkxjyK5Zbkm+y52g=="
},
"@types/color-name": { "@types/color-name": {
"version": "1.1.1", "version": "1.1.1",
"resolved": "https://registry.npmjs.org/@types/color-name/-/color-name-1.1.1.tgz", "resolved": "https://registry.npmjs.org/@types/color-name/-/color-name-1.1.1.tgz",
@@ -203,20 +208,22 @@
"integrity": "sha1-V00xLt2Iu13YkS6Sht1sCu1KrII=" "integrity": "sha1-V00xLt2Iu13YkS6Sht1sCu1KrII="
}, },
"circom_runtime": { "circom_runtime": {
"version": "0.0.6", "version": "0.1.5",
"resolved": "https://registry.npmjs.org/circom_runtime/-/circom_runtime-0.0.6.tgz", "resolved": "https://registry.npmjs.org/circom_runtime/-/circom_runtime-0.1.5.tgz",
"integrity": "sha512-o0T5MuWzxnxinWG3+CygS/kZouoP+z5ZrufUwqKJy3gsVFJhkbqMpfKmcBGjhExB3uatA7cKyOiRAOLOz5+t5w==", "integrity": "sha512-BT3d9VCrH/rBRbThDXG731JwezKyskxyE46nACO6Tt/jaorn27LDxFDORdAAjyD0RAoBt+6FpaTp3qlYSx7Pjg==",
"requires": { "requires": {
"ffjavascript": "0.1.0", "ffjavascript": "0.2.10",
"fnv-plus": "^1.3.1" "fnv-plus": "^1.3.1"
}, },
"dependencies": { "dependencies": {
"ffjavascript": { "ffjavascript": {
"version": "0.1.0", "version": "0.2.10",
"resolved": "https://registry.npmjs.org/ffjavascript/-/ffjavascript-0.1.0.tgz", "resolved": "https://registry.npmjs.org/ffjavascript/-/ffjavascript-0.2.10.tgz",
"integrity": "sha512-dmKlUasSfvUcxBm8nCSKl2x7EFJsXA7OVP8XLFA03T2+6mAc3IiVLC2ambEVOcMOhyhl0vJfVZjM9f9d38D1rw==", "integrity": "sha512-GQI6gHYYG5/iD4Kt3VzezzK7fARJzP0zkc82V/+JAdjfeKBXhDSo5rpKFuK3cDcrdW0Fu2emuYNMEAuFqhEQvQ==",
"requires": { "requires": {
"big-integer": "^1.6.48" "big-integer": "^1.6.48",
"wasmcurves": "0.0.5",
"worker-threads": "^1.0.0"
} }
} }
} }
@@ -344,9 +351,9 @@
"dev": true "dev": true
}, },
"ejs": { "ejs": {
"version": "3.1.3", "version": "3.1.5",
"resolved": "https://registry.npmjs.org/ejs/-/ejs-3.1.3.tgz", "resolved": "https://registry.npmjs.org/ejs/-/ejs-3.1.5.tgz",
"integrity": "sha512-wmtrUGyfSC23GC/B1SMv2ogAUgbQEtDmTIhfqielrG5ExIM9TP4UoYdi90jLF1aTcsWCJNEO0UrgKzP0y3nTSg==", "integrity": "sha512-dldq3ZfFtgVTJMLjOe+/3sROTzALlL9E34V4/sDtUd/KlBSS0s6U1/+WPE1B4sj9CXHJpL1M6rhNJnc9Wbal9w==",
"requires": { "requires": {
"jake": "^10.6.1" "jake": "^10.6.1"
} }
@@ -576,14 +583,14 @@
"dev": true "dev": true
}, },
"fastfile": { "fastfile": {
"version": "0.0.12", "version": "0.0.18",
"resolved": "https://registry.npmjs.org/fastfile/-/fastfile-0.0.12.tgz", "resolved": "https://registry.npmjs.org/fastfile/-/fastfile-0.0.18.tgz",
"integrity": "sha512-0EZo2y5eW8X0oiDDRvcnufjVxlM96CQL5hvmRQtbRABWlCkH73IHwkzl0qOSdxtchaMr+0TSB7GVqaVEixRr1Q==" "integrity": "sha512-q03PTKc+wptis4WmuFOwPNQx2p5myFUrl/dMgRlW9mymc1Egyc14JPHgiGnWK+sJ0+dBl2Vwtfh5GfSQltYOpw=="
}, },
"ffiasm": { "ffiasm": {
"version": "0.0.2", "version": "0.1.1",
"resolved": "https://registry.npmjs.org/ffiasm/-/ffiasm-0.0.2.tgz", "resolved": "https://registry.npmjs.org/ffiasm/-/ffiasm-0.1.1.tgz",
"integrity": "sha512-o/CL7F4IodB7eRHCOQL1SrqN2DIPHrQbEwjPY7NIyeBRdnB3G0xo6b6Mj44SKiWFnvpQMb3n4N7acjD3vv4NVQ==", "integrity": "sha512-irMMHiR9JJ7BVBrAhtliUawxVdPYSdyl81taUYJ4C1mJ0iw2ueThE/qtr0J8B83tsIY8HJvh0lg5F+6ClK4xpA==",
"requires": { "requires": {
"big-integer": "^1.6.48", "big-integer": "^1.6.48",
"ejs": "^3.0.1", "ejs": "^3.0.1",
@@ -591,13 +598,24 @@
} }
}, },
"ffjavascript": { "ffjavascript": {
"version": "0.2.4", "version": "0.2.22",
"resolved": "https://registry.npmjs.org/ffjavascript/-/ffjavascript-0.2.4.tgz", "resolved": "https://registry.npmjs.org/ffjavascript/-/ffjavascript-0.2.22.tgz",
"integrity": "sha512-XFeWcjUDFPavN+DDOxhE8p5MOhZQJc9oO1Sj4ml1pyjqNhS1ujEamcjFyK0cctdnat61i7lvpTYzdtS3RYDC8w==", "integrity": "sha512-EsVqap2Txm17bKW0z/jXCX3M7rQ++nQUAJY8alWDpyhjRj90xjl6GLeVSKZQ8rOFDQ/SFFXcEB8w9X8Boxid+w==",
"requires": { "requires": {
"big-integer": "^1.6.48", "big-integer": "^1.6.48",
"wasmcurves": "0.0.4", "wasmcurves": "0.0.12",
"worker-threads": "^1.0.0" "worker-threads": "^1.0.0"
},
"dependencies": {
"wasmcurves": {
"version": "0.0.12",
"resolved": "https://registry.npmjs.org/wasmcurves/-/wasmcurves-0.0.12.tgz",
"integrity": "sha512-1Jl9mkatyHSNj80ILjf85SZUNuZQBCkTjJlhzqHnZQXUmIimCIWkugaVaYNjozLs1Gun4h/keZe1MBeBN0sRpg==",
"requires": {
"big-integer": "^1.6.42",
"blakejs": "^1.1.0"
}
}
} }
}, },
"ffwasm": { "ffwasm": {
@@ -1161,19 +1179,13 @@
"dev": true "dev": true
}, },
"r1csfile": { "r1csfile": {
"version": "0.0.14", "version": "0.0.16",
"resolved": "https://registry.npmjs.org/r1csfile/-/r1csfile-0.0.14.tgz", "resolved": "https://registry.npmjs.org/r1csfile/-/r1csfile-0.0.16.tgz",
"integrity": "sha512-7m4eWpnbjkwGGUaRmIAJc4w+HvaeBPJXUKHIqLkHeD9Yyjem6/EHmlgDVl+4hWNWGZqdhXuMqWSH9+O6QOXBdw==", "integrity": "sha512-A2jRVWzGgmXeG2lVAc0H4suJmzt50it5UvBnycJgBCpMXM3tH/M6RguP7nvs6suY/yYnkN6jX6iTScSiDUF3FA==",
"requires": { "requires": {
"fastfile": "0.0.7", "@iden3/bigarray": "0.0.2",
"ffjavascript": "0.2.4" "fastfile": "0.0.18",
}, "ffjavascript": "0.2.22"
"dependencies": {
"fastfile": {
"version": "0.0.7",
"resolved": "https://registry.npmjs.org/fastfile/-/fastfile-0.0.7.tgz",
"integrity": "sha512-Zk7sdqsV6DsN/rhjULDfCCowPiMDsziTMFicdkrKN80yybr/6YFf9H91ELXN85dVEf6EYkVR5EHkZNc0dMqZKA=="
}
} }
}, },
"regexpp": { "regexpp": {
@@ -1472,9 +1484,9 @@
} }
}, },
"wasmcurves": { "wasmcurves": {
"version": "0.0.4", "version": "0.0.5",
"resolved": "https://registry.npmjs.org/wasmcurves/-/wasmcurves-0.0.4.tgz", "resolved": "https://registry.npmjs.org/wasmcurves/-/wasmcurves-0.0.5.tgz",
"integrity": "sha512-c/Tob+F/7jJhep1b2qtj54r4nkGaRifNbQ1OJx8cBBFH1RlHbWIbISHWONClOxiVwy/JZOpbN4SgvSX/4lF80A==", "integrity": "sha512-BmI4GXLjLawGg2YkvHa8zRsnWec+d1uwoxE+Iov8cqOpDL7GA5XO2pk2yuDbXHMzwIug2exnKot3baRZ86R0pA==",
"requires": { "requires": {
"big-integer": "^1.6.42", "big-integer": "^1.6.42",
"blakejs": "^1.1.0" "blakejs": "^1.1.0"

View File

@@ -1,6 +1,6 @@
{ {
"name": "circom", "name": "circom",
"version": "0.5.18", "version": "0.5.31",
"description": "Language to generate logic circuits", "description": "Language to generate logic circuits",
"main": "index.js", "main": "index.js",
"directories": { "directories": {
@@ -30,13 +30,13 @@
}, },
"dependencies": { "dependencies": {
"chai": "^4.2.0", "chai": "^4.2.0",
"circom_runtime": "0.0.6", "circom_runtime": "0.1.5",
"fastfile": "0.0.12", "fastfile": "0.0.18",
"ffiasm": "0.0.2", "ffiasm": "0.1.1",
"ffjavascript": "0.2.4", "ffjavascript": "0.2.22",
"ffwasm": "0.0.7", "ffwasm": "0.0.7",
"fnv-plus": "^1.3.1", "fnv-plus": "^1.3.1",
"r1csfile": "0.0.14", "r1csfile": "0.0.16",
"tmp-promise": "^2.0.2", "tmp-promise": "^2.0.2",
"wasmbuilder": "0.0.10" "wasmbuilder": "0.0.10"
}, },

View File

@@ -95,6 +95,10 @@ class CodeBuilderC {
this.ops.push({op: "CHECKCONSTRAINT", a, b, strErr}); this.ops.push({op: "CHECKCONSTRAINT", a, b, strErr});
} }
checkAssert(a, strErr) {
this.ops.push({op: "CHECKASSERT", a, strErr});
}
log(val) { log(val) {
this.ops.push({op: "LOG", val}); this.ops.push({op: "LOG", val});
} }
@@ -215,6 +219,8 @@ class CodeBuilderC {
code.push(`${o.fnName}(ctx, ${o.retLabel}, ${o.params.join(",")});`); code.push(`${o.fnName}(ctx, ${o.retLabel}, ${o.params.join(",")});`);
} else if (o.op == "CHECKCONSTRAINT") { } else if (o.op == "CHECKCONSTRAINT") {
code.push(`ctx->checkConstraint(__cIdx, ${ref2src(o.a)}, ${ref2src(o.b)}, "${o.strErr}");`); code.push(`ctx->checkConstraint(__cIdx, ${ref2src(o.a)}, ${ref2src(o.b)}, "${o.strErr}");`);
} else if (o.op == "CHECKASSERT") {
code.push(`ctx->checkAssert(__cIdx, ${ref2src(o.a)}, "${o.strErr}");`);
} else if (o.op == "LOG") { } else if (o.op == "LOG") {
code.push(`ctx->log(${ref2src(o.val)});`); code.push(`ctx->log(${ref2src(o.val)});`);
} }
@@ -352,6 +358,12 @@ class BuilderC {
this.components = new BigArray(); this.components = new BigArray();
this.usedConstants = {}; this.usedConstants = {};
this.verbose = verbose; this.verbose = verbose;
this.sizePointers = {};
this.hashMapPointers = {};
this.functionIdx = {};
this.nCets = 0;
} }
setHeader(header) { setHeader(header) {
@@ -363,11 +375,11 @@ class BuilderC {
this.hashMaps[name] = hm; this.hashMaps[name] = hm;
} }
addComponentEntriesTable(name, cet) { addComponentEntriesTable(name, cet, idComponent) {
this.componentEntriesTables.push({ this.componentEntriesTables[idComponent] = {
name: name, name: name,
cet: cet cet: cet
}); };
} }
addSizes(name, accSizes) { addSizes(name, accSizes) {
@@ -413,8 +425,8 @@ class BuilderC {
_buildHeader(code) { _buildHeader(code) {
code.push( code.push(
"#include \"circom.h\"", "#include \"circom.hpp\"",
"#include \"calcwit.h\"", "#include \"calcwit.hpp\"",
`#define NSignals ${this.header.NSignals}`, `#define NSignals ${this.header.NSignals}`,
`#define NComponents ${this.header.NComponents}`, `#define NComponents ${this.header.NComponents}`,
`#define NOutputs ${this.header.NOutputs}`, `#define NOutputs ${this.header.NOutputs}`,
@@ -425,70 +437,91 @@ class BuilderC {
); );
} }
_buildHashMaps(code) { async _buildHashMaps(fdData) {
code.push("// Hash Maps "); while (fdData.pos % 8) fdData.pos++;
this.pHashMaps = fdData.pos;
const buff = new Uint8Array(256*12);
const buffV = new DataView(buff.buffer);
for (let hmName in this.hashMaps ) { for (let hmName in this.hashMaps ) {
while (fdData.pos % 8) fdData.pos++;
this.hashMapPointers[hmName] = fdData.pos;
const hm = this.hashMaps[hmName]; const hm = this.hashMaps[hmName];
let c = `Circom_HashEntry ${hmName}[256] = {`;
for (let i=0; i<256; i++) { for (let i=0; i<256; i++) {
c += i>0 ? "," : ""; buffV.setUint32(i*12, hm[i] ? parseInt( hm[i][0].slice(8), 16 ) : 0, true);
if (hm[i]) { buffV.setUint32(i*12+4, hm[i] ? parseInt( hm[i][0].slice(0,8), 16 ) : 0, true);
c += `{0x${hm[i][0]}LL, ${hm[i][1]}} /* ${hm[i][2]} */`; buffV.setUint32(i*12+8, hm[i] ? hm[i][1] : 0, true);
} else {
c += "{0,0}";
} }
}
c += "};"; await fdData.write(buff);
code.push(c);
} }
} }
_buildComponentEntriesTables(code) { async _buildComponentEntriesTables(fdData) {
code.push("// Component Entry tables");
while (fdData.pos % 8) fdData.pos++;
this.pCets = fdData.pos;
for (let i=0; i< this.componentEntriesTables.length; i++) { for (let i=0; i< this.componentEntriesTables.length; i++) {
if ((this.verbose)&&(i%100000 ==0)) console.log(`_buildComponentEntriesTables ${i}/${this.componentEntriesTables.length}`); if ((this.verbose)&&(i%100000 ==0)) console.log(`_buildComponentEntriesTables ${i}/${this.componentEntriesTables.length}`);
const cetName = this.componentEntriesTables[i].name;
const cet = this.componentEntriesTables[i].cet; const cet = this.componentEntriesTables[i].cet;
code.push(`Circom_ComponentEntry ${cetName}[${cet.length}] = {`); this.components[i].entryTablePointer = fdData.pos;
const buff = new Uint8Array(16*cet.length);
const buffV = new DataView(buff.buffer);
for (let j=0; j<cet.length; j++) { for (let j=0; j<cet.length; j++) {
const ty = cet[j].type == "S" ? "_typeSignal" : "_typeComponent"; utils.setUint64(buffV, 16*j+0, this.sizePointers[ cet[j].sizeName]);
code.push(` ${j>0?",":" "}{${cet[j].offset},${cet[j].sizeName}, ${ty}}`); buffV.setUint32(16*j+8, cet[j].offset, true);
buffV.setUint32(16*j+12, cet[j].type == "S" ? 0 : 1, true); // Size type 0-> Signal, 1->Component
this.nCets ++;
} }
code.push("};");
await fdData.write(buff);
} }
} }
_buildSizes(code) { async _buildSizes(fdData) {
code.push("// Sizes");
for (let sName in this.sizes) { for (let sName in this.sizes) {
const accSizes = this.sizes[sName]; const accSizes = this.sizes[sName];
let c = `Circom_Size ${sName}[${accSizes.length}] = {`; while (fdData.pos % 8) fdData.pos++;
this.sizePointers[sName] = fdData.pos;
const buff = new Uint8Array(4*accSizes.length);
const buffV = new DataView(buff.buffer);
for (let i=0; i<accSizes.length; i++) { for (let i=0; i<accSizes.length; i++) {
if (i>0) c += ","; buffV.setUint32(i*4, accSizes[i], true);
c += accSizes[i];
} }
c += "};"; await fdData.write(buff);
code.push(c);
} }
} }
_buildConstants(code) {
async _buildConstants(fdData) {
const self = this; const self = this;
code.push("// Constants"); const frSize = (8 + self.F.n64*8);
code.push(`FrElement _constants[${self.constants.length}] = {`); const buff = new Uint8Array(self.constants.length* frSize);
for (let i=0; i<self.constants.length; i++) { const buffV = new DataView(buff.buffer);
if ((this.verbose)&&(i%1000000 ==0)) console.log(`_buildConstants ${i}/${this.constants.length}`);
code.push((i>0 ? "," : " ") + "{" + number2Code(self.constants[i]) + "}");
}
code.push("};");
function number2Code(n) {
while (fdData.pos % 8) fdData.pos++;
this.pConstants = fdData.pos;
let o = 0;
for (let i=0; i<self.constants.length; i++) {
Fr2Bytes(buffV, o, self.constants[i]);
o += frSize;
}
await fdData.write(buff);
function Fr2Bytes(buffV, offset, n) {
const minShort = self.F.neg(self.F.e("80000000")); const minShort = self.F.neg(self.F.e("80000000"));
const maxShort = self.F.e("7FFFFFFF", 16); const maxShort = self.F.e("7FFFFFFF", 16);
@@ -496,51 +529,49 @@ class BuilderC {
&&(self.F.leq(n, maxShort))) &&(self.F.leq(n, maxShort)))
{ {
if (self.F.geq(n, self.F.zero)) { if (self.F.geq(n, self.F.zero)) {
return addShortMontgomeryPositive(n); return shortMontgomeryPositive(n);
} else { } else {
return addShortMontgomeryNegative(n); return shortMontgomeryNegative(n);
} }
} }
return addLongMontgomery(n); return longMontgomery(n);
function addShortMontgomeryPositive(a) { function shortMontgomeryPositive(a) {
return `${a.toString()}, 0x40000000, { ${getLongString(toMontgomery(a))} }`; buffV.setUint32(offset, Scalar.toNumber(a) , true );
buffV.setUint32(offset + 4, 0x40000000 , true );
long(buffV, offset + 8, toMontgomery(a));
} }
function addShortMontgomeryNegative(a) { function shortMontgomeryNegative(a) {
const b = -Scalar.toNumber(self.F.neg(a)); const b = -Scalar.toNumber(self.F.neg(a));
return `${b.toString()}, 0x40000000, { ${getLongString(toMontgomery(a))} }`; buffV.setUint32(offset, b , true );
buffV.setUint32(offset + 4, 0x40000000 , true );
long(buffV, offset + 8, toMontgomery(a));
} }
function addLongMontgomery(a) { function longMontgomery(a) {
return `0, 0xC0000000, { ${getLongString(toMontgomery(a))} }`; buffV.setUint32(offset, 0 , true );
buffV.setUint32(offset + 4, 0xC0000000 , true );
long(buffV, offset + 8, toMontgomery(a));
} }
function getLongString(a) { function long(buffV, offset, a) {
let S = "";
let p = offset;
const arr = Scalar.toArray(a, 0x100000000); const arr = Scalar.toArray(a, 0x100000000);
for (let i=0; i<self.F.n64*2; i+=2) { for (let i=0; i<self.F.n64*2; i++) {
const idx = arr.length-2-i; const idx = arr.length-1-i;
if (i>0) S = S + ",";
if ( idx >=0) { if ( idx >=0) {
let msb = arr[idx].toString(16); buffV.setUint32(p, arr[idx], true);
while (msb.length<8) msb = "0" + msb;
let lsb = arr[idx+1].toString(16);
while (lsb.length<8) lsb = "0" + lsb;
S += "0x" + msb + lsb + "LL";
} else { } else {
S += "0LL"; buffV.setUint32(p, 0, true);
} }
p+= 4;
} }
return S;
} }
function toMontgomery(a) { function toMontgomery(a) {
@@ -548,101 +579,138 @@ class BuilderC {
} }
} }
} }
_buildFunctions(code) { _buildFunctions(code) {
const listedFunctions = [];
for (let i=0; i<this.functions.length; i++) { for (let i=0; i<this.functions.length; i++) {
const cfb = this.functions[i]; const cfb = this.functions[i];
cfb.build(code); cfb.build(code);
if (this.functions[i].type == "COMPONENT") {
this.functionIdx[this.functions[i].name] = listedFunctions.length;
listedFunctions.push(i);
} }
} }
_buildComponents(code) { code.push("// Function Table");
code.push("// Components"); code.push(`Circom_ComponentFunction _functionTable[${listedFunctions.length}] = {`);
code.push(`Circom_Component _components[${this.components.length}] = {`); for (let i=0; i<listedFunctions.length; i++) {
const sep = i>0 ? " ," : " ";
code.push(`${sep}${this.functions[listedFunctions[i]].name}`);
}
code.push("};");
}
async _buildComponents(fdData) {
const buff = new Uint8Array(32);
const buffV = new DataView(buff.buffer);
while (fdData.pos % 8) fdData.pos++;
this.pComponents = fdData.pos;
for (let i=0; i<this.components.length; i++) { for (let i=0; i<this.components.length; i++) {
if ((this.verbose)&&(i%1000000 ==0)) console.log(`_buildComponents ${i}/${this.components.length}`); if ((this.verbose)&&(i%1000000 ==0)) console.log(`_buildComponents ${i}/${this.components.length}`);
const c = this.components[i]; const c = this.components[i];
const sep = i>0 ? " ," : " ";
code.push(`${sep}{${c.hashMapName}, ${c.entryTableName}, ${c.functionName}, ${c.nInSignals}, ${c.newThread}}`); utils.setUint64(buffV, 0, this.hashMapPointers[c.hashMapName], true);
utils.setUint64(buffV, 8, c.entryTablePointer, true);
utils.setUint64(buffV, 16, this.functionIdx[c.functionName], true);
buffV.setUint32(24, c.nInSignals, true);
buffV.setUint32(28, c.newThread ? 1 : 0, true);
await fdData.write(buff);
} }
code.push("};");
} }
_buildMapIsInput(code) { async _buildMapIsInput(fdData) {
code.push("// mapIsInput");
code.push(`u32 _mapIsInput[${this.mapIsInput.length}] = {`); const buff = new Uint8Array(this.mapIsInput.length * 4);
let line = ""; const buffV = new DataView(buff.buffer);
while (fdData.pos % 8) fdData.pos++;
this.pMapIsInput = fdData.pos;
for (let i=0; i<this.mapIsInput.length; i++) { for (let i=0; i<this.mapIsInput.length; i++) {
if ((this.verbose)&&(i%1000000 ==0)) console.log(`_buildMapIsInput ${i}/${this.mapIsInput.length}`); if ((this.verbose)&&(i%1000000 ==0)) console.log(`_buildMapIsInput ${i}/${this.mapIsInput.length}`);
line += i>0 ? ", " : " ";
line += toHex(this.mapIsInput[i]);
if (((i+1) % 64)==0) {
code.push(" "+line);
line = "";
}
}
if (line != "") code.push(" "+line);
code.push("};");
function toHex(number) { buffV.setUint32(4*i, this.mapIsInput[i], true);
if (number < 0) number = 0xFFFFFFFF + number + 1;
let S=number.toString(16).toUpperCase();
while (S.length<8) S = "0" + S;
return "0x"+S;
}
} }
_buildWit2Sig(code) { await fdData.write(buff);
code.push("// Witness to Signal Table"); }
code.push(`int _wit2sig[${this.wit2sig.length}] = {`);
let line = ""; async _buildWit2Sig(fdData) {
const buff = new Uint8Array(this.wit2sig.length * 4);
const buffV = new DataView(buff.buffer);
while (fdData.pos % 8) fdData.pos++;
this.pWit2Sig = fdData.pos;
for (let i=0; i<this.wit2sig.length; i++) { for (let i=0; i<this.wit2sig.length; i++) {
if ((this.verbose)&&(i%1000000 ==0)) console.log(`_buildWit2Sig ${i}/${this.wit2sig.length}`); if ((this.verbose)&&(i%1000000 ==0)) console.log(`_buildWit2Sig ${i}/${this.wit2sig.length}`);
line += i>0 ? "," : " ";
line += this.wit2sig[i]; buffV.setUint32(4*i, this.wit2sig[i], true);
if (((i+1) % 64) == 0) {
code.push(" "+line);
line = "";
}
}
if (line != "") code.push(" "+line);
code.push("};");
} }
_buildCircuitVar(code) { await fdData.write(buff);
}
code.push( async _buildCircuitVar(fdData) {
"// Circuit Variable",
"Circom_Circuit _circuit = {" , const buff = new Uint8Array(72);
" NSignals,", const buffV = new DataView(buff.buffer);
" NComponents,",
" NInputs,", utils.setUint64(buffV, 0, this.pWit2Sig, true);
" NOutputs,", utils.setUint64(buffV, 8, this.pComponents, true);
" NVars,", utils.setUint64(buffV, 16, this.pMapIsInput, true);
" _wit2sig,", utils.setUint64(buffV, 24, this.pConstants, true);
" _components,", utils.setUint64(buffV, 32, this.pPriemStr, true);
" _mapIsInput,", utils.setUint64(buffV, 40, this.pCets, true);
" _constants,",
" __P__", buffV.setUint32(48, this.header.NSignals, true);
"};" buffV.setUint32(52, this.header.NComponents, true);
); buffV.setUint32(56, this.header.NOutputs, true);
buffV.setUint32(60, this.header.NInputs, true);
buffV.setUint32(64, this.header.NVars, true);
buffV.setUint32(68, this.nCets, true);
fdData.pos = 0;
await fdData.write(buff);
}
async _buildPrimeStr(fdData) {
this.pPriemStr = fdData.pos;
const strBuff = new TextEncoder("utf-8").encode(this.header.P.toString());
await fdData.write(strBuff);
const zB = new Uint8Array(1);
zB[0] =0;
await fdData.write(zB);
} }
async build(fd) { async build(fdCode, fdData) {
const encoder = new TextEncoder("utf-8"); const encoder = new TextEncoder("utf-8");
fdData.pos = 72;
while (fdData.pos % 8) fdData.pos++;
const code=new BigArray(); const code=new BigArray();
this._buildHeader(code); this._buildHeader(code);
this._buildSizes(code); await this._buildPrimeStr(fdData);
this._buildConstants(code); await this._buildSizes(fdData);
this._buildHashMaps(code); await this._buildConstants(fdData);
this._buildComponentEntriesTables(code); await this._buildHashMaps(fdData);
await this._buildComponentEntriesTables(fdData);
this._buildFunctions(code); this._buildFunctions(code);
this._buildComponents(code); await this._buildComponents(fdData);
this._buildMapIsInput(code); await this._buildMapIsInput(fdData);
this._buildWit2Sig(code); await this._buildWit2Sig(fdData);
this._buildCircuitVar(code); await this._buildCircuitVar(fdData);
await writeCode(code); await writeCode(code);
async function writeCode(c) { async function writeCode(c) {
@@ -651,7 +719,7 @@ class BuilderC {
await writeCode(c[i]); await writeCode(c[i]);
} }
} else if (typeof c === "string") { } else if (typeof c === "string") {
await fd.write(encoder.encode(c + "\n")); await fdCode.write(encoder.encode(c + "\n"));
} }
} }
} }

View File

@@ -31,6 +31,7 @@ async function c_tester(circomFile, _options) {
const options = Object.assign({}, _options); const options = Object.assign({}, _options);
options.cSourceFile = await fastFile.createOverride(path.join(dir.path, baseName + ".cpp")); options.cSourceFile = await fastFile.createOverride(path.join(dir.path, baseName + ".cpp"));
options.dataFile = await fastFile.createOverride(path.join(dir.path, baseName + ".dat"));
options.symWriteStream = fs.createWriteStream(path.join(dir.path, baseName + ".sym")); options.symWriteStream = fs.createWriteStream(path.join(dir.path, baseName + ".sym"));
options.r1csFileName = path.join(dir.path, baseName + ".r1cs"); options.r1csFileName = path.join(dir.path, baseName + ".r1cs");
@@ -38,14 +39,15 @@ async function c_tester(circomFile, _options) {
await compiler(circomFile, options); await compiler(circomFile, options);
await options.cSourceFile.close(); await options.cSourceFile.close();
await options.dataFile.close();
const source = await buildZqField(options.p, "Fr"); const source = await buildZqField(options.p, "Fr");
// console.log(dir.path); // console.log(dir.path);
await fs.promises.writeFile(path.join(dir.path, "fr.asm"), source.asm, "utf8"); await fs.promises.writeFile(path.join(dir.path, "fr.asm"), source.asm, "utf8");
await fs.promises.writeFile(path.join(dir.path, "fr.h"), source.h, "utf8"); await fs.promises.writeFile(path.join(dir.path, "fr.hpp"), source.hpp, "utf8");
await fs.promises.writeFile(path.join(dir.path, "fr.c"), source.c, "utf8"); await fs.promises.writeFile(path.join(dir.path, "fr.cpp"), source.cpp, "utf8");
let pThread = ""; let pThread = "";
@@ -66,7 +68,7 @@ async function c_tester(circomFile, _options) {
` ${path.join(cdir, "main.cpp")}` + ` ${path.join(cdir, "main.cpp")}` +
` ${path.join(cdir, "calcwit.cpp")}` + ` ${path.join(cdir, "calcwit.cpp")}` +
` ${path.join(cdir, "utils.cpp")}` + ` ${path.join(cdir, "utils.cpp")}` +
` ${path.join(dir.path, "fr.c")}` + ` ${path.join(dir.path, "fr.cpp")}` +
` ${path.join(dir.path, "fr.o")}` + ` ${path.join(dir.path, "fr.o")}` +
` ${path.join(dir.path, baseName + ".cpp")} ` + ` ${path.join(dir.path, baseName + ".cpp")} ` +
` -o ${path.join(dir.path, baseName)}` + ` -o ${path.join(dir.path, baseName)}` +

View File

@@ -384,9 +384,9 @@ module.exports = function buildRuntime(module, builder) {
"error", "error",
c.i32_const(errs.ACCESSING_NOT_ASSIGNED_SIGNAL.code), c.i32_const(errs.ACCESSING_NOT_ASSIGNED_SIGNAL.code),
c.i32_const(errs.ACCESSING_NOT_ASSIGNED_SIGNAL.pointer), c.i32_const(errs.ACCESSING_NOT_ASSIGNED_SIGNAL.pointer),
c.i32_const(0), c.getLocal("cIdx"),
c.i32_const(0), c.getLocal("component"),
c.i32_const(0), c.getLocal("signal"),
c.i32_const(0) c.i32_const(0)
) )
) )
@@ -473,7 +473,7 @@ module.exports = function buildRuntime(module, builder) {
); );
f.addCode( f.addCode(
c.if( // If ( mapIsInput[s >> 5] & 1 << (s & 0x1f) ) c.if( // If ( mapIsInput[s >> 5] & (1 << (s & 0x1f)) )
c.i32_and( c.i32_and(
c.i32_load( c.i32_load(
c.i32_add( c.i32_add(
@@ -619,6 +619,35 @@ module.exports = function buildRuntime(module, builder) {
)); ));
} }
function buildCheckAssert() {
const f = module.addFunction("checkAssert");
f.addParam("cIdx", "i32");
f.addParam("pA", "i32");
f.addParam("pStr", "i32");
const c = f.getCodeBuilder();
f.addCode(ifSanityCheck(c,
c.if (
c.i32_eqz(
c.call(
"Fr_isTrue",
c.getLocal("pA"),
)
),
c.call(
"error",
c.i32_const(errs.ASSERT_DOES_NOT_MATCH.code),
c.i32_const(errs.ASSERT_DOES_NOT_MATCH.pointer),
c.getLocal("cIdx"),
c.getLocal("pA"),
c.getLocal("pStr"),
c.i32_const(0)
)
)
));
}
function buildGetNVars() { function buildGetNVars() {
const f = module.addFunction("getNVars"); const f = module.addFunction("getNVars");
f.setReturnType("i32"); f.setReturnType("i32");
@@ -823,6 +852,7 @@ module.exports = function buildRuntime(module, builder) {
buildComponentFinished(); buildComponentFinished();
buildCheckConstraint(); buildCheckConstraint();
buildCheckAssert();
buildGetNVars(); buildGetNVars();
buildGetFrLen(); buildGetFrLen();

View File

@@ -98,6 +98,9 @@ class CodeBuilderWasm {
this.ops.push({op: "CHECKCONSTRAINT", a, b, strErr}); this.ops.push({op: "CHECKCONSTRAINT", a, b, strErr});
} }
checkAssert(a, strErr) {
this.ops.push({op: "CHECKASSERT", a, strErr});
}
concat(cb) { concat(cb) {
this.ops.push(...cb.ops); this.ops.push(...cb.ops);
@@ -332,6 +335,15 @@ class CodeBuilderWasm {
c.i32_const(this.fnBuilder.builder.module.allocString(o.strErr)) c.i32_const(this.fnBuilder.builder.module.allocString(o.strErr))
) )
); );
} else if (o.op == "CHECKASSERT") {
code.push(
c.call(
"checkAssert",
c.getLocal("cIdx"),
this.fnBuilder._deRefFr(c, o.a),
c.i32_const(this.fnBuilder.builder.module.allocString(o.strErr))
)
);
} else if (o.op == "LOG") { } else if (o.op == "LOG") {
code.push( code.push(
c.call( c.call(

View File

@@ -7,4 +7,5 @@ module.exports = {
SIGNAL_ASSIGNED_TWICE: {code: 6, str: "Signal assigned twice"}, SIGNAL_ASSIGNED_TWICE: {code: 6, str: "Signal assigned twice"},
CONSTRAIN_DOES_NOT_MATCH: {code: 7, str: "Constraint doesn't match"}, CONSTRAIN_DOES_NOT_MATCH: {code: 7, str: "Constraint doesn't match"},
MAPISINPUT_DONT_MATCH: {code: 8, str: "MapIsInput don't match"}, MAPISINPUT_DONT_MATCH: {code: 8, str: "MapIsInput don't match"},
ASSERT_DOES_NOT_MATCH: {code: 9, str: "Assert not satisfied"},
}; };

View File

@@ -78,7 +78,7 @@ function buildEntryTables(ctx) {
}); });
} }
ctx.builder.addComponentEntriesTable(componentEntriesTableName, componentEntriesTable); ctx.builder.addComponentEntriesTable(componentEntriesTableName, componentEntriesTable, i);
ctx.components[i].htName = htName; ctx.components[i].htName = htName;
ctx.components[i].etName = componentEntriesTableName; ctx.components[i].etName = componentEntriesTableName;

View File

@@ -134,7 +134,7 @@ async function compile(srcFile, options) {
measures.generateC = -performance.now(); measures.generateC = -performance.now();
ctx.builder = new BuilderC(options.prime, ctx.verbose); ctx.builder = new BuilderC(options.prime, ctx.verbose);
build(ctx); build(ctx);
await ctx.builder.build(options.cSourceFile); await ctx.builder.build(options.cSourceFile, options.dataFile);
measures.generateC += performance.now(); measures.generateC += performance.now();
} }
@@ -183,28 +183,36 @@ function classifySignals(ctx) {
function priorize(t1, t2) { function priorize(t1, t2) {
if ((t1 == ERROR) || (t2==ERROR)) return ERROR; if ((t1 == ERROR) || (t2==ERROR)) return ERROR;
if (t1 == ctx.stINTERNAL) {
return t2;
} else if (t2==ctx.stINTERNAL) {
return t1;
}
if ((t1 == ctx.stONE) || (t2 == ctx.stONE)) return ctx.stONE; if ((t1 == ctx.stONE) || (t2 == ctx.stONE)) return ctx.stONE;
if ((t1 == ctx.stOUTPUT) || (t2 == ctx.stOUTPUT)) return ctx.stOUTPUT; if ((t1 == ctx.stOUTPUT) || (t2 == ctx.stOUTPUT)) return ctx.stOUTPUT;
if ((t1 == ctx.stPUBINPUT) || (t2 == ctx.stPUBINPUT)) return ctx.stPUBINPUT;
if ((t1 == ctx.stPRVINPUT) || (t2 == ctx.stPRVINPUT)) return ctx.stPRVINPUT;
if ((t1 == ctx.stINTERNAL) || (t2 == ctx.stINTERNAL)) return ctx.stINTERNAL;
if ((t1 == ctx.stCONSTANT) || (t2 == ctx.stCONSTANT)) return ctx.stCONSTANT; if ((t1 == ctx.stCONSTANT) || (t2 == ctx.stCONSTANT)) return ctx.stCONSTANT;
if ((t1 == ctx.stDISCARDED) || (t2 == ctx.stDISCARDED)) return ctx.stDISCARDED; if ((t1 == ctx.stDISCARDED) || (t2 == ctx.stDISCARDED)) return ctx.stDISCARDED;
if (t1!=t2) return ERROR; if (t1!=t2) return ERROR;
return t1; return t1;
} }
for (let i=0; i<ctx.constraints.length; i++) {
if ((ctx.verbose)&&(i%100000 == 0)) console.log(`marking as internal: ${i}/${ctx.constraints.length}`);
const c = ctx.constraints[i];
for (let s in c.a.coefs) ctx.signals[s].c = ctx.stINTERNAL;
for (let s in c.b.coefs) ctx.signals[s].c = ctx.stINTERNAL;
for (let s in c.c.coefs) ctx.signals[s].c = ctx.stINTERNAL;
}
// First classify the signals // First classify the signals
for (let s=0; s<ctx.signals.length; s++) { for (let s=0; s<ctx.signals.length; s++) {
if ((ctx.verbose)&&(s%100000 == 0)) console.log(`classify signals: ${s}/${ctx.signals.length}`); if ((ctx.verbose)&&(s%100000 == 0)) console.log(`classify signals: ${s}/${ctx.signals.length}`);
const signal = ctx.signals[s]; const signal = ctx.signals[s];
let tAll = ctx.stINTERNAL; let tAll = ctx.stDISCARDED;
let lSignal = signal; let lSignal = signal;
let end = false; let end = false;
while (!end) { while (!end) {
let t = lSignal.c || ctx.stINTERNAL; let t = lSignal.c || ctx.stDISCARDED;
if (s == 0) { if (s == 0) {
t = ctx.stONE; t = ctx.stONE;
} else if (lSignal.o & ctx.MAIN) { } else if (lSignal.o & ctx.MAIN) {
@@ -318,41 +326,53 @@ async function reduceConstrains(ctx) {
const c = ctx.constraints[i]; const c = ctx.constraints[i];
for (let s in c.a.coefs) { for (let s in c.a.coefs) {
if (!insertedSig[s]) { if (!insertedSig[s]) {
if (!sig2constraint[s]) sig2constraint[s] = []; if (!sig2constraint[s]) sig2constraint[s] = {};
sig2constraint[s].push(i); sig2constraint[s][i] = true;
insertedSig[s] = true; insertedSig[s] = true;
} }
} }
for (let s in c.b.coefs) { for (let s in c.b.coefs) {
if (!insertedSig[s]) { if (!insertedSig[s]) {
if (!sig2constraint[s]) sig2constraint[s] = []; if (!sig2constraint[s]) sig2constraint[s] = {};
sig2constraint[s].push(i); sig2constraint[s][i] = true;
insertedSig[s] = true; insertedSig[s] = true;
} }
} }
for (let s in c.c.coefs) { for (let s in c.c.coefs) {
if (!insertedSig[s]) { if (!insertedSig[s]) {
if (!sig2constraint[s]) sig2constraint[s] = []; if (!sig2constraint[s]) sig2constraint[s] = {};
sig2constraint[s].push(i); sig2constraint[s][i] = true;
insertedSig[s] = true; insertedSig[s] = true;
} }
} }
possibleConstraints[i] = i; possibleConstraints[i] = ctx.constraints.length - i -1;
} }
let totalRemoved = 0;
while (possibleConstraints.length >0) { while (possibleConstraints.length >0) {
if (possibleConstraints.length>1<<20) {
nextPossibleConstraints = new BigArray(); nextPossibleConstraints = new BigArray();
removedSignals = new BigArray(); } else {
nextPossibleConstraints = {};
}
removedSignals = {};
nRemoved = 0; nRemoved = 0;
lIdx = new BigArray(); lIdx = {};
for (let i=0;i<possibleConstraints.length;i++) { for (let i=0;i<possibleConstraints.length;i++) {
if ((ctx.verbose)&&(i%10000 == 0)) { if ((ctx.verbose)&&(i%10000 == 0)) {
await Promise.resolve(); await Promise.resolve();
console.log(`reducing constraints: ${i}/${possibleConstraints.length} reduced: ${nRemoved}`); console.log(`reducing constraints: ${i}/${possibleConstraints.length} reduced: ${nRemoved}`);
} }
const c = ctx.constraints[possibleConstraints[i]]; const c = ctx.constraints[possibleConstraints[i]];
if (!c) continue; if (!c) continue;
// Limit of number of lelements removed per step
if (nRemoved>5000000) {
nextPossibleConstraints[possibleConstraints[i]] = true;
continue;
}
// Swap a and b if b has more variables. // Swap a and b if b has more variables.
if (Object.keys(c.b).length > Object.keys(c.a).length) { if (Object.keys(c.b).length > Object.keys(c.a).length) {
const aux = c.a; const aux = c.a;
@@ -378,27 +398,37 @@ async function reduceConstrains(ctx) {
const freeC = substituteRemoved(c.c); const freeC = substituteRemoved(c.c);
const isolatedSignal = getFirstInternalSignal(ctx, freeC); const isolatedSignal = getFirstInternalSignal(ctx, freeC);
if (isolatedSignal) { if (isolatedSignal) {
// console.log(isolatedSignal);
// console.log(freeC);
removedSignals[isolatedSignal] = isolateSignal(freeC, isolatedSignal); removedSignals[isolatedSignal] = isolateSignal(freeC, isolatedSignal);
if (lIdx[isolatedSignal]) { if (lIdx[isolatedSignal]) {
lIdx[isolatedSignal].forEach( (s) => { const sigs = Object.keys(lIdx[isolatedSignal]);
for (let k=0; k<sigs.length; k++) {
const s = sigs[k];
const oldLC = removedSignals[s];
removedSignals[s] = substitute(removedSignals[s], isolatedSignal, removedSignals[isolatedSignal]); removedSignals[s] = substitute(removedSignals[s], isolatedSignal, removedSignals[isolatedSignal]);
}); if (oldLC !== removedSignals[s]) addTolIdx(removedSignals[s], s);
}
} }
addTolIdx(removedSignals[isolatedSignal], isolatedSignal); addTolIdx(removedSignals[isolatedSignal], isolatedSignal);
ctx.constraints[possibleConstraints[i]] = null; ctx.constraints[possibleConstraints[i]] = null;
nRemoved ++; nRemoved ++;
sig2constraint[isolatedSignal].forEach( (s) => { delete lIdx[isolatedSignal];
nextPossibleConstraints[s] = true;
}); const cts = Object.keys(sig2constraint[isolatedSignal]);
for (let k=0; k<cts.length; k++) {
if (ctx.constraints[cts[k]]) nextPossibleConstraints[cts[k]] = true;
}
} }
} }
} }
if (nextPossibleConstraints.getKeys) {
nextPossibleConstraints = nextPossibleConstraints.getKeys(); nextPossibleConstraints = nextPossibleConstraints.getKeys();
} else {
nextPossibleConstraints = Object.keys(nextPossibleConstraints);
}
for (let i=0; i<nextPossibleConstraints.length;i++) { for (let i=0; i<nextPossibleConstraints.length;i++) {
if ((ctx.verbose)&&(i%10000 == 0)) { if ((ctx.verbose)&&(i%10000 == 0)) {
@@ -408,9 +438,9 @@ async function reduceConstrains(ctx) {
const c = ctx.constraints[nextPossibleConstraints[i]]; const c = ctx.constraints[nextPossibleConstraints[i]];
if (c) { if (c) {
const nc = { const nc = {
a: substituteRemoved(c.a), a: substituteRemoved(c.a, nextPossibleConstraints[i]),
b: substituteRemoved(c.b), b: substituteRemoved(c.b, nextPossibleConstraints[i]),
c: substituteRemoved(c.c) c: substituteRemoved(c.c, nextPossibleConstraints[i])
}; };
if (ctx.lc.isZero(nc)) { if (ctx.lc.isZero(nc)) {
delete ctx.constraints[nextPossibleConstraints[i]]; delete ctx.constraints[nextPossibleConstraints[i]];
@@ -420,7 +450,7 @@ async function reduceConstrains(ctx) {
} }
} }
const removedSignalsList = removedSignals.getKeys; const removedSignalsList = Object.keys(removedSignals);
for (let i=0; i<removedSignalsList.length; i++) { for (let i=0; i<removedSignalsList.length; i++) {
if ((ctx.verbose )&&(i%100000 == 0)) console.log(`removing signals: ${i}/${removedSignalsList.length}`); if ((ctx.verbose )&&(i%100000 == 0)) console.log(`removing signals: ${i}/${removedSignalsList.length}`);
@@ -431,11 +461,23 @@ async function reduceConstrains(ctx) {
lSignal = ctx.signals[lSignal.e]; lSignal = ctx.signals[lSignal.e];
} }
sig2constraint[s] = null;
lSignal.c = ctx.stDISCARDED; lSignal.c = ctx.stDISCARDED;
} }
possibleConstraints = nextPossibleConstraints; /*
possibleConstraints = new BigArray();
// Reverse
for (let i=0; i<nextPossibleConstraints.length; i++) {
possibleConstraints[i] = nextPossibleConstraints[nextPossibleConstraints.length -1 -i];
} }
*/
possibleConstraints = nextPossibleConstraints;
totalRemoved += nRemoved;
if (ctx.verbose) console.log(`Removed: ${totalRemoved} TotalConstraints: ${ctx.constraints.length}` );
}
let o=0; let o=0;
for (let i=0; i<ctx.constraints.length;i++) { for (let i=0; i<ctx.constraints.length;i++) {
@@ -476,7 +518,7 @@ async function reduceConstrains(ctx) {
return eq; return eq;
} }
function substituteRemoved(lc) { function substituteRemoved(lc, idxConstraint) {
const newLc = ctx.lc._clone(lc); const newLc = ctx.lc._clone(lc);
for (let k in lc.coefs) { for (let k in lc.coefs) {
if (removedSignals[k]) { if (removedSignals[k]) {
@@ -491,6 +533,10 @@ async function reduceConstrains(ctx) {
newLc.coefs[k2] = newP; newLc.coefs[k2] = newP;
} }
} }
if ((typeof idxConstraint != "undefined")&&(k2!=0)) {
if (!sig2constraint[k2]) sig2constraint[k2] = {};
sig2constraint[k2][idxConstraint] = true;
}
} }
} }
} }
@@ -524,318 +570,16 @@ async function reduceConstrains(ctx) {
} }
function addTolIdx(lc, newS) { function addTolIdx(lc, newS) {
for (let s in lc.coefs) { const sigs = Object.keys(lc.coefs);
if (!lIdx[s]) lIdx[s] = []; for (let k=0; k<sigs.length; k++) {
lIdx[s].push(newS); const s = sigs[k];
if (s) {
if (!lIdx[s]) lIdx[s] = {};
lIdx[s][newS] = true;
} }
} }
}
function reduceConstrains_old(ctx) {
indexVariables();
let possibleConstraints = ctx.constraints;
let ii=0;
while (possibleConstraints.length>0) {
let nextPossibleConstraints = new BigArray();
for (let i=0; i<possibleConstraints.length; i++) {
ii++;
if ((ctx.verbose)&&(ii%10000 == 0)) console.log("reducing constraints: ", i);
if (!ctx.constraints[i]) continue;
const c = ctx.constraints[i];
// Swap a and b if b has more variables.
if (Object.keys(c.b).length > Object.keys(c.a).length) {
const aux = c.a;
c.a=c.b;
c.b=aux;
}
// Mov to C if possible.
if (isConstant(c.a)) {
const ct = {t: "N", v: c.a.coefs[sONE]};
c.c = ctx.lc.add(ctx.lc.mul(c.b, ct), c.c);
c.a = { t: "LC", coefs: {} };
c.b = { t: "LC", coefs: {} };
}
if (isConstant(c.b)) {
const ct = {t: "N", v: c.b.coefs[sONE]};
c.c = ctx.lc.add(ctx.lc.mul(c.a, ct), c.c);
c.a = { t: "LC", coefs: {} };
c.b = { t: "LC", coefs: {} };
}
if (ctx.lc.isZero(c.a) || ctx.lc.isZero(c.b)) {
const isolatedSignal = getFirstInternalSignal(ctx, c.c);
if (isolatedSignal) {
let lSignal = ctx.signals[isolatedSignal];
while (lSignal.e>=0) {
lSignal = ctx.signals[lSignal.e];
}
const isolatedSignalEquivalence = {
t: "LC",
coefs: {}
};
const invCoef = ctx.F.inv(c.c.coefs[isolatedSignal]);
for (const s in c.c.coefs) {
if (s != isolatedSignal) {
const v = ctx.F.mul( ctx.F.neg(c.c.coefs[s]), invCoef);
if (!ctx.F.isZero(v)) {
isolatedSignalEquivalence.coefs[s] = v;
}
}
}
for (let j in lSignal.inConstraints) {
if ((j!=i)&&(ctx.constraints[j])) {
ctx.constraints[j] = ctx.lc.substitute(ctx.constraints[j], isolatedSignal, isolatedSignalEquivalence);
linkSignalsConstraint(j);
if (j<i) {
nextPossibleConstraints.push(j);
}
}
}
ctx.constraints[i] = null;
lSignal.c = ctx.stDISCARDED;
} else {
if (ctx.lc.isZero(c.c)) ctx.constraints[i] = null;
}
}
}
possibleConstraints = nextPossibleConstraints;
}
unindexVariables();
// Pack the constraints
let o = 0;
for (let i=0; i<ctx.constraints.length; i++) {
if (ctx.constraints[i]) {
if (o != i) {
ctx.constraints[o] = ctx.constraints[i];
}
o++;
}
}
ctx.constraints.length = o;
function indexVariables() {
for (let i=0; i<ctx.constraints.length; i++) linkSignalsConstraint(i);
}
function linkSignalsConstraint(cidx) {
const ct = ctx.constraints[cidx];
for (let k in ct.a.coefs) linkSignal(k, cidx);
for (let k in ct.b.coefs) linkSignal(k, cidx);
for (let k in ct.c.coefs) linkSignal(k, cidx);
}
function unindexVariables() {
for (let s=0; s<ctx.signals.length; s++) {
let lSignal = ctx.signals[s];
while (lSignal.e>=0) {
lSignal = ctx.signals[lSignal.e];
}
if (lSignal.inConstraints) delete lSignal.inConstraints;
}
}
/*
function unlinkSignal(signalName, cidx) {
let lSignal = ctx.signals[signalName];
while (lSignal.e>=0) {
lSignal = ctx.signals[lSignal.e];
}
if ((lSignal.inConstraints)&&(lSignal.inConstraints[cidx])) {
delete lSignal.inConstraints[cidx];
}
}
*/
function linkSignal(signalName, cidx) {
let lSignal = ctx.signals[signalName];
while (lSignal.e>=0) {
lSignal = ctx.signals[lSignal.e];
}
if (!lSignal.inConstraints) lSignal.inConstraints = {};
lSignal.inConstraints[cidx] = true;
}
function getFirstInternalSignal(ctx, l) {
for (let k in l.coefs) {
const signal = ctx.signals[k];
if (signal.c == ctx.stINTERNAL) return k;
}
return null;
}
function isConstant(l) {
for (let k in l.coefs) {
if ((k != sONE) && (!ctx.F.isZero(l.coefs[k]))) return false;
}
if (!l.coefs[sONE] || ctx.F.isZero(l.coefs[sONE])) return false;
return true;
}
}
/*
function buildCircuitDef(ctx, mainCode) {
const res = {
mainCode: mainCode
};
res.signalName2Idx = ctx.signalName2Idx;
res.components = [];
res.componentName2Idx = {};
for (let c in ctx.components) {
const idCoponent = res.components.length;
res.components.push({
name: c,
params: ctx.components[c].params,
template: ctx.components[c].template,
inputSignals: 0
});
res.componentName2Idx[c] = idCoponent;
}
res.signals = new Array(ctx.signalNames.length);
for (let i=0; i<ctx.signalNames.length; i++) {
res.signals[i] = {
names: ctx.signalNames[i],
triggerComponents: []
};
ctx.signalNames[i].map( (fullName) => {
const idComponet = res.componentName2Idx[ctx.signals[fullName].component];
if (ctx.signals[fullName].direction == "IN") {
res.signals[i].triggerComponents.push(idComponet);
res.components[idComponet].inputSignals++;
}
});
}
res.constraints = buildConstraints(ctx);
res.templates = ctx.templates;
res.functions = {};
for (let f in ctx.functions) {
res.functions[f] = {
params: ctx.functionParams[f],
func: ctx.functions[f]
};
}
res.nPrvInputs = ctx.totals.prvInput;
res.nPubInputs = ctx.totals.pubInput;
res.nInputs = res.nPrvInputs + res.nPubInputs;
res.nOutputs = ctx.totals.output;
res.nVars = res.nInputs + res.nOutputs + ctx.totals.one + ctx.totals.internal;
res.nConstants = ctx.totals.constant;
res.nSignals = res.nVars + res.nConstants;
return res;
}
*/
/*
Build constraints
A constraint like this
[s1 + 2*s2 + 3*s3] * [ s2 + 5*s4] - [s0 ] = 0
[ 5*s2 + 6*s3] * [ s2 + ] - [s0 + 2* s2] = 0
[s1 + s3] * [ s2 + 5*s3] - [s4 ] = 0
is converted to
[
[{"1":"1","2":"2","3":"3"} , {"2":"1","4":"5"} , {"0":"1" }],
[{ "2":"5","3":"6"} , {"2":"1" } , {"0":"1", "2":"2"}],
[{"1":"1", "3":"1"} , {"2":"1","3":"5"} , {"4":"1" }]
]
^ ^ ^
| | |
A B C
*/
/*
function buildConstraints(ctx) {
const res = [];
function fillLC(dst, src) {
if (src.t != "LC") throw new Error("Constraint is not a LINEARCOMBINATION");
for (let s in src.coefs) {
const v = src.coefs[s].toString();
const id = ctx.signalName2Idx[s];
dst[id] = v;
}
}
for (let i=0; i<ctx.constraints.length; i++) {
const A = {};
const B = {};
const C = {};
fillLC(A, ctx.constraints[i].a);
fillLC(B, ctx.constraints[i].b);
fillLC(C, ctx.lc.negate(ctx.constraints[i].c));
res.push([A,B,C]);
}
return res;
}
*/
/*
function buildSyms(ctx, strm) {
let nSyms;
addSymbolsComponent(ctx.mainComponent + ".", ctx.getComponentIdx(ctx.mainComponent));
function addSymbolsComponent(prefix, idComponet) {
for (let n in ctx.components[idComponet].names.o) {
const entrie = ctx.components[idComponet].names.o[n];
addSymbolArray(prefix+n, entrie.type, entrie.sizes, entrie.offset);
}
}
function addSymbolArray(prefix, type, sizes, offset) {
if (sizes.length==0) {
if (type == "S") {
let s=offset;
while (ctx.signals[s].e >= 0) s = ctx.signals[s].e;
let wId = ctx.signals[s].id;
if (typeof(wId) == "undefined") wId=-1;
strm.write(`${offset},${wId},${prefix}\n`);
nSyms ++;
if ((ctx.verbose)&&(nSyms%10000 == 0)) console.log("Symbols saved: "+nSyms);
} else {
addSymbolsComponent(prefix+".", offset);
}
return 1;
} else {
let acc = 0;
for (let i=0; i<sizes[0]; i++) {
acc += addSymbolArray(`${prefix}[${i}]`, type, sizes.slice(1), offset + acc );
}
return acc;
}
} }
} }
*/

View File

@@ -567,9 +567,13 @@ function execFunctionCall(ctx, ast) {
return; return;
} }
if (ast.name == "assert") { if (ast.name == "assert") {
ast.fileName = ctx.fileName;
ast.filePath = ctx.filePath;
const v = exec(ctx, ast.params[0]); const v = exec(ctx, ast.params[0]);
const ev = val(ctx, v, ast); const ev = val(ctx, v, ast);
if (ctx.F.isZero(ev)) return ctx.throwError(ast, "Assertion failed"); if ((typeof ev.v !== "undefined")&&(ctx.F.isZero(ev.v))) return ctx.throwError(ast, "Assertion failed");
return;
} }
const fnc = ctx.functions[ast.name]; const fnc = ctx.functions[ast.name];
@@ -697,6 +701,9 @@ function execPin(ctx, ast) {
if (sel.v[0].t != "N") return NQVAL; if (sel.v[0].t != "N") return NQVAL;
selsP.push(Scalar.toNumber(sel.v[0].v)); selsP.push(Scalar.toNumber(sel.v[0].v));
} }
if (!ctx.components[cIdx]) {
return ctx.throwError(ast, "Component not defined yet");
}
const sIdx = ctx.components[cIdx].names.getSignalIdx(ast.pin.name, selsP); const sIdx = ctx.components[cIdx].names.getSignalIdx(ast.pin.name, selsP);
if (sIdx<0) return ctx.throwError(ast, "Signal not defined:" + buildFullName() ); if (sIdx<0) return ctx.throwError(ast, "Signal not defined:" + buildFullName() );

View File

@@ -723,7 +723,15 @@ function genVarAssignment(ctx, ast, lRef, sels, rRef) {
if (instantiated) { if (instantiated) {
if (offset.used) { if (offset.used) {
ctx.codeBuilder.copyN(left.label, ["R", offset.label], ["R", right.label], right.sizes[0]); let ot;
if (offset.type == "BIGINT") {
ot = "R";
} else if (offset.type == "INT") {
ot= "RI";
} else {
assert(false);
}
ctx.codeBuilder.copyN(left.label, [ot, offset.label], ["R", right.label], right.sizes[0]);
} else { } else {
ctx.codeBuilder.copyN(left.label, ["V", offset.value[0]], ["R", right.label], right.sizes[0]); ctx.codeBuilder.copyN(left.label, ["V", offset.value[0]], ["R", right.label], right.sizes[0]);
} }
@@ -863,6 +871,12 @@ function genFunctionCall(ctx, ast) {
ctx.codeBuilder.log(toRefA_Fr1(ctx, ast.params[0], vRef)); ctx.codeBuilder.log(toRefA_Fr1(ctx, ast.params[0], vRef));
return vRef; return vRef;
} }
if (ast.name == "assert") {
const strErr = ast.fileName + ":" + ast.first_line + ":" + ast.first_column;
const vRef = gen(ctx, ast.params[0]);
ctx.codeBuilder.checkAssert(toRefA_Fr1(ctx, ast.params[0], vRef), strErr);
return vRef;
}
const params = []; const params = [];
for (let i=0; i<ast.params.length; i++) { for (let i=0; i<ast.params.length; i++) {
const pRef = gen(ctx, ast.params[i]); const pRef = gen(ctx, ast.params[i]);

View File

@@ -8,8 +8,7 @@ module.exports.buildR1cs = buildR1cs;
async function buildR1cs(ctx, fileName) { async function buildR1cs(ctx, fileName) {
const fd = await fastFile.createOverride(fileName); const fd = await fastFile.createOverride(fileName, 1<<24, 1<<22);
const buffBigInt = new Uint8Array(ctx.F.n8); const buffBigInt = new Uint8Array(ctx.F.n8);
@@ -59,7 +58,7 @@ async function buildR1cs(ctx, fileName) {
if ((ctx.verbose)&&(i%10000 == 0)) { if ((ctx.verbose)&&(i%10000 == 0)) {
if (ctx.verbose) console.log("writing constraint: ", i); if (ctx.verbose) console.log("writing constraint: ", i);
} }
await writeConstraint(ctx.constraints[i]); await writeConstraint(ctx.constraints[i], i);
} }
const constraintsSize = fd.pos - pConstraintsSize - 8; const constraintsSize = fd.pos - pConstraintsSize - 8;
@@ -89,13 +88,13 @@ async function buildR1cs(ctx, fileName) {
const mapSize = fd.pos - pMapSize - 8; const mapSize = fd.pos - pMapSize - 8;
// Write sizes // Write sizes
await fd.writeULE32(headerSize, pHeaderSize); await fd.writeULE64(headerSize, pHeaderSize);
await fd.writeULE32(constraintsSize, pConstraintsSize); await fd.writeULE64(constraintsSize, pConstraintsSize);
await fd.writeULE32(mapSize, pMapSize); await fd.writeULE64(mapSize, pMapSize);
await fd.close(); await fd.close();
function writeConstraint(c) { function writeConstraint(c, ctIdx) {
const n8 = ctx.F.n8; const n8 = ctx.F.n8;
const idxA = Object.keys(c.a.coefs); const idxA = Object.keys(c.a.coefs);
const idxB = Object.keys(c.b.coefs); const idxB = Object.keys(c.b.coefs);
@@ -109,6 +108,7 @@ async function buildR1cs(ctx, fileName) {
const coef = idxA[i]; const coef = idxA[i];
let lSignal = ctx.signals[coef]; let lSignal = ctx.signals[coef];
while (lSignal.e >=0 ) lSignal = ctx.signals[lSignal.e]; while (lSignal.e >=0 ) lSignal = ctx.signals[lSignal.e];
if (lSignal.id >= NWires) throw new Error("Signal Coef A: " + coef + " Constraint: " + ctIdx + " id: " + lSignal.id);
buffV.setUint32(o, lSignal.id, true); o+=4; buffV.setUint32(o, lSignal.id, true); o+=4;
ctx.F.toRprLE(buff, o, c.a.coefs[coef]); o+=n8; ctx.F.toRprLE(buff, o, c.a.coefs[coef]); o+=n8;
} }
@@ -118,8 +118,8 @@ async function buildR1cs(ctx, fileName) {
const coef = idxB[i]; const coef = idxB[i];
let lSignal = ctx.signals[coef]; let lSignal = ctx.signals[coef];
while (lSignal.e >=0 ) lSignal = ctx.signals[lSignal.e]; while (lSignal.e >=0 ) lSignal = ctx.signals[lSignal.e];
if (lSignal.id >= NWires) throw new Error("Signal Coef B: " + coef + " Constraint: " + ctIdx + " id: " + lSignal.id);
buffV.setUint32(o, lSignal.id, true); o+=4; buffV.setUint32(o, lSignal.id, true); o+=4;
ctx.F.toRprLE(buff, o, c.b.coefs[coef]); o+=n8; ctx.F.toRprLE(buff, o, c.b.coefs[coef]); o+=n8;
} }
@@ -128,6 +128,7 @@ async function buildR1cs(ctx, fileName) {
const coef = idxC[i]; const coef = idxC[i];
let lSignal = ctx.signals[coef]; let lSignal = ctx.signals[coef];
while (lSignal.e >=0 ) lSignal = ctx.signals[lSignal.e]; while (lSignal.e >=0 ) lSignal = ctx.signals[lSignal.e];
if (lSignal.id >= NWires) throw new Error("Signal Coef C: " + coef + " Constraint: " + ctIdx + " id: " + lSignal.id);
buffV.setUint32(o, lSignal.id, true); o+=4; buffV.setUint32(o, lSignal.id, true); o+=4;
ctx.F.toRprLE(buff, o, ctx.F.neg(c.c.coefs[coef])); o+=n8; ctx.F.toRprLE(buff, o, ctx.F.neg(c.c.coefs[coef])); o+=n8;
} }

View File

@@ -10,6 +10,7 @@ module.exports.fnvHash = fnvHash;
module.exports.sameSizes = sameSizes; module.exports.sameSizes = sameSizes;
module.exports.isDefined = isDefined; module.exports.isDefined = isDefined;
module.exports.accSizes2Str = accSizes2Str; module.exports.accSizes2Str = accSizes2Str;
module.exports.setUint64 = setUint64;
function ident(text) { function ident(text) {
if (typeof text === "string") { if (typeof text === "string") {
@@ -90,6 +91,14 @@ function accSizes2Str(sizes) {
return `[${sizes[0]/sizes[1]}]`+accSizes2Str(sizes.slice(1)); return `[${sizes[0]/sizes[1]}]`+accSizes2Str(sizes.slice(1));
} }
function setUint64(buffV, o, n) {
const sLSB = n >>> 0;
const sMSB = (n - sLSB) / 0x100000000;
buffV.setUint32(o, sLSB , true);
buffV.setUint32(o+4, sMSB , true);
}