circom-helper
Version:
A convenient way for developers to compile, cache, and execute circom circuits, as well as to generate proofs.
192 lines • 8.65 kB
JavaScript
"use strict";
// From iden3/snarkjs
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.read = exports.readHeader = exports.writeBin = exports.write = void 0;
var ff = require('ffjavascript');
var Scalar = ff.Scalar;
var binFileUtils = require('@iden3/binfileutils');
function write(fd, witness, prime) {
return __awaiter(this, void 0, void 0, function () {
var n8, i;
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, binFileUtils.startWriteSection(fd, 1)];
case 1:
_a.sent();
n8 = (Math.floor((Scalar.bitLength(prime) - 1) / 64) + 1) * 8;
return [4 /*yield*/, fd.writeULE32(n8)];
case 2:
_a.sent();
return [4 /*yield*/, binFileUtils.writeBigInt(fd, prime, n8)];
case 3:
_a.sent();
return [4 /*yield*/, fd.writeULE32(witness.length)];
case 4:
_a.sent();
return [4 /*yield*/, binFileUtils.endWriteSection(fd)];
case 5:
_a.sent();
return [4 /*yield*/, binFileUtils.startWriteSection(fd, 2)];
case 6:
_a.sent();
i = 0;
_a.label = 7;
case 7:
if (!(i < witness.length)) return [3 /*break*/, 10];
return [4 /*yield*/, binFileUtils.writeBigInt(fd, witness[i], n8)];
case 8:
_a.sent();
_a.label = 9;
case 9:
i++;
return [3 /*break*/, 7];
case 10: return [4 /*yield*/, binFileUtils.endWriteSection(fd, 2)];
case 11:
_a.sent();
return [2 /*return*/];
}
});
});
}
exports.write = write;
function writeBin(fd, witnessBin, prime) {
return __awaiter(this, void 0, void 0, function () {
var n8;
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, binFileUtils.startWriteSection(fd, 1)];
case 1:
_a.sent();
n8 = (Math.floor((Scalar.bitLength(prime) - 1) / 64) + 1) * 8;
return [4 /*yield*/, fd.writeULE32(n8)];
case 2:
_a.sent();
return [4 /*yield*/, binFileUtils.writeBigInt(fd, prime, n8)];
case 3:
_a.sent();
if (witnessBin.byteLength % n8 != 0) {
throw new Error("Invalid witness length");
}
return [4 /*yield*/, fd.writeULE32(witnessBin.byteLength / n8)];
case 4:
_a.sent();
return [4 /*yield*/, binFileUtils.endWriteSection(fd)];
case 5:
_a.sent();
return [4 /*yield*/, binFileUtils.startWriteSection(fd, 2)];
case 6:
_a.sent();
return [4 /*yield*/, fd.write(witnessBin)];
case 7:
_a.sent();
return [4 /*yield*/, binFileUtils.endWriteSection(fd)];
case 8:
_a.sent();
return [2 /*return*/];
}
});
});
}
exports.writeBin = writeBin;
function readHeader(fd, sections) {
return __awaiter(this, void 0, void 0, function () {
var n8, q, nWitness;
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, binFileUtils.startReadUniqueSection(fd, sections, 1)];
case 1:
_a.sent();
return [4 /*yield*/, fd.readULE32()];
case 2:
n8 = _a.sent();
return [4 /*yield*/, binFileUtils.readBigInt(fd, n8)];
case 3:
q = _a.sent();
return [4 /*yield*/, fd.readULE32()];
case 4:
nWitness = _a.sent();
return [4 /*yield*/, binFileUtils.endReadSection(fd)];
case 5:
_a.sent();
return [2 /*return*/, { n8: n8, q: q, nWitness: nWitness }];
}
});
});
}
exports.readHeader = readHeader;
function read(fileName) {
return __awaiter(this, void 0, void 0, function () {
var _a, fd, sections, _b, n8, nWitness, res, i, v;
return __generator(this, function (_c) {
switch (_c.label) {
case 0: return [4 /*yield*/, binFileUtils.readBinFile(fileName, "wtns", 2)];
case 1:
_a = _c.sent(), fd = _a.fd, sections = _a.sections;
return [4 /*yield*/, readHeader(fd, sections)];
case 2:
_b = _c.sent(), n8 = _b.n8, nWitness = _b.nWitness;
return [4 /*yield*/, binFileUtils.startReadUniqueSection(fd, sections, 2)];
case 3:
_c.sent();
res = [];
i = 0;
_c.label = 4;
case 4:
if (!(i < nWitness)) return [3 /*break*/, 7];
return [4 /*yield*/, binFileUtils.readBigInt(fd, n8)];
case 5:
v = _c.sent();
res.push(v);
_c.label = 6;
case 6:
i++;
return [3 /*break*/, 4];
case 7: return [4 /*yield*/, binFileUtils.endReadSection(fd)];
case 8:
_c.sent();
return [4 /*yield*/, fd.close()];
case 9:
_c.sent();
return [2 /*return*/, res];
}
});
});
}
exports.read = read;
//# sourceMappingURL=wtnsUtils.js.map