https://github.com/binded/merkletree

Merkle tree data structure in pure Javascript
https://github.com/binded/merkletree

Last synced: about 4 hours ago
JSON representation

Merkle tree data structure in pure Javascript

• Host: GitHub
• URL: https://github.com/binded/merkletree
• Owner: binded
• Created: 2016-04-29T04:54:22.000Z (over 8 years ago)
• Default Branch: master
• Last Pushed: 2016-06-16T04:43:34.000Z (over 8 years ago)
• Last Synced: 2024-11-02T18:49:41.390Z (15 days ago)
• Language: JavaScript
• Homepage: https://blockai.github.io/merkletree/
• Size: 195 KB
• Stars: 8
• Watchers: 10
• Forks: 4
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# merlketree

[![Build Status](https://travis-ci.org/blockai/merkletree.svg?branch=master)](https://travis-ci.org/blockai/merkletree)

Merkle tree data structure in pure Javascript. Always builds complete

binary trees.

The proofs are compatible with the

[chainpoint proof format](https://github.com/chainpoint/whitepaper/raw/master/chainpoint_white_paper.pdf).

Browser demo

## Install

```

npm install --save merkletree

```

## Usage

```javascript

import merkletree, { verifyProof } from 'merkletree'

/* with require:

const mtree = require('merkletree')

const merkletree = mtree.default

const verifyProof = mtree.verifyProof

*/

const leaves = [

  'e1566f09e0deea437826514431be6e4bdb4fe10aa54d75aecf0b4cdc1bc4320c',

  '2f7f9092b2d6c5c17cfe2bcf33fc38a41f2e4d4485b198c2b1074bba067e7168',

  'e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855',

  'e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855',

]

const tree = merkletree(leaves)

console.log(tree.root())

/*

6a9a3c86d47f1fe12648c86368ecd9723ff12e3fc34f6ae219d4d9d3e0d60667

*/

const proof = tree.proof('2f7f9092b2d6c5c17cfe2bcf33fc38a41f2e4d4485b198c2b1074bba067e7168')

console.log(proof)

/*

[

  {

    left: 'e1566f09e0deea437826514431be6e4bdb4fe10aa54d75aecf0b4cdc1bc4320c',

    parent: '0fdd6b6895e15115c262f6acb9a6ae0c73248568b740454ab21591f8a533dd7f',

    right: '2f7f9092b2d6c5c17cfe2bcf33fc38a41f2e4d4485b198c2b1074bba067e7168',

  },

  {

    left: '0fdd6b6895e15115c262f6acb9a6ae0c73248568b740454ab21591f8a533dd7f',

    parent: '6a9a3c86d47f1fe12648c86368ecd9723ff12e3fc34f6ae219d4d9d3e0d60667',

    right: '3b7546ed79e3e5a7907381b093c5a182cbf364c5dd0443dfa956c8cca271cc33',

  },

])

*/

const verified = verifyProof(

  '2f7f9092b2d6c5c17cfe2bcf33fc38a41f2e4d4485b198c2b1074bba067e7168', // leaf

  '6a9a3c86d47f1fe12648c86368ecd9723ff12e3fc34f6ae219d4d9d3e0d60667', // expected merkle root

  proof

)

console.log(verified)

/*

true

*/

```

## TOTO

- memoize hash() calls in tree to speed up branch/root computation