circom-helper
Version:
A convenient way for developers to compile, cache, and execute circom circuits, as well as to generate proofs.
114 lines • 5.5 kB
JavaScript
;
var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
return new (P || (P = Promise))(function (resolve, reject) {
function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
step((generator = generator.apply(thisArg, _arguments || [])).next());
});
};
var __generator = (this && this.__generator) || function (thisArg, body) {
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
function verb(n) { return function (v) { return step([n, v]); }; }
function step(op) {
if (f) throw new TypeError("Generator is already executing.");
while (_) try {
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
if (y = 0, t) op = [op[0] & 2, t.value];
switch (op[0]) {
case 0: case 1: t = op; break;
case 4: _.label++; return { value: op[1], done: false };
case 5: _.label++; y = op[1]; op = [0]; continue;
case 7: op = _.ops.pop(); _.trys.pop(); continue;
default:
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
if (t[2]) _.ops.pop();
_.trys.pop(); continue;
}
op = body.call(thisArg, _);
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
}
};
exports.__esModule = true;
exports.readNumInputs = void 0;
var fs = require('fs');
var path = require('path');
var ff = require('ffjavascript');
var readNumInputs = function (filepath) { return __awaiter(void 0, void 0, void 0, function () {
var fd, buffer, numSections, numPubInputs, numPrivInputs, ptr, i, sectionType, sectionSize;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
fd = fs.openSync(filepath, 'r');
buffer = Buffer.alloc(4);
return [4 /*yield*/, fs.readSync(fd, buffer, 0, 4, 8)];
case 1:
_a.sent();
numSections = ff.utils.leBuff2int(buffer);
ptr = 12;
i = 0;
_a.label = 2;
case 2:
if (!(i < numSections)) return [3 /*break*/, 9];
// section type
buffer = Buffer.alloc(4);
return [4 /*yield*/, fs.readSync(fd, buffer, 0, 4, ptr)];
case 3:
_a.sent();
sectionType = ff.utils.leBuff2int(buffer);
ptr += 4;
// sections ize
buffer = Buffer.alloc(8);
return [4 /*yield*/, fs.readSync(fd, buffer, 0, 4, ptr)];
case 4:
_a.sent();
sectionSize = Number(ff.utils.leBuff2int(buffer));
if (!(sectionType === BigInt(1))) return [3 /*break*/, 7];
ptr += 8 + (sectionSize - 20);
buffer = Buffer.alloc(4);
return [4 /*yield*/, fs.readSync(fd, buffer, 0, 4, ptr)];
case 5:
_a.sent();
numPubInputs = ff.utils.leBuff2int(buffer);
ptr += 4;
buffer = Buffer.alloc(4);
return [4 /*yield*/, fs.readSync(fd, buffer, 0, 4, ptr)];
case 6:
_a.sent();
numPrivInputs = ff.utils.leBuff2int(buffer);
return [2 /*return*/, { numPubInputs: numPubInputs, numPrivInputs: numPrivInputs }];
case 7:
ptr += 8 + Number(sectionSize);
_a.label = 8;
case 8:
i++;
return [3 /*break*/, 2];
case 9: throw new Error('Invalid R1CS file');
}
});
}); };
exports.readNumInputs = readNumInputs;
var run = function () { return __awaiter(void 0, void 0, void 0, function () {
var filepath, _a, _b;
return __generator(this, function (_c) {
switch (_c.label) {
case 0:
filepath = path.join(__dirname, '..', 'compiled', 'poseidon.r1cs');
_b = (_a = console).log;
return [4 /*yield*/, readNumInputs(filepath)];
case 1:
_b.apply(_a, [_c.sent()]);
return [2 /*return*/];
}
});
}); };
if (require.main === module) {
run();
}
//# sourceMappingURL=read_num_constraints.js.map