merkletree 0.1.0 → 0.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
-SHA1:
-  metadata.gz: 9bdd4412b5bb49cfa7d3f5d5d93d5f0254248952
-  data.tar.gz: 3759dac07a1eb87444a7264089a83a113ec62a18
+SHA256:
+  metadata.gz: df5c0ce0d6a4a0c85bf7ab16750728fe99756d1c0d011f7b4f7df55b5120bc8e
+  data.tar.gz: 8bb9d363824fc3fb6e6480280544b950e25ce1a63d3528c54ae70b76bbdd8866
 SHA512:
-  metadata.gz: a99eb56b3472efcca00ea11d2b9a7dedc69903dc43d33cd5d9677dd737b32288a216fd6d5f1be9bf4b6b893c311034c9c30cc7ffd0f890e65827dd730f36881f
-  data.tar.gz: a0c2465fcb59581478779ef74bd05bf74642fb5b818072d53847fa949cdb66e8f127852edc5d99ef4ab4652d3a454ab850fbcc640a75bf6e73a91b5fc3f23594
+  metadata.gz: 68de4014fc2681b5d5aab8787e7a451a337931546cbd80e9d3b97cecd083cccc8047c6e70a2e7b471a847594991cfd2ff1537893f35429fdf60079d46ebbbf2e
+  data.tar.gz: e429a1483f01343e12f9a2f69b1f9b6584a9b419e6bc4c15a2a80342855fcc34b4e609ae00859e079b1bf1f8b04fa99b8d7882f6e292ad52e5bd82e917aff701

data/{HISTORY.md → CHANGELOG.md}

@@ -1,3 +1,3 @@
-### 0.0.1 / 2017-12-18
-
-* Everything is new. First release
+### 0.0.1 / 2017-12-18
+
+* Everything is new. First release

data/Manifest.txt

@@ -1,5 +1,4 @@
-HISTORY.md
-LICENSE.md
+CHANGELOG.md
 Manifest.txt
 README.md
 Rakefile

data/README.md

