crypto_commons 0.0.0 → 0.0.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: daa051041dee70a7c016e1e6e26756b303f303dd3601ca8acbd243e957c22783
-  data.tar.gz: d03048e497d66869cd6d4df3ecce4cadfc1fc2e7703ed6192ccc2bfe8e36c352
+  metadata.gz: 04d6d3313a8b2638f812b43efc8f95832f36a8e490ceaf80045fdca6cdcae958
+  data.tar.gz: 235cf0090ecdce0b4cf5f4753f28864b1411e3b097dc7bcded196c9f87fe49e8
 SHA512:
-  metadata.gz: ef4718db8ab346d45100a8d743eb9344c5f29a796d286bc961932fe5fab5f1ba7b530351bc72b3975026b8bfe08d7240a9fac63e5556db8811b82c4ed9b7193d
-  data.tar.gz: fed6f3292381d3a2d4bb71e29856f810010eade01c5e254235933d605e0aa02b05b9e751a4447b9916ee3fc4820c29c5f0d9c5b4edd2cea5cff517e727e891a3
+  metadata.gz: bf377e4b133044f326d68e5691dffd8508ff0e8948310671c85a1d40c47c168432f5edc2f15faa9418fe17166f32ad6e6b4f6bd9660e96c2483229d9e18f2bd8
+  data.tar.gz: 74b8920525534fefc0dc5fad45b502d9c1fd15fc773a6ca96ad0157b5346fb829f47ff58f73139d4210dbb6c4aaa4d9984df05d4e50e6870cf8e2bee4c0f47ef

data/CHANGELOG.md

@@ -1,5 +1,5 @@
 ## [Unreleased]
 
-## [0.0.0] - 2021-12-21
+## [0.0.1] - 2021-12-21
 
-- Initial release
+- Added some util methods to get publickey, address, wif of a given private key.

data/lib/base58.rb

@@ -0,0 +1,23 @@
+module Base58
+  #Base58base58_encode('000000000000000000000000000000000000000000000001a838b13505b26867')
+  def self.base58_encode(input)
+    @chars = %w[
+        1 2 3 4 5 6 7 8 9
+      A B C D E F G H   J K L M N   P Q R S T U V W X Y Z
+      a b c d e f g h i j k   m n o p q r s t u v w x y z
+    ]
+    @base = @chars.length
+
+    i = input.to_i(16)
+    buffer = String.new
+
+    while i > 0
+      remainder = i % @base
+      i = i / @base
+      buffer = @chars[remainder] + buffer
+    end
+
+    leading_zero_bytes = (input.match(/^([0]+)/) ? $1 : '').size / 2
+    ("1"*leading_zero_bytes) + buffer
+  end
+end

data/lib/checksum.rb

@@ -0,0 +1,16 @@
+require 'digest'
+
+module CheckSum
+  def self.double_hash256(hex)
+      binary = [hex].pack("H*")
+      hash1 = Digest::SHA256.digest(binary)
+      hash2 = Digest::SHA256.digest(hash1)
+      result = hash2.unpack("H*")[0]
+      return result
+  end
+
+  def self.checksum(hex)
+    hash = double_hash256(hex) # Hash the data through SHA256 twice
+    return hash[0...8]  # Return the first 4 bytes (8 characters)
+  end
+end

data/lib/crypto_commons/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module CryptoCommons
-  VERSION = "0.0.0"
+  VERSION = "0.0.1"
 end

data/lib/crypto_commons.rb

@@ -1,9 +1,55 @@
 # frozen_string_literal: true
+require 'digest'
 
 require_relative "crypto_commons/version"
+require_relative "./base58"
+require_relative "./checksum"
+require_relative "./elliptic_curve"
 
 module CryptoCommons
