merkle-tree-gen

Merkle Tree implementation in NodeJS

Install from NPM:

npm install merkle-tree-gen --save

This module generates a Merkle Tree from either a file, an array of any elements, or an array of hashes. The returned value is a JavaScript object, which can be converted into JSON using JSON.stringify(). Example Merkle Tree Object Using this package involves three steps: (Example for hashing a file) Import the module:

var merkle = require('merkle-tree-gen');

Specify the relevant arguments for the function:

var args = {
    file: '/absolute/filepath/to/file.zip'
};

Generate the Merkle Tree:

merkle.fromFile(args, function (err, tree) {

    // the 'tree' object can be used here
});

• fromFile() Generate from a file: The three arguments that can be set are:

  • file - required, the absolute path to an existing file
  • hashalgo - optional, the hash algorithm (default sha256)
  • blocksize - optional, the blocksize (default 1 MiB, 1048576 Bytes) The file (piped into a readStream) is split into chunks specified by the blocksize, and each chunk is hashed to create a leaf on the Merkle Tree. Specific information can be found in the example usage

• fromArray() Generate from an array: The two arguments that can be set are:

  • array - required, an array with a non-zero size
  • hashalgo - optional, the hash algorithm (default sha256) The hash of each element in the array will become a leaf on the Merkle Tree. Before hashing, each element (if it isn't a string) will be converted into a string using JSON.stringify(value). Specific information can be found in the example usage

• fromArray() Generate from an array of hashes: The three arguments that can be set are:

  • array - required, an array with a non-zero size
  • hashalgo - optional, the hash algorithm (default sha256)
  • hashlist - required, the array is a list of hashes (default false). This needs to be set to true If you want to pass in hashes already generated using some other method, this function will use those hashes as the leaves in the generated Merkle Tree. The hashes must have been generated with the same algorithm as specified with hashalgo. Specific information can be found in the example usage

Uses the hashes provided by the NodeJS crypto module. Ex: md4, md5, sha1, sha256, sha512, whirlpool Dependencies: collections, hasha, chunking-streams TODO: Implement verification methods/proofs and extracting/concatenating branches into a tree.

Generate from a file

// Hash a file
var merkle = require('merkle-tree-gen');

// Set up the arguments
var args = {
    file: '/absolute/filepath/to/file.zip', // required
    hashalgo: 'sha256', // optional, defaults to sha256
    blocksize: 1048576  // optional, defaults to 1 MiB, 1048576 Bytes
};

// Generate the tree
merkle.fromFile(args, function (err, tree) {

    if (!err) {
        console.log('Root hash: ' + tree.root);
        console.log('Number of leaves: ' + tree.leaves);
        console.log('Number of levels: ' + tree.levels);
    }
});

// Example result:
Root hash: 4b84a0fea1374585707c9e92eee03b989222ab3e443d6191431346b2174f8814
Number of leaves: 9
Number of levels: 5

Generate from an array

// Hash an array
var merkle = require('merkle-tree-gen');

// Set up the arguments
var args = {
    // Non-string elements are converted to a string with JSON.stringify() before being hashed
    array: [12, someObject, "string1", "string2", secondObject],    // required
    hashalgo: 'sha256'  // optional, defaults to sha256
};

// Generate the tree
merkle.fromArray(args, function (err, tree) {

    if (!err) {
        console.log('Root hash: ' + tree.root);
        console.log('Number of leaves: ' + tree.leaves);
        console.log('Number of levels: ' + tree.levels);
    }
});

// Example result:
Root hash: b425fca4eae215c50c0006d7f7dd46653500762bdeb4a06160009a1e94a1d05e
Number of leaves: 5
Number of levels: 4

Generate from an array of hashes

// Hash an array of hashes
var merkle = require('merkle-tree-gen');

// Set up the arguments
var args = {
    // The hashes must be of the same hash type as 'hashalgo'
    array: [
        "98325468840887230d248330de2c99f76750d131aa6076dbd9e9a0ab20f09fd0",
        "e60b311f8206962615afce5b2cfad4674bc0e49bef8043bb5f19ca746eb671eb",
        "ff1da71d8a78d13fd280d29c3f124e6e97b78a5c8317a2a9ff3d6c5f7294143f",
        "3b071f3d67e907ed5e2615ee904b9135e7ad4db666dad72aa63af1b04076eb9d",
        "9c005dd47633f54816133136a980dac48968c3ddb1d5c6d4f20d76e2295034ae",
        "c27f85771711ec1c70129714ed5c9083c96f1f12506203f46590c2146a93fae2"
    ],  // required
    hashalgo: 'sha256', // optional, defaults to sha256
    hashlist: true      // usually optional, but it is required to be set to 'true' for this example to work. 
                        // It defaults to 'false', but when it is 'true' the array's elements are 
                        // treated as hashes and become the leaves of the Merkle Tree
};

// Generate the tree
merkle.fromArray(args, function (err, tree) {

    if (!err) {
        console.log('Root hash: ' + tree.root);
        console.log('Number of leaves: ' + tree.leaves);
        console.log('Number of levels: ' + tree.levels);
    }
});

// Result:
Root hash: a548b8eb59e1579759d65473ec470673a0b55e62925f096fdf0f7f127036f90c
Number of leaves: 6
Number of levels: 4

Example

An example Merkle Tree object generated from a 2.6 MiB file, using SHA-256 and hashing every 1 MiB of the file (blocksize of 1048576):

{
    "root": "3a9f60b4feb44b003ff6d1426718a7e4d81725892cea87b9938e25900530b72e",
    "hashalgo": "sha256",
    "leaves": 3,
    "levels": 3,
    "3515590e98ad159338b2d5f8d6b9a5123534a898f4e0c2d33040305c6a9654e7": {
        "type": "leaf",
        "level": 0,
        "left": "data",
        "right": "data",
        "parent": "1340b622bcae8720ba3aa90b966511a1b675715e3de236a4f4905bb064e7a05a"
    },
    "eb1d2c20c49195606dd0c65a8ab5134438d253907473fd96e5bb4a343a706bda": {
        "type": "leaf",
        "level": 0,
        "left": "data",
        "right": "data",
        "parent": "1340b622bcae8720ba3aa90b966511a1b675715e3de236a4f4905bb064e7a05a"
    },
    "85c3cf8fbdcf26ae2f301907d90e49c50203a782aa28cee28b341567592ca6a2": {
        "type": "leaf",
        "level": 0,
        "left": "data",
        "right": "data",
        "parent": "44210e019bccfd1f775b8e83909423a2da293db47bc1a9e4bf826a37b5346372"
    },
    "1340b622bcae8720ba3aa90b966511a1b675715e3de236a4f4905bb064e7a05a": {
        "type": "node",
        "level": 1,
        "left": "3515590e98ad159338b2d5f8d6b9a5123534a898f4e0c2d33040305c6a9654e7",
        "right": "eb1d2c20c49195606dd0c65a8ab5134438d253907473fd96e5bb4a343a706bda",
        "parent": "3a9f60b4feb44b003ff6d1426718a7e4d81725892cea87b9938e25900530b72e"
    },
    "44210e019bccfd1f775b8e83909423a2da293db47bc1a9e4bf826a37b5346372": {
        "type": "node",
        "level": 1,
        "left": "85c3cf8fbdcf26ae2f301907d90e49c50203a782aa28cee28b341567592ca6a2",
        "right": "85c3cf8fbdcf26ae2f301907d90e49c50203a782aa28cee28b341567592ca6a2",
        "parent": "3a9f60b4feb44b003ff6d1426718a7e4d81725892cea87b9938e25900530b72e"
    },
    "3a9f60b4feb44b003ff6d1426718a7e4d81725892cea87b9938e25900530b72e": {
        "type": "root",
        "level": 2,
        "left": "1340b622bcae8720ba3aa90b966511a1b675715e3de236a4f4905bb064e7a05a",
        "right": "44210e019bccfd1f775b8e83909423a2da293db47bc1a9e4bf826a37b5346372",
        "parent": "root"
    }
}

Licence

MIT