Deploying to gh-pages from @ 62a9b6b 🚀

print.html

@@ -378,7 +378,7 @@ <h2 id="acknowledgements"><a class="header" href="#acknowledgements">Acknowledge
 <li><a href="src/utils/secp256r1.sol/constants.secp256r1.html">secp256r1 constants</a></li>
 </ul>
 <div style="break-before: page; page-break-before: always;"></div><h1 id="ecdsa"><a class="header" href="#ecdsa">ECDSA</a></h1>
-<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/7a61666cf9bc3fbae1f6faf8793f2ef8c2c37c65/src/utils/ECDSA.sol">Git Source</a></p>
+<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/62a9b6b73a0f131f8fc8fbc2e8fe4c35c0ebb8df/src/utils/ECDSA.sol">Git Source</a></p>
 <p>Library for handling Elliptic Curve Digital Signature Algorithm (ECDSA) operations on a compatible curve</p>
 <h2 id="functions"><a class="header" href="#functions">Functions</a></h2>
 <h3 id="zz2aff"><a class="header" href="#zz2aff">zz2Aff</a></h3>
@@ -495,7 +495,7 @@ <h3 id="affadd"><a class="header" href="#affadd">affAdd</a></h3>
 <tr><td><code>y2</code></td><td><code>uint256</code></td><td>The Y-coordinate of the resulting point</td></tr>
 </tbody></table>
 </div><div style="break-before: page; page-break-before: always;"></div><h1 id="pmodinv"><a class="header" href="#pmodinv">pModInv</a></h1>
-<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/7a61666cf9bc3fbae1f6faf8793f2ef8c2c37c65/src/utils/secp256r1.sol">Git Source</a></p>
+<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/62a9b6b73a0f131f8fc8fbc2e8fe4c35c0ebb8df/src/utils/secp256r1.sol">Git Source</a></p>
 <p>Calculate the modular inverse of a given integer, which is the inverse of this integer modulo p.</p>
 <p><em>Uses the ModExp precompiled contract at address 0x05 for fast computation using little Fermat theorem</em></p>
 <pre><code class="language-solidity">function pModInv(uint256 self) returns (uint256 result);
@@ -510,7 +510,7 @@ <h3 id="affadd"><a class="header" href="#affadd">affAdd</a></h3>
 <tr><td><code>result</code></td><td><code>uint256</code></td><td>The modular inverse of the input integer. If the modular inverse doesn't exist, it revert the tx</td></tr>
 </tbody></table>
 </div><div style="break-before: page; page-break-before: always;"></div><h1 id="nmodinv"><a class="header" href="#nmodinv">nModInv</a></h1>
-<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/7a61666cf9bc3fbae1f6faf8793f2ef8c2c37c65/src/utils/secp256r1.sol">Git Source</a></p>
+<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/62a9b6b73a0f131f8fc8fbc2e8fe4c35c0ebb8df/src/utils/secp256r1.sol">Git Source</a></p>
 <p>Calculate the modular inverse of a given integer, which is the inverse of this integer modulo n.</p>
 <p><em>Uses the ModExp precompiled contract at address 0x05 for fast computation using little Fermat theorem</em></p>
 <pre><code class="language-solidity">function nModInv(uint256 self) returns (uint256 result);
@@ -525,7 +525,7 @@ <h3 id="affadd"><a class="header" href="#affadd">affAdd</a></h3>
 <tr><td><code>result</code></td><td><code>uint256</code></td><td>The modular inverse of the input integer. If the modular inverse doesn't exist, it revert the tx</td></tr>
 </tbody></table>
 </div><div style="break-before: page; page-break-before: always;"></div><h1 id="constants"><a class="header" href="#constants">Constants</a></h1>
-<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/7a61666cf9bc3fbae1f6faf8793f2ef8c2c37c65/src/utils/secp256r1.sol">Git Source</a></p>
+<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/62a9b6b73a0f131f8fc8fbc2e8fe4c35c0ebb8df/src/utils/secp256r1.sol">Git Source</a></p>
 <h3 id="p"><a class="header" href="#p">p</a></h3>
 <pre><code class="language-solidity">uint256 constant p = 0xFFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFF;
 </code></pre>
@@ -557,7 +557,7 @@ <h3 id="modexp_precompile"><a class="header" href="#modexp_precompile">MODEXP_PR
 <pre><code class="language-solidity">address constant MODEXP_PRECOMPILE = 0x0000000000000000000000000000000000000005;
 </code></pre>
 <div style="break-before: page; page-break-before: always;"></div><h1 id="ecdsa256r1"><a class="header" href="#ecdsa256r1">ECDSA256r1</a></h1>
