p30629751
/
merkletreejs
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

add tests for all bitcoin tree leaves

This commit is contained in:
Friedger Müffke 2021-07-22 13:21:00 +02:00
parent 64dc0286c1
commit 848d5793a1
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
test/merkletree.test.js
View File

@ -351,7 +351,7 @@ test('solidity keccak256 with duplicate leaves', t => {
}) })
test('sha-256 with option.isBitcoinTree', t => { test('sha-256 with option.isBitcoinTree', t => {
t.plan(2) t.plan(100)
/* Derived from: /* Derived from:
* http://www.righto.com/2014/02/bitcoin-mining-hard-way-algorithms.html * http://www.righto.com/2014/02/bitcoin-mining-hard-way-algorithms.html
@ -464,9 +464,10 @@ test('sha-256 with option.isBitcoinTree', t => {
const root = Buffer.from('871714dcbae6c8193a2bb9b2a69fe1c0440399f38d94b3a0f1b447275a29978a', 'hex') const root = Buffer.from('871714dcbae6c8193a2bb9b2a69fe1c0440399f38d94b3a0f1b447275a29978a', 'hex')
t.equal(tree.getRoot().toString('hex'), root.toString('hex')) t.equal(tree.getRoot().toString('hex'), root.toString('hex'))
const proof_0 = tree.getProof(leaves[0]) for (let i = 0; i < leaves.length; i++) {
const proof_0 = tree.getProof(leaves[i])
t.true(tree.verify(proof_0, leaves[0], root)) t.true(tree.verify(proof_0, leaves[i], root), 'proof verification for ' + i)
}
}) })
test('keccak256 - hex strings', t => { test('keccak256 - hex strings', t => {