@@ -1,162 +1,162 @@
-# Merkle Tree (Ruby Edition)
-
-merkletree library / gem - build your own crypto hash trees; named after Ralph Merkle who patented hash trees in 1979; grow your own money on trees
-
-
-* home  :: [github.com/openblockchains/merkletree.rb](https://github.com/openblockchains/merkletree.rb)
-* bugs  :: [github.com/openblockchains/merkletree.rb/issues](https://github.com/openblockchains/merkletree.rb/issues)
-* gem   :: [rubygems.org/gems/merkletree](https://rubygems.org/gems/merkletree)
-* rdoc  :: [rubydoc.info/gems/merkletree](http://rubydoc.info/gems/merkletree)
-
-
-## What's a Merkle Tree?
-
-> A Merkle tree or hash tree is a tree in which every leaf node is labelled with
-> the hash of a data block and every non-leaf node is labelled with the
-> cryptographic hash of the labels of its child nodes.
-> Hash trees allow efficient and secure verification of the
-> contents of large data structures. [...]
->
-> The concept of hash trees is named after Ralph Merkle
-> who patented it in 1979.
->
-> -- [Wikipedia](https://en.wikipedia.org/wiki/Merkle_tree)
-
-
-## Usage
-
-
-Pass along all (leaf / data block) hashes as strings or packaged in an array.
-Example:
-
-``` ruby
-merkle = MerkleTree.new(
-  'eb8ecbf6d5870763ae246e37539d82e37052cb32f88bb8c59971f9978e437743',
-  'edbd4e11e69bc399a9ccd8faaea44fb27410fe8e3023bb9462450a0a9c4caa1b',
-  '5ee2981606328abfe0c3b1171440f0df746c1e1f8b3b56c351727f7da7ae5d8d' )
-
-# -or-
-
-merkle = MerkleTree.new( [
-  'eb8ecbf6d5870763ae246e37539d82e37052cb32f88bb8c59971f9978e437743',
-  'edbd4e11e69bc399a9ccd8faaea44fb27410fe8e3023bb9462450a0a9c4caa1b',
-  '5ee2981606328abfe0c3b1171440f0df746c1e1f8b3b56c351727f7da7ae5d8d' ])
-
-
-puts 'merkle tree root hash:'
-puts merkle.root.value
-# => '25fd59b79d70bbdf043d66a7b0fc01409d11b990e943bb46b840fbbddd5ab895'
-
-pp merkle    ## pp (pretty print)
-```
-
-resulting in:
-
-```
-@root = #<MerkleTree::Node:0x46b55e0
-   @left = #<MerkleTree::Node:0x46b6060
-     @left = #<MerkleTree::Node:0x46b6870
-       @left  = nil,
-       @right = nil,
-       @value = "eb8ecbf6d5870763ae246e37539d82e37052cb32f88bb8c59971f9978e437743">,
-     @right = #<MerkleTree::Node:0x46b6810
-       @left  = nil,
-       @right = nil,
-       @value = "edbd4e11e69bc399a9ccd8faaea44fb27410fe8e3023bb9462450a0a9c4caa1b">,
-     @value = "c9de03ced4db3c63835807016b1efedb647c694d2db8b9a8579cbf0c5dcb5ab0">,
-   @right= #<MerkleTree::Node:0x46b5ca0
-     @left= #<MerkleTree::Node:0x46b6798
-       @left  = nil,
-       @right = nil,
-       @value = "5ee2981606328abfe0c3b1171440f0df746c1e1f8b3b56c351727f7da7ae5d8d">,
-     @right = #<MerkleTree::Node:0x46b6798
-       @left  = nil,
-       @right = nil,
-       @value = "5ee2981606328abfe0c3b1171440f0df746c1e1f8b3b56c351727f7da7ae5d8d">,
-     @value = "50963aa3b2047e0d58bb850fc12e5a324cf01061af55889389be72d3849e1d03">,
-   @value="25fd59b79d70bbdf043d66a7b0fc01409d11b990e943bb46b840fbbddd5ab895">>
-```
-
-
-Use `MerkleTree.compute_root` for computing the root (crypto) hash without building a
-tree. Example:
-
-``` ruby
-merkle_root_value = MerkleTree.compute_root(
-  'eb8ecbf6d5870763ae246e37539d82e37052cb32f88bb8c59971f9978e437743',
-  'edbd4e11e69bc399a9ccd8faaea44fb27410fe8e3023bb9462450a0a9c4caa1b',
-  '5ee2981606328abfe0c3b1171440f0df746c1e1f8b3b56c351727f7da7ae5d8d' )
-
-# -or-
-
-merkle_root_value = MerkleTree.compute_root( [
-  'eb8ecbf6d5870763ae246e37539d82e37052cb32f88bb8c59971f9978e437743',
-  'edbd4e11e69bc399a9ccd8faaea44fb27410fe8e3023bb9462450a0a9c4caa1b',
-  '5ee2981606328abfe0c3b1171440f0df746c1e1f8b3b56c351727f7da7ae5d8d' ])
-
-
-puts 'merkle tree root hash:'
-puts merkle_root_value
-# => '25fd59b79d70bbdf043d66a7b0fc01409d11b990e943bb46b840fbbddd5ab895'
-```
-
-
-### Transactions
-
-Use `MerkleTree.for` or `MerkleTree.compute_root_for` for passing along transactions.
-Will use `to_s` on every transaction and use the resulting "serialized" string
-to (auto-) calculate the (crypto) hash.
-
-Let's put the transactions from the (hyper) ledger book from [Tulips on the Blockchain!](https://github.com/openblockchains/tulips)
-on the ~~blockchain~~ merkle tree:
-
-
-| From                | To           | What                      | Qty |
-|---------------------|--------------|---------------------------|----:|
-| Bloom & Blossom (†) | Daisy        | Tulip Admiral of Admirals |   8 |
-| Vincent             | Max          | Tulip Bloemendaal Sunset  |   2 |
-| Anne                | Martijn      | Tulip Semper Augustus     |   2 |
-| Ruben               | Julia        | Tulip Admiral van Eijck   |   2 |
-
-(†): Grower Transaction - New Tulips on the Market!
-
-``` ruby
-merkle = MerkleTree.for(
-  { from: "Bloom & Blossom", to: "Daisy",   what: "Tulip Admiral of Admirals", qty: 8 },
-  { from: "Vincent",         to: "Max",     what: "Tulip Bloemendaal Sunset",  qty: 2 },
-  { from: "Anne",            to: "Martijn", what: "Tulip Semper Augustus",     qty: 2 },
-  { from: "Ruben",           to: "Julia",   what: "Tulip Admiral van Eijck",   qty: 2 } )
-
-puts 'merkle tree root hash:'
-puts merkle.root.value
-# => '703f44630117ef9b4ac20cb149ed8a0f06e4c3ed2a791e11e16a2fe7a7d0de3d'
-
-# -or-
-
-merkle_root_value = MerkleTree.compute_root_for(
-  { from: "Bloom & Blossom", to: "Daisy",   what: "Tulip Admiral of Admirals", qty: 8 },
-  { from: "Vincent",         to: "Max",     what: "Tulip Bloemendaal Sunset",  qty: 2 },
-  { from: "Anne",            to: "Martijn", what: "Tulip Semper Augustus",     qty: 2 },
-  { from: "Ruben",           to: "Julia",   what: "Tulip Admiral van Eijck",   qty: 2 } )
-
-puts 'merkle tree root hash:'
-puts merkle_root_value
-# => '703f44630117ef9b4ac20cb149ed8a0f06e4c3ed2a791e11e16a2fe7a7d0de3d'
-```
-
-
-## Install
-
-Just install the gem:
-
-```
-$ gem install merkletree
-```
-
-
-## License
-
-![](https://publicdomainworks.github.io/buttons/zero88x31.png)
-
-The `merkletree` scripts are dedicated to the public domain.
-Use it as you please with no restrictions whatsoever.
+# Merkle Tree
+
+merkletree library / gem - build your own crypto hash trees; named after Ralph Merkle who patented hash trees in 1979 (the patent expired in 2002); grow your own money on trees
+
+
+* home  :: [github.com/rubycoco/blockchain](https://github.com/rubycoco/blockchain)
+* bugs  :: [github.com/rubycoco/blockchain/issues](https://github.com/rubycoco/blockchain/issues)
+* gem   :: [rubygems.org/gems/merkletree](https://rubygems.org/gems/merkletree)
+* rdoc  :: [rubydoc.info/gems/merkletree](http://rubydoc.info/gems/merkletree)
+
+
+## What's a Merkle Tree?
+
+> A Merkle tree or hash tree is a tree in which every leaf node is labelled with
+> the hash of a data block and every non-leaf node is labelled with the
+> cryptographic hash of the labels of its child nodes.
+> Hash trees allow efficient and secure verification of the
+> contents of large data structures. [...]
+>
+> The concept of hash trees is named after Ralph Merkle
+> who patented it in 1979.
+>
+> -- [Wikipedia](https://en.wikipedia.org/wiki/Merkle_tree)
+
+
+## Usage
+
+
+Pass along all (leaf / data block) hashes as strings or packaged in an array.
+Example:
+
+``` ruby
+merkle = MerkleTree.new(
+  'eb8ecbf6d5870763ae246e37539d82e37052cb32f88bb8c59971f9978e437743',
+  'edbd4e11e69bc399a9ccd8faaea44fb27410fe8e3023bb9462450a0a9c4caa1b',
+  '5ee2981606328abfe0c3b1171440f0df746c1e1f8b3b56c351727f7da7ae5d8d' )
+
+# -or-
+
+merkle = MerkleTree.new( [
+  'eb8ecbf6d5870763ae246e37539d82e37052cb32f88bb8c59971f9978e437743',
+  'edbd4e11e69bc399a9ccd8faaea44fb27410fe8e3023bb9462450a0a9c4caa1b',
+  '5ee2981606328abfe0c3b1171440f0df746c1e1f8b3b56c351727f7da7ae5d8d' ])
+
+
+puts merkle.root.value
+# => '25fd59b79d70bbdf043d66a7b0fc01409d11b990e943bb46b840fbbddd5ab895'
+
+pp merkle    ## pp (pretty print)
+```
+
+resulting in:
+
+```
+@root = #<MerkleTree::Node:0x46b55e0
+   @left = #<MerkleTree::Node:0x46b6060
+     @left = #<MerkleTree::Node:0x46b6870
+       @left  = nil,
+       @right = nil,
+       @value = "eb8ecbf6d5870763ae246e37539d82e37052cb32f88bb8c59971f9978e437743">,
+     @right = #<MerkleTree::Node:0x46b6810
+       @left  = nil,
+       @right = nil,
+       @value = "edbd4e11e69bc399a9ccd8faaea44fb27410fe8e3023bb9462450a0a9c4caa1b">,
+     @value = "c9de03ced4db3c63835807016b1efedb647c694d2db8b9a8579cbf0c5dcb5ab0">,
+   @right= #<MerkleTree::Node:0x46b5ca0
+     @left= #<MerkleTree::Node:0x46b6798
+       @left  = nil,
+       @right = nil,
+       @value = "5ee2981606328abfe0c3b1171440f0df746c1e1f8b3b56c351727f7da7ae5d8d">,
+     @right = #<MerkleTree::Node:0x46b6798
+       @left  = nil,
+       @right = nil,
+       @value = "5ee2981606328abfe0c3b1171440f0df746c1e1f8b3b56c351727f7da7ae5d8d">,
+     @value = "50963aa3b2047e0d58bb850fc12e5a324cf01061af55889389be72d3849e1d03">,
+   @value="25fd59b79d70bbdf043d66a7b0fc01409d11b990e943bb46b840fbbddd5ab895">>
+```
+
+
+Use `MerkleTree.compute_root` for computing the root (crypto) hash without building a
+tree. Example:
+
+``` ruby
+merkle_root_value = MerkleTree.compute_root(
+  'eb8ecbf6d5870763ae246e37539d82e37052cb32f88bb8c59971f9978e437743',
+  'edbd4e11e69bc399a9ccd8faaea44fb27410fe8e3023bb9462450a0a9c4caa1b',
+  '5ee2981606328abfe0c3b1171440f0df746c1e1f8b3b56c351727f7da7ae5d8d' )
+
+# -or-
+
+merkle_root_value = MerkleTree.compute_root( [
+  'eb8ecbf6d5870763ae246e37539d82e37052cb32f88bb8c59971f9978e437743',
+  'edbd4e11e69bc399a9ccd8faaea44fb27410fe8e3023bb9462450a0a9c4caa1b',
+  '5ee2981606328abfe0c3b1171440f0df746c1e1f8b3b56c351727f7da7ae5d8d' ])
+
+
+puts merkle_root_value
+# => '25fd59b79d70bbdf043d66a7b0fc01409d11b990e943bb46b840fbbddd5ab895'
+```
+
+
+### Transactions
+
+Use `MerkleTree.for` or `MerkleTree.compute_root_for` for passing along transactions.
+Will use `to_s` on every transaction and use the resulting "serialized" string
+to (auto-) calculate the (crypto) hash.
+
+Let's put the transactions from the (hyper) ledger book from [Tulips on the Blockchain!](https://github.com/openblockchains/tulips)
+on the ~~blockchain~~ merkle tree:
+
+
+| From                | To           | What                      | Qty |
+|---------------------|--------------|---------------------------|----:|
+| Bloom & Blossom (†) | Daisy        | Tulip Admiral of Admirals |   8 |
+| Vincent             | Max          | Tulip Bloemendaal Sunset  |   2 |
+| Anne                | Martijn      | Tulip Semper Augustus     |   2 |
+| Ruben               | Julia        | Tulip Admiral van Eijck   |   2 |
+
+(†): Grower Transaction - New Tulips on the Market!
+
+``` ruby
+merkle = MerkleTree.for(
+  { from: "Bloom & Blossom", to: "Daisy",   what: "Tulip Admiral of Admirals", qty: 8 },
+  { from: "Vincent",         to: "Max",     what: "Tulip Bloemendaal Sunset",  qty: 2 },
+  { from: "Anne",            to: "Martijn", what: "Tulip Semper Augustus",     qty: 2 },
+  { from: "Ruben",           to: "Julia",   what: "Tulip Admiral van Eijck",   qty: 2 } )
+
+puts merkle.root.value
+# => '703f44630117ef9b4ac20cb149ed8a0f06e4c3ed2a791e11e16a2fe7a7d0de3d'
+
+# -or-
+
+merkle_root_value = MerkleTree.compute_root_for(
+  { from: "Bloom & Blossom", to: "Daisy",   what: "Tulip Admiral of Admirals", qty: 8 },
+  { from: "Vincent",         to: "Max",     what: "Tulip Bloemendaal Sunset",  qty: 2 },
+  { from: "Anne",            to: "Martijn", what: "Tulip Semper Augustus",     qty: 2 },
+  { from: "Ruben",           to: "Julia",   what: "Tulip Admiral van Eijck",   qty: 2 } )
+
+puts merkle_root_value
+# => '703f44630117ef9b4ac20cb149ed8a0f06e4c3ed2a791e11e16a2fe7a7d0de3d'
+```
+
+
+
+## Merkle Tree in the Real World
+
+- [**blockchain-lite**](https://github.com/rubycoco/blockchain) - build your own blockchain with crypto hashes - revolutionize the world with blockchains, blockchains, blockchains one block at a time
+- You? Add your library / service
+
+
+## References
+
+[**Programming Cryptocurrencies and Blockchains (in Ruby)**](http://yukimotopress.github.io/blockchains) by Gerald Bauer et al, 2018, Yuki & Moto Press
+
+
+
+## License
+
+![](https://publicdomainworks.github.io/buttons/zero88x31.png)
+
+The `merkletree` scripts are dedicated to the public domain.
+Use it as you please with no restrictions whatsoever.

data/Rakefile

@@ -1,29 +1,29 @@
-require 'hoe'
-require './lib/merkletree/version.rb'
-
-Hoe.spec 'merkletree' do
-
-  self.version = MerkleTree::VERSION
-
-  self.summary = "merkletree - build your own crypto hash trees; named after Ralph Merkle who patented hash trees in 1979; grow your own money on trees"
-  self.description = summary
-
-  self.urls    = ['https://github.com/openblockchains/merkletree.rb']
-
-  self.author  = 'Gerald Bauer'
-  self.email   = 'wwwmake@googlegroups.com'
-
-  # switch extension to .markdown for gihub formatting
-  self.readme_file  = 'README.md'
-  self.history_file = 'HISTORY.md'
-
-  ## self.extra_deps = [
-  ## ]
-
-  self.licenses = ['Public Domain']
-
-  self.spec_extras = {
-    required_ruby_version: '>= 2.3'
-  }
-
-end
+require 'hoe'
+require './lib/merkletree/version.rb'
+
+Hoe.spec 'merkletree' do
+
+  self.version = MerkleTree::VERSION
+
+  self.summary = "merkletree - build your own crypto hash trees; named after Ralph Merkle who patented hash trees in 1979; grow your own money on trees"
+  self.description = summary
+
+  self.urls    = { home: 'https://github.com/rubycoco/blockchain' }
+
+  self.author  = 'Gerald Bauer'
+  self.email   = 'wwwmake@googlegroups.com'
+
+  # switch extension to .markdown for gihub formatting
+  self.readme_file  = 'README.md'
+  self.history_file = 'CHANGELOG.md'
+
+  ## self.extra_deps = [
+  ## ]
+
+  self.licenses = ['Public Domain']
+
+  self.spec_extras = {
+    required_ruby_version: '>= 2.3'
+  }
+
+end

data/lib/merkletree.rb

@@ -26,6 +26,26 @@ class MerkleTree
        @left  = left
        @right = right
     end
+
+
+    ####
+    ## for debugging / testing add pretty printing (dump tree)
+    def dump() do_dump( 0 ); end
+
+    def do_dump( depth )    ## dump (recursive_worker)
+      depth.times { print ' ' }
+      print "#{depth}:[#{value}] "
+      if @left
+        print '{'
+        puts
+        @left.do_dump( depth+1 )
+        @right.do_dump( depth+1)  if @right    # note: make right node optional (might be nil/empty)
+        depth.times { print ' ' }
+        print '}'
+      end
+      puts
+    end # do_dump
+
   end # class Node
 
 
@@ -103,6 +123,7 @@ class MerkleTree
 
 
 
+
   ### shortcut/convenience -  compute root hash w/o building tree nodes
   def self.compute_root( *args )
     if args.size == 1 && args[0].is_a?( Array )
@@ -150,4 +171,4 @@ end # class MerkleTree
 
 
 # say hello
-puts MerkleTree.banner    if defined?($RUBYLIBS_DEBUG) && $RUBYLIBS_DEBUG
+puts MerkleTree.banner      ## if defined?($RUBYLIBS_DEBUG) && $RUBYLIBS_DEBUG

data/lib/merkletree/version.rb

@@ -1,24 +1,22 @@
-# encoding: utf-8
-
-
-class MerkleTree    ## note: use class (!) for now and NOT module
-
-
-  MAJOR = 0
-  MINOR = 1
-  PATCH = 0
-  VERSION = [MAJOR,MINOR,PATCH].join('.')
-
-  def self.version
-    VERSION
-  end
-
-  def self.banner
-    "merkletree/#{VERSION} on Ruby #{RUBY_VERSION} (#{RUBY_RELEASE_DATE}) [#{RUBY_PLATFORM}]"
-  end
-
-  def self.root
-    "#{File.expand_path( File.dirname(File.dirname(File.dirname(__FILE__))) )}"
-  end
-
-end # module MerkleTree
+# encoding: utf-8
+
+
+class MerkleTree    ## note: use class (!) for now and NOT module
+  MAJOR = 0
+  MINOR = 1
+  PATCH = 1
+  VERSION = [MAJOR,MINOR,PATCH].join('.')
+
+  def self.version
+    VERSION
+  end
+
+  def self.banner
+    "merkletree/#{VERSION} on Ruby #{RUBY_VERSION} (#{RUBY_RELEASE_DATE}) [#{RUBY_PLATFORM}] in (#{root})"
+  end
+
+  def self.root
+    File.expand_path( File.dirname(File.dirname(File.dirname(__FILE__))) )
+  end
+
+end # module MerkleTree

data/test/helper.rb

@@ -1,10 +1,10 @@
-## $:.unshift(File.dirname(__FILE__))
-
-## minitest setup
-
-require 'minitest/autorun'
-
-
-## our own code
-
-require 'merkletree'
+## $:.unshift(File.dirname(__FILE__))
+
+## minitest setup
+
+require 'minitest/autorun'
+
+
+## our own code
+
+require 'merkletree'

data/test/test_build.rb

@@ -1,158 +1,164 @@
-# encoding: utf-8
-
-###
-#  to run use
-#     ruby -I ./lib -I ./test test/test_build.rb
-
-
-require 'helper'
-
-
-class TestBuild < MiniTest::Test
-
-
-def test_example_4
-
-  hashes = [
-    '00',
-    '11',
-    '22',
-    '33',
-  ]
-
-  hash00   = '00'
-  hash11   = '11'
-  hash0011 = MerkleTree.calc_hash( hash00 + hash11 )
-
-  hash22   = '22'
-  hash33   = '33'
-  hash2233 = MerkleTree.calc_hash( hash22 + hash33 )
-
-  hash00112233 = MerkleTree.calc_hash( hash0011 + hash2233 )
-
-
-  merkle = MerkleTree.new( hashes )
-
-  puts "merkletree root hash:"
-  puts merkle.root.value
-
-  puts "merkletree:"
-  pp merkle.root
-
-  assert_equal hash00, merkle.root.left.left.value
-  assert_equal hash11, merkle.root.left.right.value
-  assert_equal hash22, merkle.root.right.left.value
-  assert_equal hash33, merkle.root.right.right.value
-
-  assert_equal hash0011, merkle.root.left.value
-  assert_equal hash2233, merkle.root.right.value
-
-  assert_equal hash00112233, merkle.root.value
-
-
-
-  merkle_root_value = MerkleTree.compute_root( hashes )
-  puts "merkletree root hash:"
-  puts merkle_root_value
-
-  assert_equal merkle.root.value, merkle_root_value
-end   # method test_example_4
-
-
-def test_example_3   ## test odd (not even hashes)
-
-  hashes = [
-    '00',
-    '11',
-    '22',
-  ]
-
-  hash00   = '00'
-  hash11   = '11'
-  hash0011 = MerkleTree.calc_hash( hash00 + hash11 )
-
-  hash22   = '22'
-  hash2222 = MerkleTree.calc_hash( hash22 + hash22 )
-
-  hash00112222 = MerkleTree.calc_hash( hash0011 + hash2222 )
-
-
-  merkle = MerkleTree.new( hashes )
-
-  puts "merkletree root hash:"
-  puts merkle.root.value
-
-  puts "merkletree:"
-  pp merkle.root
-
-  assert_equal hash00, merkle.root.left.left.value
-  assert_equal hash11, merkle.root.left.right.value
-  assert_equal hash22, merkle.root.right.left.value
-  assert_equal hash22, merkle.root.right.right.value
-
-  assert_equal hash0011, merkle.root.left.value
-  assert_equal hash2222, merkle.root.right.value
-
-  assert_equal hash00112222, merkle.root.value
-
-
-
-  merkle_root_value = MerkleTree.compute_root( hashes )
-  puts "merkletree root hash:"
-  puts merkle_root_value
-
-  assert_equal merkle.root.value, merkle_root_value
-end   # method test_example_3
-
-
-def test_example_5   ## test odd (not even hashes)
-
-  hashes = [
-    '0000',
-    '0011',
-    '0022',
-    '0033',
-    '0044',
-  ]
-
-  merkle = MerkleTree.new( hashes )
-
-  puts "merkletree root hash:"
-  puts merkle.root.value
-
-  puts "merkletree:"
-  pp merkle.root
-
-
-  merkle_root_value = MerkleTree.compute_root( hashes )
-  puts "merkletree root hash:"
-  puts merkle_root_value
-
-  assert_equal merkle.root.value, merkle_root_value
-end   # method test_example_5
-
-
-def test_tulips
-
-  merkle = MerkleTree.for(
-        { from: "Dutchgrown", to: "Vincent", what: "Tulip Bloemendaal Sunset", qty: 10 },
-        { from: "Keukenhof",  to: "Anne",    what: "Tulip Semper Augustus",    qty: 7  } )
-
-  puts "merkletree root hash:"
-  puts merkle.root.value
-
-  puts "merkletree:"
-  pp merkle.root
-
-  merkle_root_value = MerkleTree.compute_root_for(
-    { from: "Dutchgrown", to: "Vincent", what: "Tulip Bloemendaal Sunset", qty: 10 },
-    { from: "Keukenhof",  to: "Anne",    what: "Tulip Semper Augustus",    qty: 7  } )
-
-  puts "merkletree root hash:"
-  puts merkle_root_value
-
-  assert_equal merkle.root.value, merkle_root_value
-end  # method test_tulips
-
-
-end  # class TestBuild
+# encoding: utf-8
+
+###
+#  to run use
+#     ruby -I ./lib -I ./test test/test_build.rb
+
+
+require 'helper'
+
+
+class TestBuild < MiniTest::Test
+
+
+def test_example_4
+
+  hashes = [
+    '00',
+    '11',
+    '22',
+    '33',
+  ]
+
+  hash00   = '00'
+  hash11   = '11'
+  hash0011 = MerkleTree.calc_hash( hash00 + hash11 )
+
+  hash22   = '22'
+  hash33   = '33'
+  hash2233 = MerkleTree.calc_hash( hash22 + hash33 )
+
+  hash00112233 = MerkleTree.calc_hash( hash0011 + hash2233 )
+
+
+  merkle = MerkleTree.new( hashes )
+
+  puts "merkletree root hash:"
+  puts merkle.root.value
+
+  puts "merkletree:"
+  pp merkle.root
+
+  assert_equal hash00, merkle.root.left.left.value
+  assert_equal hash11, merkle.root.left.right.value
+  assert_equal hash22, merkle.root.right.left.value
+  assert_equal hash33, merkle.root.right.right.value
+
+  assert_equal hash0011, merkle.root.left.value
+  assert_equal hash2233, merkle.root.right.value
+
+  assert_equal hash00112233, merkle.root.value
+
+
+
+  merkle_root_value = MerkleTree.compute_root( hashes )
+  puts "merkletree root hash:"
+  puts merkle_root_value
+
+  assert_equal merkle.root.value, merkle_root_value
+end   # method test_example_4
+
+
+def test_example_3   ## test odd (not even hashes)
+
+  hashes = [
+    '00',
+    '11',
+    '22',
+  ]
+
+  hash00   = '00'
+  hash11   = '11'
+  hash0011 = MerkleTree.calc_hash( hash00 + hash11 )
+
+  hash22   = '22'
+  hash2222 = MerkleTree.calc_hash( hash22 + hash22 )
+
+  hash00112222 = MerkleTree.calc_hash( hash0011 + hash2222 )
+
+
+  merkle = MerkleTree.new( hashes )
+
+  puts "merkletree root hash:"
+  puts merkle.root.value
+
+  ## try handcoded pretty printer (dump)
+  merkle.root.dump
+
+  puts "merkletree:"
+  pp merkle.root
+
+  assert_equal hash00, merkle.root.left.left.value
+  assert_equal hash11, merkle.root.left.right.value
+  assert_equal hash22, merkle.root.right.left.value
+  assert_equal hash22, merkle.root.right.right.value
+
+  assert_equal hash0011, merkle.root.left.value
+  assert_equal hash2222, merkle.root.right.value
+
+  assert_equal hash00112222, merkle.root.value
+
+
+
+  merkle_root_value = MerkleTree.compute_root( hashes )
+  puts "merkletree root hash:"
+  puts merkle_root_value
+
+  assert_equal merkle.root.value, merkle_root_value
+end   # method test_example_3
+
+
+def test_example_5   ## test odd (not even hashes)
+
+  hashes = [
+    '0000',
+    '0011',
+    '0022',
+    '0033',
+    '0044',
+  ]
+
+  merkle = MerkleTree.new( hashes )
+
+  puts "merkletree root hash:"
+  puts merkle.root.value
+
+  puts "merkletree:"
+  pp merkle.root
+
+  ## try handcoded pretty printer (dump)
+  merkle.root.dump
+
+
+  merkle_root_value = MerkleTree.compute_root( hashes )
+  puts "merkletree root hash:"
+  puts merkle_root_value
+
+  assert_equal merkle.root.value, merkle_root_value
+end   # method test_example_5
+
+
+def test_tulips
+
+  merkle = MerkleTree.for(
+        { from: "Dutchgrown", to: "Vincent", what: "Tulip Bloemendaal Sunset", qty: 10 },
+        { from: "Keukenhof",  to: "Anne",    what: "Tulip Semper Augustus",    qty: 7  } )
+
+  puts "merkletree root hash:"
+  puts merkle.root.value
+
+  puts "merkletree:"
+  pp merkle.root
+
+  merkle_root_value = MerkleTree.compute_root_for(
+    { from: "Dutchgrown", to: "Vincent", what: "Tulip Bloemendaal Sunset", qty: 10 },
+    { from: "Keukenhof",  to: "Anne",    what: "Tulip Semper Augustus",    qty: 7  } )
+
+  puts "merkletree root hash:"
+  puts merkle_root_value
+
+  assert_equal merkle.root.value, merkle_root_value
+end  # method test_tulips
+
+
+end  # class TestBuild

metadata

@@ -1,56 +1,60 @@
 --- !ruby/object:Gem::Specification
 name: merkletree
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.1.1
 platform: ruby
 authors:
 - Gerald Bauer
-autorequire: 
+autorequire:
 bindir: bin
 cert_chain: []
-date: 2017-12-19 00:00:00.000000000 Z
+date: 2021-01-10 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rdoc
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '4.0'
+    - - "<"
+      - !ruby/object:Gem::Version
+        version: '7'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: '4.0'
+    - - "<"
+      - !ruby/object:Gem::Version
+        version: '7'
 - !ruby/object:Gem::Dependency
   name: hoe
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '3.16'
+        version: '3.22'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '3.16'
+        version: '3.22'
 description: merkletree - build your own crypto hash trees; named after Ralph Merkle
   who patented hash trees in 1979; grow your own money on trees
 email: wwwmake@googlegroups.com
 executables: []
 extensions: []
 extra_rdoc_files:
-- HISTORY.md
-- LICENSE.md
+- CHANGELOG.md
 - Manifest.txt
 - README.md
 files:
-- HISTORY.md
-- LICENSE.md
+- CHANGELOG.md
 - Manifest.txt
 - README.md
 - Rakefile
@@ -60,11 +64,11 @@ files:
 - test/test_build.rb
 - test/test_readme.rb
 - test/test_version.rb
-homepage: https://github.com/openblockchains/merkletree.rb
+homepage: https://github.com/rubycoco/blockchain
 licenses:
 - Public Domain
 metadata: {}
-post_install_message: 
+post_install_message:
 rdoc_options:
 - "--main"
 - README.md
@@ -81,9 +85,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: 
-rubygems_version: 2.5.2
-signing_key: 
+rubygems_version: 3.1.4
+signing_key:
 specification_version: 4
 summary: merkletree - build your own crypto hash trees; named after Ralph Merkle who
   patented hash trees in 1979; grow your own money on trees

data/LICENSE.md

@@ -1,116 +0,0 @@
-CC0 1.0 Universal
-
-Statement of Purpose
-
-The laws of most jurisdictions throughout the world automatically confer
-exclusive Copyright and Related Rights (defined below) upon the creator and
-subsequent owner(s) (each and all, an "owner") of an original work of
-authorship and/or a database (each, a "Work").
-
-Certain owners wish to permanently relinquish those rights to a Work for the
-purpose of contributing to a commons of creative, cultural and scientific
-works ("Commons") that the public can reliably and without fear of later
-claims of infringement build upon, modify, incorporate in other works, reuse
-and redistribute as freely as possible in any form whatsoever and for any
-purposes, including without limitation commercial purposes. These owners may
-contribute to the Commons to promote the ideal of a free culture and the
-further production of creative, cultural and scientific works, or to gain
-reputation or greater distribution for their Work in part through the use and
-efforts of others.
-
-For these and/or other purposes and motivations, and without any expectation
-of additional consideration or compensation, the person associating CC0 with a
-Work (the "Affirmer"), to the extent that he or she is an owner of Copyright
-and Related Rights in the Work, voluntarily elects to apply CC0 to the Work
-and publicly distribute the Work under its terms, with knowledge of his or her
-Copyright and Related Rights in the Work and the meaning and intended legal
-effect of CC0 on those rights.
-
-1. Copyright and Related Rights. A Work made available under CC0 may be
-protected by copyright and related or neighboring rights ("Copyright and
-Related Rights"). Copyright and Related Rights include, but are not limited
-to, the following:
-
-  i. the right to reproduce, adapt, distribute, perform, display, communicate,
-  and translate a Work;
-
-  ii. moral rights retained by the original author(s) and/or performer(s);
-
-  iii. publicity and privacy rights pertaining to a person's image or likeness
-  depicted in a Work;
-
-  iv. rights protecting against unfair competition in regards to a Work,
-  subject to the limitations in paragraph 4(a), below;
-
-  v. rights protecting the extraction, dissemination, use and reuse of data in
-  a Work;
-
-  vi. database rights (such as those arising under Directive 96/9/EC of the
-  European Parliament and of the Council of 11 March 1996 on the legal
-  protection of databases, and under any national implementation thereof,
-  including any amended or successor version of such directive); and
-
-  vii. other similar, equivalent or corresponding rights throughout the world
-  based on applicable law or treaty, and any national implementations thereof.
-
-2. Waiver. To the greatest extent permitted by, but not in contravention of,
-applicable law, Affirmer hereby overtly, fully, permanently, irrevocably and
-unconditionally waives, abandons, and surrenders all of Affirmer's Copyright
-and Related Rights and associated claims and causes of action, whether now
-known or unknown (including existing as well as future claims and causes of
-action), in the Work (i) in all territories worldwide, (ii) for the maximum
-duration provided by applicable law or treaty (including future time
-extensions), (iii) in any current or future medium and for any number of
-copies, and (iv) for any purpose whatsoever, including without limitation
-commercial, advertising or promotional purposes (the "Waiver"). Affirmer makes
-the Waiver for the benefit of each member of the public at large and to the
-detriment of Affirmer's heirs and successors, fully intending that such Waiver
-shall not be subject to revocation, rescission, cancellation, termination, or
-any other legal or equitable action to disrupt the quiet enjoyment of the Work
-by the public as contemplated by Affirmer's express Statement of Purpose.
-
-3. Public License Fallback. Should any part of the Waiver for any reason be
-judged legally invalid or ineffective under applicable law, then the Waiver
-shall be preserved to the maximum extent permitted taking into account
-Affirmer's express Statement of Purpose. In addition, to the extent the Waiver
-is so judged Affirmer hereby grants to each affected person a royalty-free,
-non transferable, non sublicensable, non exclusive, irrevocable and
-unconditional license to exercise Affirmer's Copyright and Related Rights in
-the Work (i) in all territories worldwide, (ii) for the maximum duration
-provided by applicable law or treaty (including future time extensions), (iii)
-in any current or future medium and for any number of copies, and (iv) for any
-purpose whatsoever, including without limitation commercial, advertising or
-promotional purposes (the "License"). The License shall be deemed effective as
-of the date CC0 was applied by Affirmer to the Work. Should any part of the
-License for any reason be judged legally invalid or ineffective under
-applicable law, such partial invalidity or ineffectiveness shall not
-invalidate the remainder of the License, and in such case Affirmer hereby
-affirms that he or she will not (i) exercise any of his or her remaining
-Copyright and Related Rights in the Work or (ii) assert any associated claims
-and causes of action with respect to the Work, in either case contrary to
-Affirmer's express Statement of Purpose.
-
-4. Limitations and Disclaimers.
-
-  a. No trademark or patent rights held by Affirmer are waived, abandoned,
-  surrendered, licensed or otherwise affected by this document.
-
-  b. Affirmer offers the Work as-is and makes no representations or warranties
-  of any kind concerning the Work, express, implied, statutory or otherwise,
-  including without limitation warranties of title, merchantability, fitness
-  for a particular purpose, non infringement, or the absence of latent or
-  other defects, accuracy, or the present or absence of errors, whether or not
-  discoverable, all to the greatest extent permissible under applicable law.
-
-  c. Affirmer disclaims responsibility for clearing rights of other persons
-  that may apply to the Work or any use thereof, including without limitation
-  any person's Copyright and Related Rights in the Work. Further, Affirmer
-  disclaims responsibility for obtaining any necessary consents, permissions
-  or other rights required for any use of the Work.
-
-  d. Affirmer understands and acknowledges that Creative Commons is not a
-  party to this document and has no duty or obligation with respect to this
-  CC0 or use of the Work.
-
-For more information, please see
-<http://creativecommons.org/publicdomain/zero/1.0/>