arnaucube/circom
1
0
Fork 0
mirror of https://github.com/arnaucube/circom.git synced 2026-02-06 18:56:40 +01:00
Code Issues Packages Projects Releases Wiki Activity

Optimize recursive constant dependency

Browse Source
This commit is contained in:
Jordi Baylina
2020-09-17 17:42:32 +02:00
parent 349a39dc95
commit 5dc54bb7d2
1 changed files with 10 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
src/compiler.js
View File

@@ -346,17 +346,24 @@ async function reduceConstrains(ctx) {
} else {
nextPossibleConstraints = {};
}
removedSignals = new BigArray();
removedSignals = {};
nRemoved = 0;
lIdx = new BigArray();
lIdx = {};
for (let i=0;i<possibleConstraints.length;i++) {
if ((ctx.verbose)&&(i%10000 == 0)) {
await Promise.resolve();
console.log(`reducing constraints: ${i}/${possibleConstraints.length} reduced: ${nRemoved}`);
}
const c = ctx.constraints[possibleConstraints[i]];
if (!c) continue;
// Limit of number of lelements removed per step
if (nRemoved>100000) {
nextPossibleConstraints[possibleConstraints[i]] = true;
continue;
}
// Swap a and b if b has more variables.
if (Object.keys(c.b).length > Object.keys(c.a).length) {
const aux = c.a;
@@ -434,7 +441,7 @@ async function reduceConstrains(ctx) {
}
}
const removedSignalsList = removedSignals.getKeys();
const removedSignalsList = Object.keys(removedSignals);
for (let i=0; i<removedSignalsList.length; i++) {
if ((ctx.verbose )&&(i%100000 == 0)) console.log(`removing signals: ${i}/${removedSignalsList.length}`);