X-Git-Url: https://git.novaco.in/?a=blobdiff_plain;f=Novacoin%2Fuint256.cs;h=c9134010ed604c09ce69335237065ff097fc5c8f;hb=198c3037b62f2c6007dee4c0a8b0fa41e9225c24;hp=606acf0139f71a40e4df8a10ee4ca0e47990bf74;hpb=14dcc623463c612772aa4a5dc20497d8661e3d0b;p=NovacoinLibrary.git

diff --git a/Novacoin/uint256.cs b/Novacoin/uint256.cs
index 606acf0..c913401 100644
--- a/Novacoin/uint256.cs
+++ b/Novacoin/uint256.cs
@@ -270,7 +270,7 @@ namespace Novacoin
             return result;
         }
 
-        public static uint256 operator *(uint256 a, uint b)
+        public static uint256 operator *(uint256 a, ulong b)
         {
             var result = new uint256();
 
@@ -279,7 +279,7 @@ namespace Novacoin
 
             do
             {
-                c += a.pn[i] * (ulong)b;
+                c += a.pn[i] * b;
                 result.pn[i] = (uint)c;
                 c >>= 32;
             } while (++i < result.nWidth);
@@ -287,6 +287,66 @@ namespace Novacoin
             return result;
         }
 
+        public static uint256 operator *(uint256 a, uint256 b)
+        {
+            if (!a || !b)
+            {
+                // Multiplication by zero results with zero.
+                return 0;
+            }
+            else if (b.bits <= 32)
+            {
+                if (b.pn[0] == 1)
+                {
+                    // If right is 1 then return left operand value
+                    return a;
+                }
+
+                return a * b.pn[0];
+            }
+            else if (a.bits <= 32)
+            {
+                if (a.pn[0] == 1)
+                {
+                    // If left is 1 then return right operand value
+                    return b;
+                }
+
+                return a * b.pn[0];
+            }
+
+            int m = a.bits / 32 + (a.bits % 32 != 0 ? 1 : 0);
+            int n = b.bits / 32 + (b.bits % 32 != 0 ? 1 : 0);
+
+            uint256 result = new uint256();
+
+            uint[] left = a.pn.Take(m).ToArray();
+            uint[] right = b.pn.Take(n).ToArray();
+
+            for (int i = 0; i < m; ++i)
+            {
+                uint ai = left[i];
+                int k = i;
+
+                ulong temp = 0;
+                for (int j = 0; j < n; ++j)
+                {
+                    temp = temp + ((ulong)ai) * right[j] + result.pn[k];
+                    result.pn[k++] = (uint)temp;
+                    temp >>= 32;
+                }
+
+                while (temp != 0)
+                {
+                    temp += result.pn[k];
+                    result.pn[k++] = (uint)temp;
+                    temp >>= 32;
+                }
+            }
+
+            return result;
+        }
+
         public static uint operator %(uint256 a, uint b)
         {
             ulong r = 0;