mssmt 0.2.0 → 0.4.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: bc50f962065de3f0ceaeebaa7715ab5e32d03a882d7df11022e6e4bc90b459d1
-  data.tar.gz: 020cb3cfedb35c8c3a6cd123d9b772e666e9b9fe19f301c07acc6ca27a193ca6
+  metadata.gz: d07e68431e9d8539727c514f6bbe42006709b980214d6fdeaca0cb6fb0613d5d
+  data.tar.gz: 76da8e23b8b45119ab20fc875657688dd26dd2b24a8dc82f7704162c6ae61a24
 SHA512:
-  metadata.gz: 468f823bbba1cff9549b5977a98270ec215e3ccf7b8057bcdd0642fd99da280233a0a821254fc2fb4c294d638ccaa6443cf04abd8a99fd4e61de6f2c51f169a1
-  data.tar.gz: 17f30d1180c82d4b4862c752b842e725e5d9527f1ad7f80b5e8eeb3e0d2573b127531afbfda474017103b97b21acbf3d1f1e891398686fdf06256dd3d246dc06
+  metadata.gz: 3dc973a5f83f8399af0b617a34db243464d15878e27fe1b748ba576622c7a7d7e28e5ac736efef4d0e4a4e53231525aad6a8d4e99d3b1b6f732948dc72a8dc3c
+  data.tar.gz: 482b24550810aa7c070b0b51845088094d17d4afca4a1ae60677c58be3fecf89eaf88651b3795eca268a05f08b7d265602ee6fb6c699a06a1bf80d8bb450c659

data/lib/mssmt/branch_node.rb

@@ -5,6 +5,10 @@ module MSSMT
   class BranchNode
     attr_reader :left, :right, :node_hash, :sum
 
+    # Constructor
+    # @param [MSSMT::LeafNode|MSSMT::BranchNode] left
+    # @param [MSSMT::LeafNode|MSSMT::BranchNode] right
+    # @raise [MSSMT::OverflowError]
     def initialize(left, right)
       if !left.is_a?(BranchNode) && !left.is_a?(LeafNode)
         raise ArgumentError, "left must be a branch or leaf node"
@@ -16,15 +20,21 @@ module MSSMT
       @left = left
       @right = right
       @sum = left.sum + right.sum
+      if @sum > Tree::MAX_SUM_VALUE
+        raise OverflowError, "sum: #{sum} is overflow"
+      end
+
       @node_hash =
         Digest::SHA256.digest(
           "#{left.node_hash}#{right.node_hash}#{[@sum].pack("Q>")}"
         )
     end
 
+    # Check whether same branch|computed node or not.
+    # @return [Boolean]
     def ==(other)
-      return false unless other.is_a?(BranchNode)
-      node_hash == other.node_hash
+      return false unless [BranchNode, ComputedNode].include?(other.class)
+      node_hash == other.node_hash && sum == other.sum
     end
   end
 end

data/lib/mssmt/computed_node.rb

@@ -0,0 +1,25 @@
+# frozen_string_literal: true
+
+module MSSMT
+  # Node within a MS-SMT that has already had its node_hash and sum computed, i.e., its preimage is not available.
+  class ComputedNode
+    attr_reader :node_hash, :sum
+
+    # Constructor
+    # @param [String] node_hash node hash with binary format.
+    # @param [Integer] sum
+    # @raise [MSSMT::OverflowError]
+    def initialize(node_hash, sum)
+      @node_hash = node_hash
+      if sum > Tree::MAX_SUM_VALUE
+        raise OverflowError, "sum: #{sum} is overflow"
+      end
+      @sum = sum
+    end
+
+    def ==(other)
+      return false unless [BranchNode, ComputedNode].include?(other.class)
+      node_hash == other.node_hash && sum == other.sum
+    end
+  end
+end

data/lib/mssmt/leaf_node.rb

@@ -8,8 +8,12 @@ module MSSMT
     # Constructor
     # @param [String] value node value with binary format.
     # @param [Integer] sum integer value associated with the value
+    # @raise [MSSMT::OverflowError]
     def initialize(value, sum)
       @value = value
+      if sum > Tree::MAX_SUM_VALUE
+        raise OverflowError, "sum: #{sum} is overflow"
+      end
       @sum = sum
     end
 

data/lib/mssmt/proof.rb

@@ -17,8 +17,7 @@ module MSSMT
       bits = Array.new(nodes.length, false)
       compact_nodes = []
       nodes.each.each_with_index do |node, i|
