mssmt 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: c2bf77bb8efa4e33fe73b3bd1b54e577e02097fadda8420924caf8df0ad9df21
+  data.tar.gz: a5715d5289504147a0b76f8c3935910df965cae05df2a284136735389f8daa27
+SHA512:
+  metadata.gz: 30e1c75109384039d6d87ed9702e7bfbe2848e499285460b67da66dd80668e32590ce409d5deedd64a08ed5cae6f558d40817c73275a271c0b92c6a0f1cab8e0
+  data.tar.gz: 6231535740549dfdb317e122945464ec92789c24479f164058ebdb06a3bfb2cabd688a0b6c0eca4c48881e9a891f5b72532a7609b4ec27edf132f9986f6ad558

data/.prettierignore

@@ -0,0 +1,2 @@
+/bin
+/vendor

data/.rspec

@@ -0,0 +1,3 @@
+--format documentation
+--color
+--require spec_helper

data/.rubocop.yml

@@ -0,0 +1,17 @@
+require:
+  - rubocop-rake
+  - rubocop-rspec
+inherit_gem:
+  prettier: rubocop.yml
+AllCops:
+  TargetRubyVersion: 2.7
+RSpec/ExampleLength:
+  Enabled: false
+Metrics:
+  Enabled: false
+RSpec/MultipleExpectations:
+  Max: 5
+Style/IfUnlessModifier:
+  Enabled: false
+Style/WhileUntilModifier:
+  Enabled: false

data/.ruby-gemset

@@ -0,0 +1 @@
+mssmtrb

data/.ruby-version

@@ -0,0 +1 @@
+ruby-3.1.2

data/CHANGELOG.md

