NoBey/openzeppelin-contracts
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Add tests, docs and MerkleTree helper

Browse Source
This commit is contained in:
Yondon Fu
2017-06-15 11:07:22 -04:00
parent 3c4d0d0a77
commit 2e0bd06da2
4 changed files with 177 additions and 43 deletions
Download Patch File Download Diff File Expand all files Collapse all files

75
test/MerkleProof.js
View File

@ -1,54 +1,43 @@
var MerkleProofMock = artifacts.require("./helpers/MerkleProofMock.sol");
var MerkleProof = artifacts.require("./MerkleProof.sol");
import { sha3 } from "ethereumjs-util";
import MerkleTree from "./helpers/merkleTree.js";
contract('MerkleProof', function(accounts) {
let merkleProof;
let merkleProof;
before(async function() {
merkleProof = await MerkleProofMock.new();
before(async function() {
merkleProof = await MerkleProof.new();
});
describe("verifyProof", function() {
it("should return true for a valid Merkle proof", async function() {
const elements = ["a", "b", "c", "d"].map(el => sha3(el));
const merkleTree = new MerkleTree(elements);
const root = merkleTree.getHexRoot();
const proof = merkleTree.getHexProof(elements[0]);
const leaf = merkleTree.bufToHex(elements[0]);
const result = await merkleProof.verifyProof(proof, root, leaf);
assert.isOk(result, "verifyProof did not return true for a valid proof");
});
describe("verifyProof", function() {
it("should return true for a valid Merkle proof given even number of leaves", async function() {
// const elements = ["a", "b", "c", "d"].map(el => sha3(el));
// const merkleTree = new MerkleTree(elements);
it("should return false for an invalid Merkle proof", async function() {
const elements = ["a", "b", "c"].map(el => sha3(el));
const merkleTree = new MerkleTree(elements);
// const root = merkleTree.getHexRoot();
const root = merkleTree.getHexRoot();
// const proof = merkleTree.getHexProof(elements[0]);
const proof = merkleTree.getHexProof(elements[0]);
const badProof = proof.slice(0, proof.length - 32);
// const leaf = merkleTree.bufToHex(elements[0]);
const leaf = merkleTree.bufToHex(elements[0]);
// const validProof = await merkleProof.verifyProof(proof, root, leaf);
// assert.isOk(validProof, "verifyProof did not return true for a valid proof given even number of leaves");
});
it("should return true for a valid Merkle proof given odd number of leaves", async function () {
// const elements = ["a", "b", "c"].map(el => sha3(el));
// const merkleTree = new MerkleTree(elements);
// const root = merkleTree.getHexRoot();
// const proof = merkleTree.getHexProof(elements[0]);
// const leaf = merkleTree.bufToHex(elements[0]);
// const validProof = await merkleProof.verifyProof(proof, root, leaf);
// assert.isOk(validProof, "verifyProof did not return true for a valid proof given odd number of leaves");
});
it("should return false for an invalid Merkle proof", async function() {
// const elements = ["a", "b", "c"].map(el => sha3(el));
// const merkleTree = new MerkleTree(elements);
// const root = merkleTree.getHexRoot();
// const proof = merkleTree.getHexProof(elements[0]);
// const badProof = proof.slice(0, proof.length - 32);
// const leaf = merkleTree.bufToHex(elements[0]);
// const validProof = await merkleProof.verifyProof(badProof, root, leaf);
// assert.isNotOk(validProof, "verifyProof did not return false for an invalid proof");
});
const result = await merkleProof.verifyProof(badProof, root, leaf);
assert.isNotOk(result, "verifyProof did not return false for an invalid proof");
});
});
});