-        # puts "#{node.node_hash}:#{Tree.empty_tree[Tree::MAX_LEVEL - 1].node_hash}"
-        if node.node_hash == Tree.empty_tree[Tree::MAX_LEVEL - 1].node_hash
+        if node.node_hash == Tree.empty_tree[Tree::MAX_LEVEL - i].node_hash
           bits[i] = true
         else
           compact_nodes << node
@@ -49,6 +48,21 @@ module MSSMT
       @bits = bits
     end
 
+    # Decode compressed proof.
+    # @param [String] compressed proof with binary fomat.
+    # @return [MSSMT::CompressedProof]
+    def self.decode(data)
+      buf = data.is_a?(StringIO) ? data : StringIO.new(data)
+      nodes_len = buf.read(2).unpack1("n")
+      nodes =
+        nodes_len.times.map do
+          ComputedNode.new(buf.read(32), buf.read(8).unpack1("Q>"))
+        end
+      bytes = buf.read(MSSMT::Tree::MAX_LEVEL / 8)
+      bits = unpack_bits(bytes.unpack("C*"))
+      CompressedProof.new(nodes, bits)
+    end
+
     # Decompress a compressed merkle proof by replacing its bit vector with the empty nodes it represents.
     # @return [MSSMT::Proof]
     def decompress
@@ -64,5 +78,48 @@ module MSSMT
       end
       Proof.new(full_nodes)
     end
+
+    # Encode the compressed proof.
+    # @return [String] encoded string.
+    def encode
+      buf = [nodes.length].pack("n")
+      nodes.each do |node|
+        buf << node.node_hash
+        buf << [node.sum].pack("Q>")
+      end
+      buf << pack_bits.pack("C*")
+      buf
+    end
+
+    def ==(other)
+      return false unless other.is_a?(CompressedProof)
+      bits == other.bits && nodes == other.nodes
+    end
+
+    private
+
+    def pack_bits
+      bytes = Array.new((bits.length + 8 - 1) / 8, 0)
+      bits.each_with_index do |b, i|
+        next unless b
+        byte_index = i / 8
+        bit_index = i % 8
+        bytes[byte_index] |= (1 << bit_index)
+      end
+      bytes
+    end
+
+    def self.unpack_bits(bytes)
+      bit_len = bytes.length * 8
+      bits = Array.new(bit_len, false)
+      bit_len.times do |i|
+        byte_index = i / 8
+        bit_index = i % 8
+        bits[i] = ((bytes[byte_index] >> bit_index) & 1) == 1
+      end
+      bits
+    end
+
+    private_class_method :unpack_bits
   end
 end

data/lib/mssmt/tree.rb

@@ -9,6 +9,8 @@ module MSSMT
     MAX_LEVEL = HASH_SIZE * 8
     # Index of the last bit for MS-SMT keys
     LAST_BIT_INDEX = MAX_LEVEL - 1
+    # Maximum sum value
+    MAX_SUM_VALUE = 0xffffffffffffffff
 
     attr_reader :store
 

data/lib/mssmt/version.rb

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

data/lib/mssmt.rb

@@ -8,9 +8,14 @@ module MSSMT
   class Error < StandardError
   end
 
+  # Error when sum overflows
+  class OverflowError < Error
+  end
+
   autoload :Store, "mssmt/store"
   autoload :LeafNode, "mssmt/leaf_node"
   autoload :BranchNode, "mssmt/branch_node"
+  autoload :ComputedNode, "mssmt/computed_node"
   autoload :Tree, "mssmt/tree"
   autoload :Proof, "mssmt/proof"
   autoload :CompressedProof, "mssmt/proof"

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: mssmt
 version: !ruby/object:Gem::Version
-  version: 0.2.0
+  version: 0.4.0
 platform: ruby
 authors:
 - azuchi
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2022-10-26 00:00:00.000000000 Z
+date: 2022-10-30 00:00:00.000000000 Z
 dependencies: []
 description: Ruby implementation of Merkle Sum Sparse Merkle Tree
 email:
@@ -32,6 +32,7 @@ files:
 - bin/setup
 - lib/mssmt.rb
 - lib/mssmt/branch_node.rb
+- lib/mssmt/computed_node.rb
 - lib/mssmt/leaf_node.rb
 - lib/mssmt/proof.rb
 - lib/mssmt/store.rb