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

Pedersen Hash done with tests

Browse Source
This commit is contained in:
Jordi Baylina
2018-11-13 10:57:54 +01:00
parent 9513ee2ff2
commit 4b147eca7f
9 changed files with 244497 additions and 208 deletions
Download Patch File Download Diff File Expand all files Collapse all files

57
calcpedersenbases/calcpedersenbases.js
View File

@@ -2,32 +2,7 @@ const bn128 = require("snarkjs").bn128;
const bigInt = require("snarkjs").bigInt;
const createBlakeHash = require("blake-hash");
const assert = require("assert");
function addPoint(a,b, q) {
const cta = bigInt("168700");
const d = bigInt("168696");
const res = [];
res[0] = bigInt((a[0]*b[1] + b[0]*a[1]) * bigInt(bigInt("1") + d*a[0]*b[0]*a[1]*b[1]).inverse(q)).affine(q);
res[1] = bigInt((a[1]*b[1] - cta*a[0]*b[0]) * bigInt(bigInt("1") - d*a[0]*b[0]*a[1]*b[1]).inverse(q)).affine(q);
return res;
}
function mulPointEscalar(base, e, q) {
let res = [bigInt("0"),bigInt("1")];
let rem = bigInt(e);
let exp = base;
while (! rem.isZero()) {
if (rem.isOdd()) {
res = addPoint(res, exp, q);
}
exp = addPoint(exp, exp, q);
rem = rem.shr(1);
}
return res;
}
const babyJub = require("../src/babyjub");
function getPoint(S) {
const F = bn128.Fr;
@@ -62,7 +37,7 @@ function getPoint(S) {
const p = [bn128.Fr.affine(x), bn128.Fr.affine(y)];
const p8 =mulPointEscalar(p, 8, bn128.r);
const p8 = babyJub.mulPointEscalar(p, 8);
return p8;
}
@@ -77,42 +52,20 @@ function generatePoint(S) {
p = getPoint(S+"_"+sidx);
idx++;
}
assert(inCurve(p), "Point not in curve");
assert(babyJub.inCurve(p), "Point not in curve");
return p;
}
const r = bigInt("21888242871839275222246405745257275088614511777268538073601725287587578984328").shr(3);
function isLowGrade(p) {
const res= mulPointEscalar(p, r, bn128.r);
return (res[0].equals(bigInt(0))) && (res[1].equals(bigInt(1)));
}
function inCurve(p) {
const F = bn128.Fr;
const a = bigInt("168700");
const d = bigInt("168696");
const x2 = F.square(p[0]);
const y2 = F.square(p[1]);
if (!F.equals(
F.add(F.mul(a, x2), y2),
F.add(F.one, F.mul(F.mul(x2, y2), d)))) return false;
if (!isLowGrade(p)) return false;
return true;
}
const g = [
bigInt("17777552123799933955779906779655732241715742912184938656739573121738514868268"),
bigInt("2626589144620713026669568689430873010625803728049924121243784502389097019475")];
if (!inCurve(g)) {
// Sanity check
if (!babyJub.inCurve(g)) {
throw new Error("Generator not In curve -> Some thing goes wrong...");
}