@@ -0,0 +1,5 @@
+## [Unreleased]
+
+## [0.1.0] - 2022-10-04
+
+- Initial release

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,84 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+We as members, contributors, and leaders pledge to make participation in our community a harassment-free experience for everyone, regardless of age, body size, visible or invisible disability, ethnicity, sex characteristics, gender identity and expression, level of experience, education, socio-economic status, nationality, personal appearance, race, religion, or sexual identity and orientation.
+
+We pledge to act and interact in ways that contribute to an open, welcoming, diverse, inclusive, and healthy community.
+
+## Our Standards
+
+Examples of behavior that contributes to a positive environment for our community include:
+
+* Demonstrating empathy and kindness toward other people
+* Being respectful of differing opinions, viewpoints, and experiences
+* Giving and gracefully accepting constructive feedback
+* Accepting responsibility and apologizing to those affected by our mistakes, and learning from the experience
+* Focusing on what is best not just for us as individuals, but for the overall community
+
+Examples of unacceptable behavior include:
+
+* The use of sexualized language or imagery, and sexual attention or
+  advances of any kind
+* Trolling, insulting or derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or email
+  address, without their explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Enforcement Responsibilities
+
+Community leaders are responsible for clarifying and enforcing our standards of acceptable behavior and will take appropriate and fair corrective action in response to any behavior that they deem inappropriate, threatening, offensive, or harmful.
+
+Community leaders have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, and will communicate reasons for moderation decisions when appropriate.
+
+## Scope
+
+This Code of Conduct applies within all community spaces, and also applies when an individual is officially representing the community in public spaces. Examples of representing our community include using an official e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be reported to the community leaders responsible for enforcement at azuchi@chaintope.com. All complaints will be reviewed and investigated promptly and fairly.
+
+All community leaders are obligated to respect the privacy and security of the reporter of any incident.
+
+## Enforcement Guidelines
+
+Community leaders will follow these Community Impact Guidelines in determining the consequences for any action they deem in violation of this Code of Conduct:
+
+### 1. Correction
+
+**Community Impact**: Use of inappropriate language or other behavior deemed unprofessional or unwelcome in the community.
+
+**Consequence**: A private, written warning from community leaders, providing clarity around the nature of the violation and an explanation of why the behavior was inappropriate. A public apology may be requested.
+
+### 2. Warning
+
+**Community Impact**: A violation through a single incident or series of actions.
+
+**Consequence**: A warning with consequences for continued behavior. No interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, for a specified period of time. This includes avoiding interactions in community spaces as well as external channels like social media. Violating these terms may lead to a temporary or permanent ban.
+
+### 3. Temporary Ban
+
+**Community Impact**: A serious violation of community standards, including sustained inappropriate behavior.
+
+**Consequence**: A temporary ban from any sort of interaction or public communication with the community for a specified period of time. No public or private interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, is allowed during this period. Violating these terms may lead to a permanent ban.
+
+### 4. Permanent Ban
+
+**Community Impact**: Demonstrating a pattern of violation of community standards, including sustained inappropriate behavior,  harassment of an individual, or aggression toward or disparagement of classes of individuals.
+
+**Consequence**: A permanent ban from any sort of public interaction within the community.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 2.0,
+available at https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
+
+Community Impact Guidelines were inspired by [Mozilla's code of conduct enforcement ladder](https://github.com/mozilla/diversity).
+
+[homepage]: https://www.contributor-covenant.org
+
+For answers to common questions about this code of conduct, see the FAQ at
+https://www.contributor-covenant.org/faq. Translations are available at https://www.contributor-covenant.org/translations.

data/Gemfile

@@ -0,0 +1,15 @@
+# frozen_string_literal: true
+
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in mssmt.gemspec
+gemspec
+
+gem 'rake', '~> 13.0'
+
+gem 'rspec', '~> 3.0'
+
+gem 'prettier'
+
+gem 'rubocop-rake'
+gem 'rubocop-rspec'

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2022 azuchi
+
+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.

data/README.md

@@ -0,0 +1,66 @@
+# Merkle Sum Sparse Merkle Tree
+
+This is the Merkle Sum Sparse Merkle Tree(MS-SMT) ruby library.
+[MS-SMT](https://github.com/Roasbeef/bips/blob/bip-taro/bip-taro.mediawiki#MerkleSum_Sparse_Merkle_Trees) is a tree 
+that combines the Sparse Merkle Tree and the Merkle-Sum Tree and is defined by the [Taro protocol](https://github.com/Roasbeef/bips/blob/bip-taro/bip-taro.mediawiki).
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'mssmt'
+```
+
+And then execute:
+
+    $ bundle install
+
+Or install it yourself as:
+
+    $ gem install mssmt
+
+## Usage
+
+```ruby
+require 'mssmt'
+
+# initialize tree
+tree = MSSMT::Tree.new
+
+# Add leaf node to tree with key.
+leaf = MSSMT::LeafNode.new("Data", 1_000)
+key = "5bc565ef18dbe0636cd3398a870ae24e1f184e5c484e1af3a502f77a0aceb0c5"
+tree.insert(key, leaf)
+
+# Get root node
+root_node = tree.root_node
+# Root hash
+root_hash = tree.root_hash
+# or
+root_node.node_hash
+
+# Get leaf node in tree
+leaf = tree.get(key)
+
+# Get merkle proof correspond to key
+proof = tree.merkle_proof(key)
+
+# Check merkle proof validity.
+result = tree.valid_merkle_proof?(key, leaf, proof)
+
+# Delete leaf node
+tree.delete(key)
+```
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/mssmt. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [code of conduct](https://github.com/[USERNAME]/mssmt/blob/master/CODE_OF_CONDUCT.md).
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
+
+## Code of Conduct
+
+Everyone interacting in the Mssmt project's codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/[USERNAME]/mssmt/blob/master/CODE_OF_CONDUCT.md).

data/Rakefile

@@ -0,0 +1,8 @@
+# frozen_string_literal: true
+
+require 'bundler/gem_tasks'
+require 'rspec/core/rake_task'
+
+RSpec::Core::RakeTask.new(:spec)
+
+task default: :spec

data/bin/console

@@ -0,0 +1,15 @@
+#!/usr/bin/env ruby
+# frozen_string_literal: true
+
+require 'bundler/setup'
+require 'mssmt'
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require 'irb'
+IRB.start(__FILE__)

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/lib/mssmt/branch_node.rb

@@ -0,0 +1,25 @@
+# frozen_string_literal: true
+
+module MSSMT
+  # Intermediate or root node within a MS-SMT.
+  class BranchNode
+    attr_reader :left, :right, :node_hash, :sum
+
+    def initialize(left, right)
+      if !left.is_a?(BranchNode) && !left.is_a?(LeafNode)
+        raise ArgumentError, "left must be a branch or leaf node"
+      end
+      if !right.is_a?(BranchNode) && !right.is_a?(LeafNode)
+        raise ArgumentError, "right must be a branch or leaf node"
+      end
+
+      @left = left
+      @right = right
+      @sum = left.sum + right.sum
+      @node_hash =
+        Digest::SHA256.digest(
+          "#{left.node_hash}#{right.node_hash}#{[@sum].pack("Q>")}"
+        )
+    end
+  end
+end

data/lib/mssmt/leaf_node.rb

@@ -0,0 +1,34 @@
+# frozen_string_literal: true
+
+module MSSMT
+  # Leaf node within a MS-SMT that commit to a value and some integer value (the sum) associated with the value.
+  class LeafNode
+    attr_reader :value, :sum
+
+    # Constructor
+    # @param [String] value node value with binary format.
+    # @param [Integer] sum integer value associated with the value
+    def initialize(value, sum)
+      @value = value
+      @sum = sum
+    end
+
+    # Generate empty leaf node.
+    # @return [MSSMT::LeafNode]
+    def self.empty_leaf
+      LeafNode.new(nil, 0)
+    end
+
+    # Calculate node hash.
+    # @return [String] hash value.
+    def node_hash
+      Digest::SHA256.digest("#{value}#{[sum].pack("Q>")}")
+    end
+
+    # Check whether value and sum is empty.
+    # @return [Boolean]
+    def empty?
+      (value.nil? or value.empty?) && sum.zero?
+    end
+  end
+end

data/lib/mssmt/store/default_store.rb

@@ -0,0 +1,48 @@
+# frozen_string_literal: true
+
+module MSSMT
+  module Store
+    # In-memory implementation of the tree store.
+    class DefaultStore
+      attr_accessor :branches, :leaves, :root
+
+      def initialize
+        @branches = {}
+        @leaves = {}
+        @root = nil
+      end
+
+      # Insert branch node.
+      # @param [MSSMT::BranchNode] branch
+      # @raise [ArgumentError]
+      def insert_branch(branch)
+        unless branch.is_a?(MSSMT::BranchNode)
+          raise "branch must be MSSMT::BranchNode"
+        end
+
+        branches[branch.node_hash] = branch
+      end
+
+      # Insert leaf node.
+      # @param [MSSMT::LeafNode] leaf
+      # @raise [ArgumentError]
+      def insert_leaf(leaf)
+        raise "leaf must be MSSMT::LeafNode" unless leaf.is_a?(MSSMT::LeafNode)
+
+        leaves[leaf.node_hash] = leaf
+      end
+
+      # Delete branch node.
+      # @param [String] node_hash node hash of branch node.
+      def delete_branch(node_hash)
+        branches.delete(node_hash)
+      end
+
+      # Delete leaf node
+      # @param [String] node_hash node hash of leaf node.
+      def delete_leaf(node_hash)
+        leaves.delete(node_hash)
+      end
+    end
+  end
+end

data/lib/mssmt/store.rb

@@ -0,0 +1,8 @@
+# frozen_string_literal: true
+
+module MSSMT
+  # MS-SMT store implementations
+  module Store
+    autoload :DefaultStore, "mssmt/store/default_store"
+  end
+end

data/lib/mssmt/tree.rb

@@ -0,0 +1,172 @@
+# frozen_string_literal: true
+
+module MSSMT
+  # MS-SMT tree
+  class Tree
+    # The size of a SHA256 checksum in bytes.
+    HASH_SIZE = 32
+    # Depth of the MS-SMT(using SHA256)
+    MAX_LEVEL = HASH_SIZE * 8
+    # Index of the last bit for MS-SMT keys
+    LAST_BIT_INDEX = MAX_LEVEL - 1
+
+    attr_reader :empty_tree, :store
+
+    def initialize(store: MSSMT::Store::DefaultStore.new)
+      @empty_tree = build_empty_tree
+      @store = store
+    end
+
+    # Root hash of this tree
+    # @return [String] root hash value.
+    def root_hash
+      root_node.node_hash
+    end
+
+    # Get root node in tree.
+    # @return [MSSMT::BranchNode]
+    def root_node
+      store.root.nil? ? empty_tree[0] : store.root
+    end
+
+    # Insert a leaf node at the given key within the MS-SMT.
+    # @param [String] key key with hex format.
+    # @param [MSSMT::LeafNode] leaf leaf node.
+    # @return [MSSMT::BranchNode] Updated root node.
+    # @raise [MSSMT::Error]
+    def insert(key, leaf)
+      unless [key].pack("H*").bytesize == HASH_SIZE
+        raise MSSMT::Error, "key must be #{HASH_SIZE} bytes"
+      end
+
+      prev_parents = Array.new(MSSMT::Tree::MAX_LEVEL)
+      siblings = Array.new(MSSMT::Tree::MAX_LEVEL)
+      walk_down(key) do |i, _, sibling, parent|
+        prev_parents[MSSMT::Tree::MAX_LEVEL - 1 - i] = parent.node_hash
+        siblings[MSSMT::Tree::MAX_LEVEL - 1 - i] = sibling
+      end
+
+      root =
+        walk_up(key, leaf, siblings) do |i, _, _, parent|
+          prev_parent = prev_parents[MSSMT::Tree::MAX_LEVEL - 1 - i]
+          unless prev_parent == empty_tree[i].node_hash
+            store.delete_branch(prev_parent)
+          end
+          unless parent.node_hash == empty_tree[i].node_hash
+            store.insert_branch(parent)
+          end
+        end
+
+      leaf.empty? ? store.delete_leaf(key) : store.insert_leaf(leaf)
+      store.root = root
+    end
+
+    # Delete the leaf node found at the given key within the MS-SMT.
+    # @param [String] key key with hex format.
+    def delete(key)
+      store.root = insert(key, MSSMT::LeafNode.empty_leaf)
+    end
+
+    # Get leaf node found at the given key within the MS-SMT.
+    # @param [String] key key with hex format.
+    # @return [MSSMT::LeafNode] leaf node.
+    def get(key)
+      walk_down(key)
+    end
+
+    # Generate a merkle proof for the leaf node found at the given +key+.
+    # @param [String] key key with hex format.
+    # @return [Array] merkle proof
+    def merkle_proof(key)
+      proof = Array.new(MAX_LEVEL)
+      walk_down(key) { |i, _, sibling, _| proof[MAX_LEVEL - 1 - i] = sibling }
+      proof
+    end
+
+    # Verify whether a merkle proof for the leaf found at the given key is valid.
+    # @param [String] key key with hex format.
+    # @param [MSSMT::LeafNode] leaf leaf node.
+    # @param [Array] proof merkle proof.
+    def valid_merkle_proof?(key, leaf, proof)
+      root_hash == walk_up(key, leaf, proof).node_hash
+    end
+
+    private
+
+    # Get children
+    # @param [Integer] height Tree height.
+    # @param [String] key
+    # @return [Array(MSSMT::BranchNode|MSSMT::LeafNode)]
+    # @raise [MSSMT::Error]
+    def get_children(height, key)
+      node = get_node(height, key)
+      if node.is_a?(MSSMT::BranchNode)
+        return [
+          get_node(height + 1, node.left.node_hash),
+          get_node(height + 1, node.right.node_hash)
+        ]
+      end
+      raise MSSMT::Error, "unexpected node type with key: #{key}"
+    end
+
+    def get_node(height, key)
+      return empty_tree[height] if empty_tree[height].node_hash == key
+      store.branches[key] || store.leaves[key]
+    end
+
+    # Walk down tree from root and return leaf node.
+    # @param [String] key
+    # @return [MSSMT::LeafNode] Leaf node corresponding to key.
+    def walk_down(key)
+      current = root_node
+      MSSMT::Tree::MAX_LEVEL.times do |i|
+        left, right = get_children(i, current.node_hash)
+        next_node, sibling =
+          bit_index(i, key).zero? ? [left, right] : [right, left]
+        yield(i, next_node, sibling, current) if block_given?
+        current = next_node
+      end
+      current
+    end
+
+    # Walk up from the +start+ leaf node up to the root with the help of +siblings+.
+    # @param [String] key
+    # @param [MSSMT::LeafNode] start Start leaf node.
+    # @param [Array] siblings
+    # @return [MSSMT::BranchNode] The root branch node computed.
+    def walk_up(key, start, siblings)
+      current = start
+      MAX_LEVEL.times do |index|
+        i = LAST_BIT_INDEX - index
+        sibling = siblings[LAST_BIT_INDEX - i]
+        left, right =
+          bit_index(i, key).zero? ? [current, sibling] : [sibling, current]
+        parent = BranchNode.new(left, right)
+        yield(i, current, sibling, parent) if block_given?
+        current = parent
+      end
+      current
+    end
+
+    def bit_index(idx, key)
+      value = [key].pack("H*")[idx / 8].ord
+      (value >> (idx % 8)) & 1
+    end
+
+    # Generate empty tree.
+    # @return [Array]
+    def build_empty_tree
+      tree = Array.new(MSSMT::Tree::MAX_LEVEL + 1)
+      tree[MSSMT::Tree::MAX_LEVEL] = MSSMT::LeafNode.empty_leaf
+      MSSMT::Tree::MAX_LEVEL.times do |i|
+        branch =
+          MSSMT::BranchNode.new(
+            tree[MSSMT::Tree::MAX_LEVEL - i],
+            tree[MSSMT::Tree::MAX_LEVEL - i]
+          )
+        tree[MSSMT::Tree::MAX_LEVEL - (i + 1)] = branch
+      end
+      tree
+    end
+  end
+end

data/lib/mssmt/version.rb

@@ -0,0 +1,5 @@
+# frozen_string_literal: true
+
+module MSSMT
+  VERSION = "0.1.0"
+end

data/lib/mssmt.rb

@@ -0,0 +1,15 @@
+# frozen_string_literal: true
+
+require "digest"
+require_relative "mssmt/version"
+
+# Merkle Sum Sparse Merkle Tree
+module MSSMT
+  class Error < StandardError
+  end
+
+  autoload :Store, "mssmt/store"
+  autoload :LeafNode, "mssmt/leaf_node"
+  autoload :BranchNode, "mssmt/branch_node"
+  autoload :Tree, "mssmt/tree"
+end

data/mssmt.gemspec

@@ -0,0 +1,37 @@
+# frozen_string_literal: true
+
+require_relative 'lib/mssmt/version'
+
+Gem::Specification.new do |spec|
+  spec.name = 'mssmt'
+  spec.version = MSSMT::VERSION
+  spec.authors = ['azuchi']
+  spec.email = ['azuchi@chaintope.com']
+
+  spec.summary = 'Ruby implementation of Merkle Sum Sparse Merkle Tree'
+  spec.description = spec.summary
+  spec.homepage = 'https://github.com/azuchi/mssmtrb'
+  spec.license = 'MIT'
+  spec.required_ruby_version = '>= 2.7.0'
+
+  spec.metadata['homepage_uri'] = spec.homepage
+  spec.metadata['source_code_uri'] = spec.homepage
+  spec.metadata['changelog_uri'] = spec.homepage
+
+  # Specify which files should be added to the gem when it is released.
+  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  spec.files = Dir.chdir(File.expand_path(__dir__)) do
+    `git ls-files -z`.split("\x0").reject do |f|
+      (f == __FILE__) || f.match(%r{\A(?:(?:test|spec|features)/|\.(?:git|travis|circleci)|appveyor)})
+    end
+  end
+  spec.bindir = 'exe'
+  spec.executables = spec.files.grep(%r{\Aexe/}) { |f| File.basename(f) }
+  spec.require_paths = ['lib']
+
+  # Uncomment to register a new dependency of your gem
+  # spec.add_dependency "example-gem", "~> 1.0"
+
+  # For more information and examples about making a new gem, check out our
+  # guide at: https://bundler.io/guides/creating_gem.html
+end

data/sig/mssmt.rbs

@@ -0,0 +1,4 @@
+module Mssmt
+  VERSION: String
+  # See the writing guide of rbs: https://github.com/ruby/rbs#guides
+end

metadata

@@ -0,0 +1,68 @@
+--- !ruby/object:Gem::Specification
+name: mssmt
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- azuchi
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2022-10-17 00:00:00.000000000 Z
+dependencies: []
+description: Ruby implementation of Merkle Sum Sparse Merkle Tree
+email:
+- azuchi@chaintope.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".prettierignore"
+- ".rspec"
+- ".rubocop.yml"
+- ".ruby-gemset"
+- ".ruby-version"
+- CHANGELOG.md
+- CODE_OF_CONDUCT.md
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- lib/mssmt.rb
+- lib/mssmt/branch_node.rb
+- lib/mssmt/leaf_node.rb
+- lib/mssmt/store.rb
+- lib/mssmt/store/default_store.rb
+- lib/mssmt/tree.rb
+- lib/mssmt/version.rb
+- mssmt.gemspec
+- sig/mssmt.rbs
+homepage: https://github.com/azuchi/mssmtrb
+licenses:
+- MIT
+metadata:
+  homepage_uri: https://github.com/azuchi/mssmtrb
+  source_code_uri: https://github.com/azuchi/mssmtrb
+  changelog_uri: https://github.com/azuchi/mssmtrb
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 2.7.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.3.23
+signing_key: 
+specification_version: 4
+summary: Ruby implementation of Merkle Sum Sparse Merkle Tree
+test_files: []