-<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/7a61666cf9bc3fbae1f6faf8793f2ef8c2c37c65/src/ECDSA256r1.sol">Git Source</a></p>
+<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/62a9b6b73a0f131f8fc8fbc2e8fe4c35c0ebb8df/src/ECDSA256r1.sol">Git Source</a></p>
 <p>A library to verify ECDSA signatures made on the secp256r1 curve</p>
 <p><em>This is the easiest library to deal with but also the most expensive in terms of gas cost. Indeed, this library
 must calculate multiple points on the curve in order to verify the signature. Use it kmowingly.</em></p>

src/ECDSA256r1.sol/library.ECDSA256r1.html

@@ -178,7 +178,7 @@ <h1 class="menu-title"></h1>
                 <div id="content" class="content">
                     <main>
                         <h1 id="ecdsa256r1"><a class="header" href="#ecdsa256r1">ECDSA256r1</a></h1>
-<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/7a61666cf9bc3fbae1f6faf8793f2ef8c2c37c65/src/ECDSA256r1.sol">Git Source</a></p>
+<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/62a9b6b73a0f131f8fc8fbc2e8fe4c35c0ebb8df/src/ECDSA256r1.sol">Git Source</a></p>
 <p>A library to verify ECDSA signatures made on the secp256r1 curve</p>
 <p><em>This is the easiest library to deal with but also the most expensive in terms of gas cost. Indeed, this library
 must calculate multiple points on the curve in order to verify the signature. Use it kmowingly.</em></p>

src/utils/ECDSA.sol/library.ECDSA.html

@@ -178,7 +178,7 @@ <h1 class="menu-title"></h1>
                 <div id="content" class="content">
                     <main>
                         <h1 id="ecdsa"><a class="header" href="#ecdsa">ECDSA</a></h1>
-<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/7a61666cf9bc3fbae1f6faf8793f2ef8c2c37c65/src/utils/ECDSA.sol">Git Source</a></p>
+<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/62a9b6b73a0f131f8fc8fbc2e8fe4c35c0ebb8df/src/utils/ECDSA.sol">Git Source</a></p>
 <p>Library for handling Elliptic Curve Digital Signature Algorithm (ECDSA) operations on a compatible curve</p>
 <h2 id="functions"><a class="header" href="#functions">Functions</a></h2>
 <h3 id="zz2aff"><a class="header" href="#zz2aff">zz2Aff</a></h3>

src/utils/secp256r1.sol/constants.secp256r1.html

@@ -178,7 +178,7 @@ <h1 class="menu-title"></h1>
                 <div id="content" class="content">
                     <main>
                         <h1 id="constants"><a class="header" href="#constants">Constants</a></h1>
-<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/7a61666cf9bc3fbae1f6faf8793f2ef8c2c37c65/src/utils/secp256r1.sol">Git Source</a></p>
+<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/62a9b6b73a0f131f8fc8fbc2e8fe4c35c0ebb8df/src/utils/secp256r1.sol">Git Source</a></p>
 <h3 id="p"><a class="header" href="#p">p</a></h3>
 <pre><code class="language-solidity">uint256 constant p = 0xFFFFFFFF00000001000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFF;
 </code></pre>

src/utils/secp256r1.sol/function.nModInv.html

@@ -178,7 +178,7 @@ <h1 class="menu-title"></h1>
                 <div id="content" class="content">
                     <main>
                         <h1 id="nmodinv"><a class="header" href="#nmodinv">nModInv</a></h1>
-<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/7a61666cf9bc3fbae1f6faf8793f2ef8c2c37c65/src/utils/secp256r1.sol">Git Source</a></p>
+<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/62a9b6b73a0f131f8fc8fbc2e8fe4c35c0ebb8df/src/utils/secp256r1.sol">Git Source</a></p>
 <p>Calculate the modular inverse of a given integer, which is the inverse of this integer modulo n.</p>
 <p><em>Uses the ModExp precompiled contract at address 0x05 for fast computation using little Fermat theorem</em></p>
 <pre><code class="language-solidity">function nModInv(uint256 self) returns (uint256 result);

src/utils/secp256r1.sol/function.pModInv.html

@@ -178,7 +178,7 @@ <h1 class="menu-title"></h1>
                 <div id="content" class="content">
                     <main>
                         <h1 id="pmodinv"><a class="header" href="#pmodinv">pModInv</a></h1>
-<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/7a61666cf9bc3fbae1f6faf8793f2ef8c2c37c65/src/utils/secp256r1.sol">Git Source</a></p>
+<p><a href="https://github.com/get-smooth/secp256r1-verify/blob/62a9b6b73a0f131f8fc8fbc2e8fe4c35c0ebb8df/src/utils/secp256r1.sol">Git Source</a></p>
 <p>Calculate the modular inverse of a given integer, which is the inverse of this integer modulo p.</p>
 <p><em>Uses the ModExp precompiled contract at address 0x05 for fast computation using little Fermat theorem</em></p>
 <pre><code class="language-solidity">function pModInv(uint256 self) returns (uint256 result);