-  def self.hello
-    return "Hello World"
+  #Private key to Wallet Import Format, takes a Hex input
+  def self.wif(private_key)
+    extended = "80" + private_key + "01"
+    extendedchecksum = extended + CheckSum.checksum(extended)
+    wif = Base58.base58_encode(extendedchecksum)
+  end
+
+  #Private Key To Public Key, takes an Integer as input
+  #CryptoCommons.to_public_key(76)
+  def self.public_key(private_key)
+    point = EllipticCurve.multiply(private_key, $g)
+
+    # convert to hexadecimal
+    x = point[:x].to_s(16).rjust(64, "0")
+    y = point[:y].to_s(16).rjust(64, "0")
+
+    # compressed public key format
+    if (point[:y] % 2 == 0)
+      prefix = "02"
+    else
+      prefix = "03"
+    end
+
+    prefix + x
+  end
+
+  #Private Key To Public Key Hash, takes an Integer as input
+  #CryptoCommons.to_public_key_hash160(76)
+  def self.public_key_hash160(private_key)
+    publickey = public_key(private_key)
+    binary = [publickey].pack("H*")
+    sha256 = Digest::SHA256.digest(binary)
+    ripemd160 = Digest::RMD160.digest(sha256)
+    return ripemd160.unpack("H*")[0]
+  end
+
+  def self.address(private_key)
+    hash160 = public_key_hash160(private_key)
+
+    prefix = "00"
+    checksum = CheckSum.checksum(prefix + hash160)
+    address = Base58.base58_encode(prefix + hash160 + checksum)
+
+    return address
   end
 end

data/lib/elliptic_curve.rb

@@ -0,0 +1,80 @@
+module EllipticCurve
+  #copied
+  #y^2 = x^3 + ax + b
+  $a = 0
+  $b = 7
+
+  #prime modulus
+  $p = 2 ** 256 - 2 ** 32 - 2 ** 9 - 2 ** 8 - 2 ** 7 - 2 ** 6 - 2 ** 4 - 1
+
+  #number of points on the curve
+  $n = 115792089237316195423570985008687907852837564279074904382605163141518161494337
+
+  #generator point (the starting point on the curve used for all calculations)
+  $g = {
+    x: 55066263022277343669578718895168534326250603453777594175500187360389116729240,
+    y: 32670510020758816978083085130507043184471273380659243275938904335757337482424,
+  }
+
+  #Modular Inverse.
+  def self.modinv(a, m = $p)
+    a = a % m if a < 0
+    prevy, y = 0, 1
+    while a > 1
+      q = m / a
+      y, prevy = prevy - q * y, y
+      a, m = m % a, a
+    end
+    return y
+  end
+
+  #Double - Add a point on the curve to itself.
+  def self.double(point)
+    #slope = (3x^2 + a) / 2y
+    slope = ((3 * point[:x] ** 2) * modinv((2 * point[:y]))) % $p # using modular inverse to perform "division"
+
+    #new x = slope^2 - 2x
+    x = (slope ** 2 - (2 * point[:x])) % $p
+    #new y = slope * (x - new x) * y
+    y = (slope * (point[:x] - x) - point[:y]) % $p
+
+    return { x: x, y: y }
+  end
+
+  #Add - Add two points together.
+  def self.add(point1, point2)
+    #double if both points are the same
+    return double(point1) if point1 == point2
+
+    #slope = (y1 - y2) / (x1 - x2)
+    slope = ((point1[:y] - point2[:y]) * modinv(point1[:x] - point2[:x])) % $p
+    #new x = slope^2 - x1 - x2
+    x = (slope ** 2 - point1[:x] - point2[:x]) % $p
+    #new y = slope * (x1 - new x) - y1
+    y = ((slope * (point1[:x] - x)) - point1[:y]) % $p
+
+    return { x: x, y: y }
+  end
+
+  #Multiply - Use the double and add operations to multiply a point by an integer.
+  def self.multiply(k, point = $g)
+    # create a copy the initial starting point (for use in addition later on)
+    current = point
+
+    # convert integer to binary representation (for use in the double and add algorithm)
+    binary = k.to_s(2)
+
+    # double and add algorithm for fast multiplication
+    binary.split("").drop(1).each do |char| # ignore first binary character
+      # 0 = double
+      current = double(current)
+
+      # 1 = double and add
+      if char == "1"
+        current = add(current, point)
+      end
+    end
+
+    return current
+  end
+end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: crypto_commons
 version: !ruby/object:Gem::Version
-  version: 0.0.0
+  version: 0.0.1
 platform: ruby
 authors:
 - spmarisa
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2021-12-20 00:00:00.000000000 Z
+date: 2021-12-21 00:00:00.000000000 Z
 dependencies: []
 description: crypto_commons is a handy tool in managing crypto assets.
 email:
@@ -28,8 +28,11 @@ files:
 - bin/console
 - bin/setup
 - crypto_commons.gemspec
+- lib/base58.rb
+- lib/checksum.rb
 - lib/crypto_commons.rb
 - lib/crypto_commons/version.rb
+- lib/elliptic_curve.rb
 - sig/crypto_commons.rbs
 homepage: https://github.com/spmarisa/crypto_commons
 licenses: