forked from tornadocash/circomlib
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
2 changed files
with
205 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,156 @@ | ||
const chai = require("chai"); | ||
const path = require("path"); | ||
const snarkjs = require("snarkjs"); | ||
const compiler = require("circom"); | ||
const babyjub = require("../src/babyjub.js"); | ||
|
||
const assert = chai.assert; | ||
|
||
// const bigInt = require("big-integer"); | ||
|
||
|
||
describe("Baby Jub js test", function () { | ||
|
||
this.timeout(100000); | ||
|
||
it("Should add point (0,1) and (0,1)", () => { | ||
|
||
const p1 = [ | ||
snarkjs.bigInt(0), | ||
snarkjs.bigInt(1)]; | ||
const p2 = [ | ||
snarkjs.bigInt(0), | ||
snarkjs.bigInt(1) | ||
]; | ||
|
||
const out = babyjub.addPoint(p1, p2) | ||
assert(out[0].equals(0)); | ||
assert(out[1].equals(1)); | ||
}); | ||
|
||
it("Should add 2 same numbers", () => { | ||
|
||
const p1 = [ | ||
snarkjs.bigInt("17777552123799933955779906779655732241715742912184938656739573121738514868268"), | ||
snarkjs.bigInt("2626589144620713026669568689430873010625803728049924121243784502389097019475"), | ||
]; | ||
const p2 = [ | ||
snarkjs.bigInt("17777552123799933955779906779655732241715742912184938656739573121738514868268"), | ||
snarkjs.bigInt("2626589144620713026669568689430873010625803728049924121243784502389097019475"), | ||
]; | ||
|
||
const out = babyjub.addPoint(p1, p2) | ||
assert(out[0].equals(snarkjs.bigInt("6890855772600357754907169075114257697580319025794532037257385534741338397365"))); | ||
assert(out[1].equals(snarkjs.bigInt("4338620300185947561074059802482547481416142213883829469920100239455078257889"))); | ||
}); | ||
|
||
it("Should add 2 different numbers", () => { | ||
|
||
const p1 = [ | ||
snarkjs.bigInt("17777552123799933955779906779655732241715742912184938656739573121738514868268"), | ||
snarkjs.bigInt("2626589144620713026669568689430873010625803728049924121243784502389097019475"), | ||
]; | ||
const p2 = [ | ||
snarkjs.bigInt("16540640123574156134436876038791482806971768689494387082833631921987005038935"), | ||
snarkjs.bigInt("20819045374670962167435360035096875258406992893633759881276124905556507972311"), | ||
]; | ||
|
||
const out = babyjub.addPoint(p1, p2) | ||
|
||
assert(out[0].equals(snarkjs.bigInt("7916061937171219682591368294088513039687205273691143098332585753343424131937"))); | ||
assert(out[1].equals(snarkjs.bigInt("14035240266687799601661095864649209771790948434046947201833777492504781204499"))); | ||
}); | ||
|
||
it("should mulPointEscalar 0", () => { | ||
const p = [ | ||
snarkjs.bigInt("17777552123799933955779906779655732241715742912184938656739573121738514868268"), | ||
snarkjs.bigInt("2626589144620713026669568689430873010625803728049924121243784502389097019475"), | ||
]; | ||
|
||
const r = babyjub.mulPointEscalar(p, snarkjs.bigInt("3")); | ||
let r2 = babyjub.addPoint(p, p); | ||
r2 = babyjub.addPoint(r2, p); | ||
assert.equal(r2[0].toString(), r[0].toString()); | ||
assert.equal(r2[1].toString(), r[1].toString()); | ||
assert.equal(r[0].toString(), "19372461775513343691590086534037741906533799473648040012278229434133483800898"); | ||
assert.equal(r[1].toString(), "9458658722007214007257525444427903161243386465067105737478306991484593958249"); | ||
}); | ||
|
||
it("should mulPointEscalar 1", () => { | ||
const p = [ | ||
snarkjs.bigInt("17777552123799933955779906779655732241715742912184938656739573121738514868268"), | ||
snarkjs.bigInt("2626589144620713026669568689430873010625803728049924121243784502389097019475"), | ||
]; | ||
|
||
const r = babyjub.mulPointEscalar(p, snarkjs.bigInt("14035240266687799601661095864649209771790948434046947201833777492504781204499")); | ||
assert.equal(r[0].toString(), "17070357974431721403481313912716834497662307308519659060910483826664480189605"); | ||
assert.equal(r[1].toString(), "4014745322800118607127020275658861516666525056516280575712425373174125159339"); | ||
}); | ||
|
||
it("should mulPointEscalar 2", () => { | ||
const p = [ | ||
snarkjs.bigInt("6890855772600357754907169075114257697580319025794532037257385534741338397365"), | ||
snarkjs.bigInt("4338620300185947561074059802482547481416142213883829469920100239455078257889"), | ||
]; | ||
|
||
const r = babyjub.mulPointEscalar(p, snarkjs.bigInt("20819045374670962167435360035096875258406992893633759881276124905556507972311")); | ||
assert.equal(r[0].toString(), "13563888653650925984868671744672725781658357821216877865297235725727006259983"); | ||
assert.equal(r[1].toString(), "8442587202676550862664528699803615547505326611544120184665036919364004251662"); | ||
}); | ||
|
||
it("should inCurve 1", () => { | ||
const p = [ | ||
snarkjs.bigInt("17777552123799933955779906779655732241715742912184938656739573121738514868268"), | ||
snarkjs.bigInt("2626589144620713026669568689430873010625803728049924121243784502389097019475"), | ||
]; | ||
assert(babyjub.inCurve(p)); | ||
}); | ||
|
||
it("should inCurve 2", () => { | ||
const p = [ | ||
snarkjs.bigInt("6890855772600357754907169075114257697580319025794532037257385534741338397365"), | ||
snarkjs.bigInt("4338620300185947561074059802482547481416142213883829469920100239455078257889"), | ||
]; | ||
assert(babyjub.inCurve(p)); | ||
}); | ||
|
||
it("should inSubgroup 1", () => { | ||
const p = [ | ||
snarkjs.bigInt("17777552123799933955779906779655732241715742912184938656739573121738514868268"), | ||
snarkjs.bigInt("2626589144620713026669568689430873010625803728049924121243784502389097019475"), | ||
]; | ||
assert(babyjub.inSubgroup(p)); | ||
}); | ||
|
||
it("should inSubgroup 2", () => { | ||
const p = [ | ||
snarkjs.bigInt("6890855772600357754907169075114257697580319025794532037257385534741338397365"), | ||
snarkjs.bigInt("4338620300185947561074059802482547481416142213883829469920100239455078257889"), | ||
]; | ||
assert(babyjub.inSubgroup(p)); | ||
}); | ||
|
||
it("should packPoint - unpackPoint 1", () => { | ||
const p = [ | ||
snarkjs.bigInt("17777552123799933955779906779655732241715742912184938656739573121738514868268"), | ||
snarkjs.bigInt("2626589144620713026669568689430873010625803728049924121243784502389097019475"), | ||
]; | ||
const buf = babyjub.packPoint(p); | ||
assert.equal(buf.toString('hex'), '53b81ed5bffe9545b54016234682e7b2f699bd42a5e9eae27ff4051bc698ce85'); | ||
const p2 = babyjub.unpackPoint(buf); | ||
assert.equal(p2[0].toString(), "17777552123799933955779906779655732241715742912184938656739573121738514868268"); | ||
assert.equal(p2[1].toString(), "2626589144620713026669568689430873010625803728049924121243784502389097019475"); | ||
}); | ||
|
||
it("should packPoint - unpackPoint 2", () => { | ||
const p = [ | ||
snarkjs.bigInt("6890855772600357754907169075114257697580319025794532037257385534741338397365"), | ||
snarkjs.bigInt("4338620300185947561074059802482547481416142213883829469920100239455078257889"), | ||
]; | ||
const buf = babyjub.packPoint(p); | ||
assert.equal(buf.toString('hex'), 'e114eb17eddf794f063a68fecac515e3620e131976108555735c8b0773929709'); | ||
const p2 = babyjub.unpackPoint(buf); | ||
assert.equal(p2[0].toString(), "6890855772600357754907169075114257697580319025794532037257385534741338397365"); | ||
assert.equal(p2[1].toString(), "4338620300185947561074059802482547481416142213883829469920100239455078257889"); | ||
}); | ||
}); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,49 @@ | ||
const chai = require("chai"); | ||
const snarkjs = require("snarkjs"); | ||
|
||
const eddsa = require("../src/eddsa.js"); | ||
const babyJub = require("../src/babyjub.js"); | ||
|
||
const assert = chai.assert; | ||
|
||
const bigInt = snarkjs.bigInt; | ||
|
||
describe("EdDSA js test", function () { | ||
|
||
this.timeout(100000); | ||
|
||
it("Sign a single 10 bytes from 0 to 9", () => { | ||
const msgBuf = Buffer.from("00010203040506070809", "hex"); | ||
const msg = bigInt.leBuff2int(msgBuf); | ||
|
||
// const prvKey = crypto.randomBytes(32); | ||
|
||
const prvKey = Buffer.from("0001020304050607080900010203040506070809000102030405060708090001", "hex"); | ||
|
||
const pubKey = eddsa.prv2pub(prvKey); | ||
|
||
assert.equal(pubKey[0].toString(), | ||
"2610057752638682202795145288373380503107623443963127956230801721756904484787"); | ||
assert.equal(pubKey[1].toString(), | ||
"16617171478497210597712478520507818259149717466230047843969353176573634386897"); | ||
|
||
const pPubKey = babyJub.packPoint(pubKey); | ||
|
||
const signature = eddsa.signMiMC(prvKey, msg); | ||
assert.equal(signature.R8[0].toString(), | ||
"4974729414807584049518234760796200867685098748448054182902488636762478901554"); | ||
assert.equal(signature.R8[1].toString(), | ||
"18714049394522540751536514815950425694461287643205706667341348804546050128733"); | ||
assert.equal(signature.S.toString(), | ||
"2171284143457722024136077617757713039502332290425057126942676527240038689549"); | ||
|
||
const pSignature = eddsa.packSignature(signature); | ||
assert.equal(pSignature.toString("hex"), ""+ | ||
"5dfb6f843c023fe3e52548ccf22e55c81b426f7af81b4f51f7152f2fcfc65f29"+ | ||
"0dab19c5a0a75973cd75a54780de0c3a41ede6f57396fe99b5307fff3ce7cc04"); | ||
|
||
const uSignature = eddsa.unpackSignature(pSignature); | ||
assert(eddsa.verifyMiMC(msg, uSignature, pubKey)); | ||
|
||
}); | ||
}); |