Rewrote Chriseth's patricia tree implementation

Author: wanseob

.gitignore

@@ -0,0 +1,69 @@
+# truffle
+build/*
+
+# Logs
+logs
+*.log
+npm-debug.log*
+yarn-debug.log*
+yarn-error.log*
+
+# Runtime data
+pids
+*.pid
+*.seed
+*.pid.lock
+
+# Directory for instrumented libs generated by jscoverage/JSCover
+lib-cov
+
+# Coverage directory used by tools like istanbul
+coverage
+coverage.json
+.coveralls.yml
+
+# nyc test coverage
+.nyc_output
+
+# Grunt intermediate storage (http://gruntjs.com/creating-plugins#storing-task-files)
+.grunt
+
+# Bower dependency directory (https://bower.io/)
+bower_components
+
+# node-waf configuration
+.lock-wscript
+
+# Compiled binary addons (https://nodejs.org/api/addons.html)
+build/Release
+
+# Dependency directories
+node_modules/
+jspm_packages/
+
+# TypeScript v1 declaration files
+typings/
+
+# Optional npm cache directory
+.npm
+
+# Optional eslint cache
+.eslintcache
+
+# Optional REPL history
+.node_repl_history
+
+# Output of 'npm pack'
+*.tgz
+
+# Yarn Integrity file
+.yarn-integrity
+
+# dotenv environment variables file
+.env
+
+# next.js build output
+.next
+
+# IDE
+.idea

LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 commitground
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

README.md

@@ -0,0 +1,94 @@
+# Solidity Patricia Tree
+
+## Credits 
+
+This is a rewritten version of [Christian Reitwießner](https://github.com/chriseth)'s [patricia-tree](https://github.com/chriseth/patricia-tree) to use his patricia tree implementation as a solidity library through npm.
+
+
+##### latest released version
+[![npm](https://img.shields.io/npm/v/solidity-patricia-tree/latest.svg)](https://www.npmjs.com/package/solidity-patricia-tree)
+[![Build Status](https://travis-ci.org/commitground/solidity-patricia-tree.svg?branch=master)](https://travis-ci.org/commitground/solidity-patricia-tree)
+[![Coverage Status](https://coveralls.io/repos/github/commitground/solidity-patricia-tree/badge.svg?branch=master)](https://coveralls.io/github/commitground/solidity-patricia-tree?branch=develop)
+
+##### in progress
+[![npm](https://img.shields.io/npm/v/solidity-patricia-tree/next.svg)](https://www.npmjs.com/package/solidity-patricia-tree)
+[![Build Status](https://travis-ci.org/commitground/solidity-patricia-tree.svg?branch=develop)](https://travis-ci.org/commitground/solidity-patricia-tree)
+[![Coverage Status](https://coveralls.io/repos/github/commitground/solidity-patricia-tree/badge.svg?branch=develop)](https://coveralls.io/github/commitground/solidity-patricia-tree?branch=develop)
+
+[![JavaScript Style Guide](https://cdn.rawgit.com/standard/standard/master/badge.svg)](https://github.com/standard/standard)
+
+
+
+## Usage
+
+```bash
+npm i solidity-patricia-tree
+```
+
+```solidity
+pragma solidity ^0.4.25;
+
+import {PatriciaTree} from "solidity-patricia-tree/contracts/tree.sol"; 
+contract YourContract {
+    using PatriciaTree for PatriciaTree.Tree;
+
+    function test() {
+        //testInsert();
+        testProofs();
+    }
+    function testInsert() internal {
+        PatriciaTree.Tree memory tree;
+        tree.insert("one", "ONE");
+        tree.insert("two", "ONE");
+        tree.insert("three", "ONE");
+        tree.insert("four", "ONE");
+        tree.insert("five", "ONE");
+        tree.insert("six", "ONE");
+        tree.insert("seven", "ONE");
+        // update
+        tree.insert("one", "TWO");
+    }
+    function testProofs() internal {
+        PatriciaTree.Tree memory tree;
+        tree.insert("one", "ONE");
+        uint branchMask;
+        bytes32[] siblings;
+        (branchMask, siblings) = tree.getProof("one");
+        tree.verifyProof(root, "one", "ONE", branchMask, siblings);
+        tree.insert("two", "TWO");
+        (branchMask, siblings) = tree.getProof("one");
+        tree.verifyProof(root, "one", "ONE", branchMask, siblings);
+        (branchMask, siblings) = tree.getProof("two");
+        tree.verifyProof(root, "two", "TWO", branchMask, siblings);
+    }
+}
+```
+
+
+## Development 
+
+### Pre-requisites
+
+```bash
+npm install -g truffle
+npm install -g ganache
+npm install
+```
+
+### Tests
+
+Test cases include the information about how the functions work, but also includes a demo scenario.
+Running and reading the test cases will help you understand how it works.
+
+```bash
+npm run test
+```
+
+
+## Contributors
+- Original author: [Christian Reitwießner](https://github.com/chriseth)
+- [Wanseob Lim](https://github.com/james-lim)<[email@wanseob.com](mailto:email@wanseob.com)>
+
+## License
+
+[MIT LICENSE](./LICENSE)

contracts/Migrations.sol

@@ -0,0 +1,23 @@
+pragma solidity ^0.4.23;
+
+contract Migrations {
+  address public owner;
+  uint public last_completed_migration;
+
+  constructor() public {
+    owner = msg.sender;
+  }
+
+  modifier restricted() {
+    if (msg.sender == owner) _;
+  }
+
+  function setCompleted(uint completed) public restricted {
+    last_completed_migration = completed;
+  }
+
+  function upgrade(address new_address) public restricted {
+    Migrations upgraded = Migrations(new_address);
+    upgraded.setCompleted(last_completed_migration);
+  }
+}

contracts/data.sol

@@ -0,0 +1,22 @@
+pragma solidity ^0.4.0;
+
+/**
+ MIT License
+ Copyright (c) 2017 chriseth
+ */
+
+library D {
+    struct Label {
+        bytes32 data;
+        uint length;
+    }
+
+    struct Edge {
+        bytes32 node;
+        Label label;
+    }
+
+    struct Node {
+        Edge[2] children;
+    }
+}

contracts/implementation.sol

@@ -0,0 +1,39 @@
+pragma solidity ^0.4.24;
+
+import {PatriciaTree} from "./tree.sol";
+
+contract PatriciaTreeImplementation {
+    using PatriciaTree for PatriciaTree.Tree;
+    PatriciaTree.Tree tree;
+
+    constructor () public {
+    }
+
+    function get(bytes key) public view returns (bytes) {
+        return tree.get(key);
+    }
+
+    function getRootHash() public view returns (bytes32) {
+        return tree.getRootHash();
+    }
+
+    function getNode(bytes32 hash) public view returns (uint, bytes32, bytes32, uint, bytes32, bytes32) {
+        return tree.getNode(hash);
+    }
+
+    function getRootEdge() public view returns (uint, bytes32, bytes32) {
+        return tree.getRootEdge();
+    }
+
+    function getProof(bytes key) public view returns (uint branchMask, bytes32[] _siblings) {
+        return tree.getProof(key);
+    }
+
+    function verifyProof(bytes32 rootHash, bytes key, bytes value, uint branchMask, bytes32[] siblings) public pure {
+        PatriciaTree.verifyProof(rootHash, key, value, branchMask, siblings);
+    }
+
+    function insert(bytes key, bytes value) public {
+        tree.insert(key, value);
+    }
+}