circomlib/test/smtprocessor.js

213 lines
6.9 KiB
JavaScript
Raw Normal View History

2018-12-11 19:25:21 +03:00
const chai = require("chai");
const path = require("path");
const snarkjs = require("@tornado/snarkjs");
2018-12-11 19:25:21 +03:00
const compiler = require("circom");
const smt = require("../src/smt.js");
const assert = chai.assert;
const bigInt = snarkjs.bigInt;
function print(circuit, w, s) {
console.log(s + ": " + w[circuit.getSignalIdx(s)]);
}
async function testInsert(tree, key, value, circuit, log) {
const res = await tree.insert(key, value);
2018-12-14 16:24:30 +03:00
let siblings = res.siblings;
while (siblings.length < 10) siblings.push(bigInt(0));
2018-12-13 21:53:32 +03:00
const w = circuit.calculateWitness(
{
fnc: [1, 0],
oldRoot: res.oldRoot,
siblings: siblings,
oldKey: res.isOld0 ? 0 : res.oldKey,
oldValue: res.isOld0 ? 0 : res.oldValue,
isOld0: res.isOld0 ? 1 : 0,
newKey: key,
newValue: value,
},
log
);
2018-12-13 21:53:32 +03:00
2018-12-23 01:54:25 +03:00
const root1 = w[circuit.getSignalIdx("main.newRoot")];
2018-12-13 21:53:32 +03:00
assert(circuit.checkWitness(w));
assert(root1.equals(res.newRoot));
}
async function testDelete(tree, key, circuit) {
const res = await tree.delete(key);
2018-12-14 16:24:30 +03:00
let siblings = res.siblings;
while (siblings.length < 10) siblings.push(bigInt(0));
2018-12-13 21:53:32 +03:00
const w = circuit.calculateWitness({
fnc: [1, 1],
2018-12-13 21:53:32 +03:00
oldRoot: res.oldRoot,
siblings: siblings,
2018-12-15 11:00:35 +03:00
oldKey: res.isOld0 ? 0 : res.oldKey,
oldValue: res.isOld0 ? 0 : res.oldValue,
2018-12-13 21:53:32 +03:00
isOld0: res.isOld0 ? 1 : 0,
newKey: res.delKey,
newValue: res.delValue,
2018-12-13 21:53:32 +03:00
});
2018-12-23 01:54:25 +03:00
const root1 = w[circuit.getSignalIdx("main.newRoot")];
2018-12-13 21:53:32 +03:00
assert(circuit.checkWitness(w));
assert(root1.equals(res.newRoot));
}
2018-12-14 16:24:30 +03:00
async function testUpdate(tree, key, newValue, circuit) {
const res = await tree.update(key, newValue);
let siblings = res.siblings;
while (siblings.length < 10) siblings.push(bigInt(0));
2018-12-14 16:24:30 +03:00
const w = circuit.calculateWitness({
fnc: [0, 1],
2018-12-14 16:24:30 +03:00
oldRoot: res.oldRoot,
siblings: siblings,
oldKey: res.oldKey,
oldValue: res.oldValue,
isOld0: 0,
newKey: res.newKey,
newValue: res.newValue,
2018-12-14 16:24:30 +03:00
});
2018-12-23 01:54:25 +03:00
const root1 = w[circuit.getSignalIdx("main.newRoot")];
2018-12-14 16:24:30 +03:00
assert(circuit.checkWitness(w));
assert(root1.equals(res.newRoot));
}
2018-12-11 19:25:21 +03:00
describe("SMT test", function () {
let circuit;
let tree;
2019-06-04 18:32:28 +03:00
this.timeout(10000000);
2018-12-11 19:25:21 +03:00
before(async () => {
2018-12-14 16:24:30 +03:00
const cirDef = await compiler(path.join(__dirname, "circuits", "smtprocessor10_test.circom"));
2018-12-11 19:25:21 +03:00
circuit = new snarkjs.Circuit(cirDef);
2018-12-14 16:24:30 +03:00
console.log("NConstrains SMTProcessor: " + circuit.nConstraints);
2018-12-11 19:25:21 +03:00
tree = await smt.newMemEmptyTrie();
});
it("Should verify an insert to an empty tree", async () => {
const key = bigInt(111);
const value = bigInt(222);
2018-12-13 21:53:32 +03:00
await testInsert(tree, key, value, circuit);
2018-12-11 19:25:21 +03:00
});
it("It should add another element", async () => {
const key = bigInt(333);
const value = bigInt(444);
2018-12-13 21:53:32 +03:00
await testInsert(tree, key, value, circuit);
});
it("Should remove an element", async () => {
await testDelete(tree, 111, circuit);
await testDelete(tree, 333, circuit);
});
it("Should test convination of adding and removing 3 elements", async () => {
const keys = [bigInt(8), bigInt(9), bigInt(32)];
const values = [bigInt(88), bigInt(99), bigInt(3232)];
const tree1 = await smt.newMemEmptyTrie();
const tree2 = await smt.newMemEmptyTrie();
const tree3 = await smt.newMemEmptyTrie();
const tree4 = await smt.newMemEmptyTrie();
const tree5 = await smt.newMemEmptyTrie();
const tree6 = await smt.newMemEmptyTrie();
await testInsert(tree1, keys[0], values[0], circuit);
await testInsert(tree1, keys[1], values[1], circuit);
await testInsert(tree1, keys[2], values[2], circuit);
2018-12-13 21:53:32 +03:00
await testInsert(tree2, keys[0], values[0], circuit);
await testInsert(tree2, keys[2], values[2], circuit);
await testInsert(tree2, keys[1], values[1], circuit);
2018-12-13 21:53:32 +03:00
await testInsert(tree3, keys[1], values[1], circuit);
await testInsert(tree3, keys[0], values[0], circuit);
await testInsert(tree3, keys[2], values[2], circuit);
2018-12-13 21:53:32 +03:00
await testInsert(tree4, keys[1], values[1], circuit);
await testInsert(tree4, keys[2], values[2], circuit);
await testInsert(tree4, keys[0], values[0], circuit);
2018-12-13 21:53:32 +03:00
await testInsert(tree5, keys[2], values[2], circuit);
await testInsert(tree5, keys[0], values[0], circuit);
await testInsert(tree5, keys[1], values[1], circuit);
2018-12-13 21:53:32 +03:00
await testInsert(tree6, keys[2], values[2], circuit);
await testInsert(tree6, keys[1], values[1], circuit);
await testInsert(tree6, keys[0], values[0], circuit);
2018-12-13 21:53:32 +03:00
await testDelete(tree1, keys[0], circuit);
await testDelete(tree1, keys[1], circuit);
await testDelete(tree2, keys[1], circuit);
await testDelete(tree2, keys[0], circuit);
await testDelete(tree3, keys[0], circuit);
await testDelete(tree3, keys[2], circuit);
await testDelete(tree4, keys[2], circuit);
await testDelete(tree4, keys[0], circuit);
await testDelete(tree5, keys[1], circuit);
await testDelete(tree5, keys[2], circuit);
await testDelete(tree6, keys[2], circuit);
await testDelete(tree6, keys[1], circuit);
await testDelete(tree1, keys[2], circuit);
await testDelete(tree2, keys[2], circuit);
await testDelete(tree3, keys[1], circuit);
await testDelete(tree4, keys[1], circuit);
await testDelete(tree5, keys[0], circuit);
2018-12-13 23:04:37 +03:00
await testDelete(tree6, keys[0], circuit);
2018-12-13 21:53:32 +03:00
});
2018-12-11 19:25:21 +03:00
2018-12-13 21:53:32 +03:00
it("Should match a NOp with random vals", async () => {
let siblings = [];
while (siblings.length < 10) siblings.push(bigInt(88));
2018-12-11 19:25:21 +03:00
const w = circuit.calculateWitness({
fnc: [0, 0],
2018-12-13 21:53:32 +03:00
oldRoot: 11,
2018-12-11 19:25:21 +03:00
siblings: siblings,
2018-12-13 21:53:32 +03:00
oldKey: 33,
oldValue: 44,
isOld0: 55,
newKey: 66,
newValue: 77,
2018-12-11 19:25:21 +03:00
});
2018-12-23 01:54:25 +03:00
const root1 = w[circuit.getSignalIdx("main.oldRoot")];
const root2 = w[circuit.getSignalIdx("main.newRoot")];
2018-12-13 21:53:32 +03:00
assert(circuit.checkWitness(w));
2018-12-23 01:54:25 +03:00
assert(root1.equals(root2));
2018-12-13 21:53:32 +03:00
});
it("Should update an element", async () => {
2018-12-14 16:24:30 +03:00
const tree1 = await smt.newMemEmptyTrie();
const tree2 = await smt.newMemEmptyTrie();
await testInsert(tree1, 8, 88, circuit);
await testInsert(tree1, 9, 99, circuit);
await testInsert(tree1, 32, 3232, circuit);
2018-12-14 16:24:30 +03:00
await testInsert(tree2, 8, 888, circuit);
await testInsert(tree2, 9, 999, circuit);
await testInsert(tree2, 32, 323232, circuit);
2018-12-13 21:53:32 +03:00
2018-12-14 16:24:30 +03:00
await testUpdate(tree1, 8, 888, circuit);
await testUpdate(tree1, 9, 999, circuit);
await testUpdate(tree1, 32, 323232, circuit);
2018-12-13 21:53:32 +03:00
});
2018-12-11 19:25:21 +03:00
});