<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/">
    <channel>
        <title>Symbiosis Finance</title>
        <link>https://paragraph.com/@symbiosis-finance</link>
        <description>A multi-chain liquidity enabler
</description>
        <lastBuildDate>Sun, 22 Nov 2026 17:42:39 GMT</lastBuildDate>
        <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
        <generator>https://github.com/jpmonette/feed</generator>
        <language>en</language>
        <image>
            <title>Symbiosis Finance</title>
            <url>https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/c766a51c2bb0d2e2e39e14864727f01e86d5194c78fdaeaec157b8e76500282d.png</url>
            <link>https://paragraph.com/@symbiosis-finance</link>
        </image>
        <copyright>All rights reserved</copyright>
        <item>
            <title><![CDATA[The Standard Threshold Signature Scheme
]]></title>
            <link>https://paragraph.com/@symbiosis-finance/the-standard-threshold-signature-scheme</link>
            <guid>58HTPIpopgxPHvK3LPOb</guid>
            <pubDate>Wed, 27 Jul 2022 10:49:35 GMT</pubDate>
            <description><![CDATA[We continue publishing articles on the principles of the threshold signature scheme. Previously we talked about the standard digital signature scheme (DSS), covered the main ideas behind the elliptic curve theory and provided a brief overview of the ECDSA algorithm. In this article we will introduce the concept of a threshold signature. Earlier, we discussed DSS and its most common implementation ECDSA: tools that allow us to create individual signatures. Now let’s figure out how a group of u...]]></description>
            <content:encoded><![CDATA[<p><em>We continue publishing articles on the principles of the threshold signature scheme. Previously we talked about </em><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://mirror.xyz/0xd49CbaFBA1ff5565Ec07e7d0C950436C06D7e65C/DeALvAfQTGV2mfOtWTWSVwOJXBQlhJeSuVrpan1ds9g"><em>the standard digital signature scheme (DSS)</em></a><em>, covered the main ideas behind the elliptic curve theory and provided a brief overview of </em><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://mirror.xyz/0xd49CbaFBA1ff5565Ec07e7d0C950436C06D7e65C/KPBRYNmPR7Hb0to5leHl6hQ5oStq6pTrt-oqqP4ce7k"><em>the ECDSA algorithm</em></a><em>. In this article we will introduce the concept of a threshold signature.</em></p><p>Earlier, we discussed DSS and its most common implementation ECDSA: tools that allow us to create individual signatures. Now let’s figure out how a group of users can create signatures jointly. This problem is particularly relevant since this type of joint signatures offers the highest level of security, which is especially crucial in DeFi.</p><p>In general terms, the problem is stated as follows. There are <em>N</em> parties who want to establish a system where any <em>t</em> of them are able to jointly create signatures on behalf of the entire group, whereas any subset of fewer parties is not able to do so. The number <em>t</em>, in this case, is called a threshold, and the resulting signature is called a threshold one.</p><p>As we know, a secret key is what determines a signature. That’s why the problem of creating a threshold signature comes down to the concept of a threshold secret sharing of a secret key. Namely, the secret key is divided into <em>N</em> parts, which are also called shares. Each party gets their own share and knows nothing about the other ones. Any <em>t</em> shares are enough to generate a joint signature on their basis. But any smaller amount of shares does not allow this to be done.</p><p>The crucial underlying property of such secret sharing is that any <em>t</em> shares are enough to simply derive the original key. But clearly, it’s also its biggest weakness. Because a party who discovers at least <em>t-1</em> other shares will be able to extract the original key and subsequently create signatures on behalf of the entire group using the standard <em>Sig</em> algorithm from DSS. This is something undesirable; since, commonly, parties don’t trust each other. So it’s essential for them to keep their shares secret.</p><p>As for the public key, there’s no need for any particular approach. Public keys are used to verify signatures. And it doesn’t matter to those who verify whether a signature is individual or threshold one.</p><p>Thus, the Standard Threshold Signature Scheme (TSS) is a set of two protocols <em>ThreshKeyGen</em> and <em>ThreshSig</em>. These are step-by-step instructions that allow parties to create a pair of keys in the first case and a threshold signature in the second. Since a public key and a signature produced by these protocols have the usual format, there’s no need for a specific verifying algorithm. That is any threshold signature can be verified using the standard <em>Ver</em> algorithm from DSS.</p><h1 id="h-the-threshold-ecdsa-protocol" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">The Threshold ECDSA protocol</h1><p>Threshold ECDSA is a particular implementation of TSS, based on the ECDSA algorithm. So, just like ECDSA, this threshold version assumes a pre-generation of five domain parameters: a particular elliptic curve, a prime number <em>n</em>, a point <em>G</em> on the curve such that <em>n</em> is the order of <em>G</em>, and two other parameters related to modular arithmetic.</p><h1 id="h-key-generation-with-threshkeygen-protocol" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Key generation with ThreshKeyGen protocol</h1><p>As a result of this protocol, each party receives a unique secret share skᵢ of the secret key <em>sk</em> and a copy of the same public key <em>pk</em>. Together the shares</p><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/5c59e512af749ce126d01c37900701a53efb8a942b3b6da194633ba1918bbacd.png" alt="" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="hide-figcaption"></figcaption></figure><p>constitute a (<em>t, N</em>) — threshold secret sharing of <em>sk</em>. That is, it is possible to derive the original key from any <em>t</em> these shares, but not from any smaller number of them.</p><p>At first, each party chooses a random number <em>u</em>ᵢ. The secret key <em>sk</em> is defined as a formal sum of these values:</p><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/056b2e8bf5ad476a5e281ece898cbb3357c06d5361251587cc433a8aa5609f75.png" alt="" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="hide-figcaption"></figcaption></figure><p>We use the word ‘formal’ because nobody knows all the numbers uᵢ, and so nobody can actually calculate this sum.</p><p>As in the standard <em>KeyGen</em> algorithm from ECDSA, the public key <em>pk</em> is defined by the formula <em>pk=sk ∙ G.</em> Only now it is calculated by parts. Each party finds their own point <em>Qᵢ=uᵢ ∙ G</em> on the curve for their own value of <em>uᵢ.</em> Then parties send their points to each other. Having all the points</p><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/4b50daab4aa22bee17686bc89b21ded8a67ce9ecf4435f37c1b4bb30ae01624f.png" alt="" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="hide-figcaption"></figcaption></figure><p>each party calculates <em>pk</em> using a special rule for elliptic curve points that we haven’t yet covered.</p><p>It may seem that everything’s done. However, the parts</p><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/23cfb060bd24dc9000e305a05707e3a50079a6e2b489317cf9c29e640cbeaee2.png" alt="" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="hide-figcaption"></figcaption></figure><p>of the key <em>sk</em> aren’t superb. They do not have the desired threshold property: it’s impossible to derive the original key from any <em>t</em> of them because to do so you clearly have to know them all. Numbers <em>uᵢ</em> were just the necessary first step. They were needed to define the secret key <em>sk</em>. And now <em>sk</em> should be re-shared in a threshold way.</p><p>To make it happen, the parties use the additional protocol Feldman’s VSS (Feldman’s Verifiable Secret Sharing). This protocol consists of three steps:</p><ol><li><p>First, each party performs a (<em>t, N</em>) — threshold secret sharing of their value <em>uᵢ</em>. Namely, <em>uᵢ</em> is divided into <em>N</em> parts so that it can be restored from any <em>t</em> of them, but not from a smaller amount.</p></li><li><p>Next, each party keeps one share of <em>uᵢ</em> and sends the other <em>N-1</em> to the rest of the group: one share to each.</p></li><li><p>Finally, the parties check whether the shares they received are correct.</p><p>After these three steps each party will have <em>N</em> numbers. One was originally obtained during the first step. The rest <em>N — 1</em> were received during the second step. Then each party obtains the final share <em>skᵢ</em> of the secret key <em>sk</em> as the sum of these <em>N</em> numbers.</p></li></ol><h1 id="h-signature-generation-with-threshsig-protocol" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Signature generation with ThreshSig protocol</h1><p>The protocol <em>ThreshSig</em> assumes the participation of only <em>t</em> parties instead of <em>N</em>, since <em>t</em> parties are enough to generate a threshold signature successfully.</p><p><em>ThreshSig</em> is a modified version of the standard <em>Sig</em> algorithm from ECDSA. The main difference is that now the signature is not calculated directly, but by parts.</p><p>Each party obtains a piece of the final signature using the unique share <em>skᵢ</em> of the secret key <em>sk</em>. Then these pieces are put together and the final signature (<em>r, s</em>) is calculated as their sum.</p><h1 id="h-references" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">References</h1><p>Rosario Gennaro, Steven Goldfeder, “<a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://eprint.iacr.org/2019/114.pdf">Fast Multiparty Threshold ECDSA with Fast Trustless Setup</a>”</p><p><strong>In our first three articles we introduced some of the main algorithms related to digital signatures. Now we are going to delve into these algorithms and analyze them using the proper mathematical tools. In our next article we will have a brief excursion into group theory.</strong></p>]]></content:encoded>
            <author>symbiosis-finance@newsletter.paragraph.com (Symbiosis Finance)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/ec3990efacfc49bf541d249517bf41993a7589fabfc8b97c2bdc287d0da7c28e.png" length="0" type="image/png"/>
        </item>
        <item>
            <title><![CDATA[ECDSA Algorithm]]></title>
            <link>https://paragraph.com/@symbiosis-finance/ecdsa-algorithm</link>
            <guid>MTOKO2jxJM5z4EW4OIUF</guid>
            <pubDate>Fri, 08 Jul 2022 11:12:03 GMT</pubDate>
            <description><![CDATA[We continue publishing articles on the principles of the threshold signature scheme. In the previous article, we talked about the standard digital signature scheme. In this article, we will cover the ECDSA algorithm and elliptic curves.Algorithm ECDSAECDSA (Elliptic Curve Digital Signature Algorithm) is a particular implementation of the standard digital signature scheme that we covered previously. We will leave a detailed analysis of this algorithm’s aspects and the corresponding mathematica...]]></description>
            <content:encoded><![CDATA[<p><em>We continue publishing articles on the principles of the threshold signature scheme. </em><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://mirror.xyz/0xd49CbaFBA1ff5565Ec07e7d0C950436C06D7e65C/DeALvAfQTGV2mfOtWTWSVwOJXBQlhJeSuVrpan1ds9g"><em>In the previous article</em></a><em>, we talked about the standard digital signature scheme. In this article, we will cover the ECDSA algorithm and elliptic curves.</em></p><h3 id="h-algorithm-ecdsa" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Algorithm ECDSA</h3><p>ECDSA (Elliptic Curve Digital Signature Algorithm) is a particular implementation of the standard digital signature scheme that we covered previously. We will leave a detailed analysis of this algorithm’s aspects and the corresponding mathematical theory for future articles. Now let’s focus on some core ideas underlying the <em>KeyGen</em>, <em>Sig</em>, and <em>Ver</em> implementations in ECDSA.</p><p>There are two things ECDSA is based on: elliptic curves and modular arithmetic. Modular arithmetic is a fascinating topic, but it requires some time to explain. So, for now, let’s talk only about the elliptic curves.</p><p>An elliptic curve is a smooth curve on a plane that is determined by the equation <em>y²=x³+a∙x+b</em>. Here <em>a</em> and <em>b</em> are any numbers satisfying the inequality <em>4∙a³+27∙b²≠0</em>. For example, Bitcoin and Ethereum use the curve <em>y²=x³+7</em> (Figure 1).</p><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/69d0b4d1a0210e9357d6fea0ded3235683c5cf77b75de4c81ae14c7d2043745f.png" alt="Fig.1" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Fig.1</figcaption></figure><p>The main feature of an elliptic curve is that its points can be multiplied by positive integers using a particular rule. Any point can be represented as a pair of numbers <em>(x, y)</em>, where <em>x</em> is the first coordinate and <em>y</em> is the second. So, the rule of multiplying a point by a number is just a formula for recalculating this point’s coordinates <em>x</em> and <em>y</em>. As a result, the point moves in a determined way.</p><p>Let’s consider <em>G</em> is a point on a curve, and <em>k</em> is a positive integer; then for the new point <em>k∙G</em> there are three possible locations:</p><p><em>1. k∙G=G</em>, that is multiplying <em>G</em> by <em>k</em> does nothing, and the point <em>k∙G</em> coincides with <em>G</em>. For example, multiplying by one leaves any point in place: <em>1∙G=G</em> for any <em>G</em>. The analogy with regular numbers works here: multiplying by one doesn’t change the origin number. The same is with points: multiplying by one doesn’t change the point’s position.</p><p><em>2. k∙G</em> does not coincide with <em>G</em> but still lies on the curve. As a result of multiplication by <em>q</em> the point somehow slides along the curve.</p><p>Figure 2 illustrates how a particular point <em>P</em> slides along the curve <em>y²=x³+7</em>, when we multiply it by integers from 1 to 7.</p><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/8c302b35e88e7e089cf8be69d615957cb8fd593dfac865b058fb0ddd09044669.png" alt="Fig.2" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Fig.2</figcaption></figure><p>3. <em>k∙G</em> does not exist. In practice, this means that in the formulas of coordinates’ calculation for this point, a division of 0 happened. There is a special term for it: <em>the identity point</em>. If <em>k∙G</em> does not exist, we say that it is equal to the identity point and denote it as *k∙G=*〇.</p><p>For example, if <em>G</em> is the point where the curve intersects the <em>x</em>-axis, then always <em>2∙G</em>=〇.</p><p>The operation of multiplying a point by a number has one interesting property. Let’s consider a point <em>G</em> on a curve, for which such <em>n</em> exists that *n∙G=*〇. And let <em>n</em> be the smallest such a positive integer. Then it is guaranteed that the points <em>G, 2∙G, …, (n-1)∙G</em> are all different; no two of them match. Furthermore, if we start multiplying <em>G</em> by numbers greater than <em>n</em>, the point begins to change its positions in a loop: <em>(n+1)∙G=G</em>, <em>(n+2)∙G=2∙G, …, (n+k)∙G=k∙G</em> for any <em>k&gt;0</em>.</p><p>Thus, point <em>G</em> has only <em>n</em>-1 possible positions on the curve where it can move as a result of multiplication by a number. Taking the identity point 〇 into account, we obtain total <em>n</em> possible options for the product <em>k∙G</em>: these are <em>G</em>, <em>2∙G, …, (n-1)∙G</em>, or 〇. In these circumstances, we say that <em>n</em> is the order of point <em>G.</em> An arbitrary point on a curve may or may not have an order.</p><p>For example, as we already know, *2∙G=*〇 if <em>G</em> lies on the <em>x</em>-axis. At the same time <em>1∙G=G≠</em>〇. So, 2 is the smallest positive integer that makes <em>G</em> move to the identity point 〇. Therefore, for points where the curve intersects the <em>x</em>-axis there are only two possible options: multiplied by an odd number, they stay in place; multiplied by an even number, they become the identity point. Hence, these points do have an order, and this order equals 2.</p><p>Now, let’s consider a point <em>G</em> on a curve for which there is no such number <em>n</em> that <em>n∙G</em>=〇. Then it is guaranteed that if we start multiplying <em>G</em> by all positive integers, we’ll get a new result every time. So the point has an infinite number of possible positions on the curve, and there are no loops as in the previous case. Here we say that the order of <em>G</em> is infinity or that <em>G</em> has an infinite order.</p><p>To conclude, we use the word <em>order</em> to denote how many different results we can get after multiplying a point by all positive integers. The order of <em>G</em> is finite if and only if there is such <em>n</em> that <em>n∙G</em>=〇. And the order of <em>G</em> is infinite if and only if there is no such <em>n</em>.</p><p>Now we are ready to discuss the ECDSA itself. Initially ECDSA assumes the generation of five domain parameters that will be the same for all users in the system. Two of these parameters are related to the modular arithmetic part of ECDSA, so now let’s talk only about the other three.</p><p>The first one is a particular elliptic curve. To determine a curve we just have to choose two numbers <em>a</em> and <em>b</em> from the equation <em>y²=x³+a∙x+b, 4∙a³+27∙b²≠</em>0.</p><p>The second parameter is some prime number <em>n</em>. A prime number is a positive integer that is only divisible by 1 and itself.</p><p>The third parameter is such point <em>G</em> on the curve that <em>n</em> is the order of <em>G</em>. This point <em>G</em> is called the base point.</p><p>For example, Ethereum and Bitcoin use the following values:</p><p>*a=*0, *b=*7,</p><p><em>n=FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141,</em></p><p><em>G=(x, y)</em>, where</p><p><em>x</em>=<em>79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798</em>,</p><p><em>y</em>=<em>483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8</em>.</p><p>We will take a closer look at the process of generating these parameters in the future articles. Now let’s move to the <em>KeyGen, Sig</em>, and <em>Ver</em> algorithms in ECDSA.</p><h3 id="h-key-generation-with-keygen-algorithm" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Key generation with KeyGen algorithm</h3><p>A secret key <em>sk</em> is chosen randomly between 1 and *n-*1. And the corresponding public key <em>pk</em> is set to be the point <em>sk∙G</em>.</p><p>Here comes another crucial property of the multiplying operation. It appears that if we are given two points <em>G</em> and <em>d∙G</em>, where <em>d</em> is unknown, then it is computationally intractable to find <em>d</em>. This is called the elliptic curve discrete logarithm problem.</p><p>Thus, knowing the base point <em>G</em> and the public key <em>pk=sk∙G</em>, we won’t be able to find the corresponding secret key <em>sk</em>.</p><p>Also, since n is the order of <em>G</em>, there are only <em>n</em>-1 possible outcomes for the product <em>sk∙G</em>, that is there are only <em>n</em>-1 possible values for <em>pk</em>.</p><p>So, the output of the algorithm is a pair <em>(sk, pk)</em>, where <em>sk</em> is a number and <em>pk</em> is a point, that is two coordinates.</p><h3 id="h-signature-generation-with-sig-algorithm" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Signature generation with Sig algorithm</h3><p>The signature generation algorithm <em>Sig</em> takes as input the secret key <em>sk</em> and the number <em>m</em>, which is a hash of a message that is going to be signed.</p><p>The output signature is a pair of numbers (<em>r, s</em>)=<em>Sig(sk, m)</em>.</p><p>But why are there two numbers instead of just one? This is due to the fact that inside the algorithm, we randomly choose an additional number <em>k</em> which afterward affects the resulting signature. This additional parameter is needed to ensure the secrecy of the secret key. If a signature were completely determined only by the input parameters <em>sk</em> and <em>m</em>, then the value of <em>sk</em> could be successfully recovered based on just two already created signatures.</p><p>But because of the randomness of <em>k</em> the <em>Sig</em> algorithm can produce different results for the same input values. Therefore, in order to make it possible to verify the output signature, we need to share some information about <em>k</em>. And so, the first part of the signature <em>r</em> is used to reflect this information. So, first, we calculate <em>r</em> using only the value of <em>k</em>, and then we calculate <em>s</em> using all three parameters <em>k, sk</em> and <em>m</em>.</p><h3 id="h-signature-verification-with-ver-algorithm" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Signature verification with Ver algorithm</h3><p>The verification algorithm <em>Ver</em> takes as input the public key <em>pk</em>, the hash <em>m</em>, and the signature (<em>r, s</em>).</p><p>The algorithm computes two different numbers <em>u₁</em> and <em>u₂</em> based on the signature and the hash. Then it finds two points on the domain elliptic curve: <em>u₁∙G</em> and <em>u₂∙pk</em> (<em>pk</em> is a point, so <em>u₂∙pk</em> is also a point).</p><p>If the signature <em>s</em> was initially calculated using the correct values of <em>sk</em> and <em>m</em> then the points <em>u₁∙G</em> and <em>u₂∙pk</em> will be connected to each other through a certain relation. The <em>Ver</em> algorithm checks whether this connection holds or not. If it does, then the signature is considered to pass the verification, and the algorithm returns 1 (TRUE). Otherwise, it returns 0 (FALSE).</p><p><em>In the following article, we will move on to a description of the threshold signature.</em></p><p>References:</p><ol><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.38.8014&amp;rep=rep1&amp;type=pdf">Don Johnson, Alfred Menezes, “The Elliptic Curve Digital Signature Algorithm (ECDSA)”</a></p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://wstein.org/ent/ent.pdf">William Stein, “Elementary Number Theory: Primes, Congruences, and Secrets”</a></p></li></ol><p>Authors:</p><p><strong>Alexey Troshichev</strong> Main Concept</p><p><strong>Artem Fomichev</strong> Math Expert</p><p><strong>Inga Pashentseva</strong> Editor</p><p><strong>Alexander Polovian</strong> Fact Checking</p><p>Catch up with us on social media</p><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://twitter.com/symbiosis_fi">Twitter</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://t.me/symbiosis_finance">Telegram</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://discord.gg/DckkhfWN">Discord</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://web.facebook.com/symbiosis.finance/">Facebook</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.instagram.com/symbiosis.fi/">Instagram</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.linkedin.com/company/symbiosis-finance?trk=pulse-article_main-author-card">Linkedin</a></p>]]></content:encoded>
            <author>symbiosis-finance@newsletter.paragraph.com (Symbiosis Finance)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/29d4ad82b6895613180e97410ddf12ab3d0728e264f6c8f687bcd7a0949755d4.png" length="0" type="image/png"/>
        </item>
        <item>
            <title><![CDATA[Introduction to Threshold Signature
]]></title>
            <link>https://paragraph.com/@symbiosis-finance/introduction-to-threshold-signature</link>
            <guid>Q8thZef7dSCJd6wUwkLO</guid>
            <pubDate>Tue, 14 Jun 2022 11:11:09 GMT</pubDate>
            <description><![CDATA[While working on our cross-chain communication protocol, we come across the fact that in the world of cryptocurrencies, there is a number of cryptography primitives and tools that are heavily used, and still, only a few people really understand the underlying principles of their work. Others either understand very vaguely or simply do not know about the existence of such tools. So we decided to start a series of articles to cover all those cryptography-related topics in a friendly manner.Intr...]]></description>
            <content:encoded><![CDATA[<figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/b5ae95eee980da291ded879d9065338b734fb0a255ea8f85ae61f4811865bd6b.png" alt="" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="hide-figcaption"></figcaption></figure><p>While working on our <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://symbiosis.finance/">cross-chain communication protocol</a>, we come across the fact that in the world of cryptocurrencies, there is a number of cryptography primitives and tools that are heavily used, and still, only a few people really understand the underlying principles of their work.</p><p>Others either understand very vaguely or simply do not know about the existence of such tools. So we decided to start a series of articles to cover all those cryptography-related topics in a friendly manner.</p><h4 id="h-introduction" class="text-xl font-header !mt-6 !mb-3 first:!mt-0 first:!mb-0">Introduction</h4><p>We begin with one of the main mechanisms used in our protocol: MPC (Multi-Party Computation). MPC allows a group of parties to create a digital signature in such a way that:</p><ol><li><p>None of the parties has access to the secret needed to create the signature.</p></li><li><p>Only a quorum (a part of parties) participates in signing.</p></li></ol><p>In the case of MPC, the parties create a signature off-chain that makes it possible to sign any data, including transactions. For the protocol, such a signature is indistinguishable from a signature created by a single user.</p><p>The MPC is a very young mechanism by the standards of cryptography. However, it is based on cryptographic algorithms that have been tested for decades.</p><p>In a series of articles we will explain how MPC works. We will talk about what a digital signature is, how to share secret keys between parties, and how to sign data without having an entire secret key in one place.</p><p>In the first article, we’ll start with the basics: a digital signature.</p><h4 id="h-digital-signature-standard-scheme" class="text-xl font-header !mt-6 !mb-3 first:!mt-0 first:!mb-0">Digital Signature Standard Scheme</h4><p>What problems does a common signature or a digital signature solve? Historically, there are two problems:</p><ol><li><p>Signer authenticity: to ensure that the message is signed by exactly that person who introduced themselves as the signer.</p></li><li><p>Document integrity: to ensure that the message has not changed since the signature was created.</p></li></ol><p>And historically, every time you sign, you draw the same symbol: your common signature. The security of such a system is based on the fact that no one but you can reproduce this symbol in the right way. Consequently, one just has to look at the signature to insure its veracity. Thus, the signed document contains the following information: the document itself, the public identifier of the signer (usually it’s a name) and the signature itself. There are weak points of the common signature. The signature looks always the same, and it doesn’t change whatever you sign with it. Additionally, anyone who has a signature sample can reproduce the signature.</p><p>So, the common signature does not solve the problems perfectly.</p><p>The digital signature is a way to solve the problems using modern computing technology.</p><p>A different approach is used in the case of digital signatures. The message, the signature, and the public identifier of the signer are numbers¹ linked by a mathematical formula². The formula allows to unambiguously establish that for the given message, only the one who possesses the given public identifier created the given signature. And there is no other way. Please note that a digital signature changes depending on the message signed with it.</p><p>We should have one more number to have the mathematical formula mentioned above working. Only the one who creates the signature knows this number. This secret number allows the owner to create a digital signature which guarantees the connection between the message and the signer’s public identifier. Asymmetric Cryptography (also called Public-Key Cryptography) studies such mathematical formulas.</p><p>Thus, when you create a digital signature, two positive numbers are associated with you as the signer. One is called the secret key (or private key, thus public-key cryptography), and the other is called the public key. There is a one-way bond between these numbers: you can derive the public key from the secret key using a mathematical formula, but never vice versa.</p><p>The public key is a semblance of your name in a document signed with a common signature. This information about you is publicly known. On the other hand, only you should know the secret key.</p><p>A secret key is used to create a digital signature, so the digital signature shows the signer’s authenticity. In its turn, the authentication is based on whether or not the correct secret key was used. For authentication, one should have the signer’s public key, the signed message, the signature, and the formula binding the signed message and the secret key.</p><p>Thus, a digital signature routing consists of three parts:</p><ol><li><p>The <em>KeyGen</em> algorithm is used to create a pair of numbers: a public key and a secret key,</p></li><li><p>The <em>Sig</em> algorithm is used to create a signature, using a message and the secret key,</p></li><li><p>The <em>Ver</em> algorithm is used to verify the signature using the signature, the signed message, and the public key.</p></li></ol><p>Next, we will look at all three parts in detail.</p><h4 id="h-key-generation-with-keygen-algorithm" class="text-xl font-header !mt-6 !mb-3 first:!mt-0 first:!mb-0">Key generation with KeyGen algorithm</h4><p>The key generation algorithm creates a pair of keys (<em>sk, pk)</em>=<em>KeyGen( ),</em> where <em>sk</em> stands for the secret key (private key), and <em>pk</em> stands for the public key. Whenever you use the algorithm, you get a new pair of keys.</p><p>A secret key is just a random number. A public key can be easily obtained by applying a pre-defined one-way compression function to the secret key. The one-way compression function does not allow recovery of the input parameters by output results. So, we can safely share our <em>public key</em> without risking compromising our <em>secret key</em>.</p><p>Modular exponentiation is a classic example of a one-way transformation.</p><p>Common exponentiation</p><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/928299154531eca3e8853f95b8fad8425629d6678b92157402f6e5d1d7c62104.png" alt="" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="hide-figcaption"></figcaption></figure><p>is reversible (<em>a</em> is a fixed number). If we know <em>pk</em> and <em>a</em>, we can derive that</p><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/f17c995a041605d704d66a455ec2c03fc02e0f051150ca6f76e07097cabd8b22.png" alt="" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="hide-figcaption"></figcaption></figure><p>Figure 1 illustrates this one to one correspondence: each value of <em>sk</em> corresponds to a single value of <em>pk</em> and vice versa.</p><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/eaf2352aaf31ef09d19d7d26b3d519feb351c11b9f87be00964fb684e7ae7be7.png" alt="Fig. 1" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Fig. 1</figcaption></figure><p>You will get a one-way transformation if you expand exponentiation with a modulo operation. The resulting algorithm would be</p><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/781271cfea5896866d0cecc94e3b3febbf548c742a91486dfdda47681a9ebcb0.png" alt="" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="hide-figcaption"></figcaption></figure><p>where <em>q</em> is a positive integer number. Modulo (denoted by <em>mod</em> in the formula above) is an operation that returns the remainder when divided by <em>q</em>. For example, 25 <em>mod</em> 10=5. This operation is irreversible, which is illustrated by Figure 2.</p><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/746a8da9d6e43a066536494149326d05df80f344f032512f44ccbb2b6bbad847.png" alt="Fig. 2" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Fig. 2</figcaption></figure><p>Let us consider an example where <em>pk=4, a=2, q=7</em>.</p><p>If we try to solve the equation</p><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/6e4459ea4ac4ef6e3e53944bd26c017b1143a62ac19ca10ce0f82b75e80687d8.png" alt="" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="hide-figcaption"></figcaption></figure><p>we will realize that it has multiple solutions. <em>sk</em> can be equal to 2, because 2²=4, 4 <em>mod</em> 7=4. But it also can be equal to 5, because 2⁵=32</p><p>32 <em>mod 7 = (28 + 4) mod 7 = (4∙7 + 4) mod 7 = 4 (Figure 2).</em></p><p>Another example is a clock face. We measure hours by modulo 12, and seconds by modulo 60. Imagine someone saying, “when I looked at my clock, it was 1 PM, and the next time it was 3 PM”. Can you derive how much time exactly passed between these two events? It could be two hours, 14 hours (2+12=14), 26 hours (14+12=26), or infinitely more. Operation <em>mod</em> 12 erases this information.</p><p>Modulo operation is the simplest computational operation that effectively screens the initial parameters. It is widely used in all common one-way transformations combined with other functions. In the example above, we combined it with a power function. We will get more complicated and interesting examples when covering the ECDSA algorithm.</p><h4 id="h-signature-generation-with-sig-algorithm" class="text-xl font-header !mt-6 !mb-3 first:!mt-0 first:!mb-0">Signature generation with Sig algorithm</h4><p>The signature generation requires two components: the secret key <em>sk</em> and the message we want to sign. The message can be of arbitrary length, and this might be inconvenient. Cryptographic hash functions can help us with this.</p><p>A cryptographic hash function transforms a sequence of symbols into a number within some range. For example, it can be a number that can be encoded with only 256 bits. This number is called a hash, and the transformation process is called hashing. The hash function always returns the same output for the same input sequence. However, the slightest change in the message changes its hash so much that it becomes impossible to associate changes in the message with changes in the hash. The usage of hash functions not only simplifies the process but also guarantees the integrity of the signed message that the message has not been changed since the signature creation.</p><p>For example, the cryptographic hash function <em>sha256</em> returns numbers in the range from 0 to 2²⁵⁶-1,. For the input string, “I promise to give you $5,000”, <em>sha256</em> will return</p><blockquote><p><em>be657fcad7933b87869835c571b60ff1444f68179326e7754c3d99babf919995</em></p></blockquote><p>(this is a number in hex format). If we add an extra 0 to the message like this: “I promise to give you $50,000”, the hash will change to</p><blockquote><p><em>90222db12a4a59f8d083e3cf88bf22dab15385c9946f4526a67855e6a5ff0737</em></p></blockquote><p>To sum it up: the signature creation algorithm takes a secret key <em>sk</em> and a number m (the message hash) for input and returns a number <em>s</em>.</p><p>This number is a signature <em>s=Sig(sk, m)</em>. In the following chapters, we will continue covering the details of the cornerstone of cryptocurrencies — the ECDSA signature algorithm.</p><h4 id="h-signature-verification-with-ver-algorithm" class="text-xl font-header !mt-6 !mb-3 first:!mt-0 first:!mb-0">Signature verification with Ver algorithm</h4><p>Algorithms <em>KeyGen</em> and <em>Sig</em> generate digital signatures. Algorithm <em>Ver</em> is used for signature validation.</p><p>This algorithm requires the public key <em>pk</em> of the signer, the message hash <em>m</em> that was signed, and the signature <em>s</em>.</p><p>The <em>Ver</em> algorithm returns 1 (TRUE) if the signature is correct and 0 (FALSE) otherwise.</p><p>Successful verification can guarantee that</p><ol><li><p>The public key <em>pk</em> matches the secret key <em>sk</em> used for the signature generation. This means that the person claiming to be the signer is the actual signer of the transaction.</p></li><li><p>The message that was signed (the hash) was not changed.</p></li></ol><p>Correspondingly, failed signature verification means that at least one of the following two facts comes true:</p><ol><li><p>The secret key <em>sk</em> does not match the public key <em>pk</em>. Someone is impersonating the message signer.</p></li><li><p>The message does not match. The signer did not sign this exact message.</p></li></ol><p>There is no way to figure out what exactly is invalidating the signature with the <em>Ver</em> algorithm.</p><p>The algorithm does not determine which of these conditions caused the invalidity of the signature.</p><p>In our next article, we will talk about the algorithm ECDSA and elliptic curves.</p><p>Numbers¹, formula²: we will explore these concepts further in our articles.</p><p>Authors:</p><p><strong>Alexey Troshichev</strong> Main Concept</p><p><strong>Artem Fomichev</strong> Math Expert</p><p><strong>Inga Pashentseva</strong> Editor</p><p><strong>Alexander Polovian</strong> Fact Checking</p><p>Catch up with us on social media</p><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://twitter.com/symbiosis_fi">Twitter</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://t.me/symbiosis_finance">Telegram</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://discord.gg/DckkhfWN">Discord</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://web.facebook.com/symbiosis.finance/">Facebook</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.instagram.com/symbiosis.fi/">Instagram</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.linkedin.com/company/symbiosis-finance?trk=pulse-article_main-author-card">Linkedin</a></p>]]></content:encoded>
            <author>symbiosis-finance@newsletter.paragraph.com (Symbiosis Finance)</author>
        </item>
        <item>
            <title><![CDATA[Liquidity Provision on Autopilot with Cross-Chain Zaps]]></title>
            <link>https://paragraph.com/@symbiosis-finance/liquidity-provision-on-autopilot-with-cross-chain-zaps</link>
            <guid>UEXJYXATQ5V4B9bS5ytP</guid>
            <pubDate>Tue, 24 May 2022 12:00:13 GMT</pubDate>
            <description><![CDATA[Today we’re announcing cross-chain zaps integration into the Symbiosis protocol. We strive at working out two advancements: The LP token acquisition automation on the destination chain (due to cross-chain functionality); 1-click cross-chain experience while providing liquidity into DeFi protocols. The highest security standards are met with audit performed by Zokyo (kudos to the team). Let’s see how it all works. What is a Zap? One can think of a Zap as a shortcut. Imagine being able to get i...]]></description>
            <content:encoded><![CDATA[<figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/7497e1225760fdda0910331ffa7e93e247c603f5af7ea0284986286047c05efc.png" alt="" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="hide-figcaption"></figcaption></figure><p>Today we’re announcing cross-chain zaps integration into the Symbiosis protocol.</p><p>We strive at working out two advancements:</p><p>The LP token acquisition automation on the destination chain (due to cross-chain functionality); 1-click cross-chain experience while providing liquidity into DeFi protocols. The highest security standards are met with audit performed by Zokyo (kudos to the team).</p><p>Let’s see how it all works.</p><p>What is a Zap?</p><p>One can think of a Zap as a shortcut. Imagine being able to get into the pool regardless of the assets you have at your hands, gas tokens, and so on. So to reiterate, it’s a liquidity provision shortcut.</p><p>The sweet thing about it is that Symbiosis Zap is essentially cross-chain, so compared to all other existing solutions you can add liquidity in any token.</p><p>The bottom line is: using Zap we can add liquidity to the DeFi protocol with literally any token. For example, we want to add USDC liquidity to the Ethereum/BNB pool, but we only have ETH on hand. In this case, we will swap ETH-&gt;on-chain swap-&gt;USDC-&gt;cross-chain swap-&gt;get LP USDC/BUSD and all done in one transaction.</p><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/b2b16c692a77ab42a1cbf94de3b52f20484e410477be3131aa0905eb2adce192.png" alt="" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="hide-figcaption"></figcaption></figure><p>Getting LP tokens with cross-chain zaps</p><p>Although we’ve composed a detailed user guide on cross-chain zaps, let’s discuss its raison d’etre.</p><p>Assume that you’re a big fun of what Boba Network does and you want to enjoy a delicious 27% APR (at the time of writing) on stables in Boba/BNB pool in the Symbiosis protocol. In that case, you will need to go through a quite lengthy process as you need:</p><ol><li><p>USDC Boba</p></li><li><p>BUSD BEP20</p></li><li><p>Gas tokens for both</p></li></ol><p>The process is described here. But if you’re lazy enough like we are (which is great because it is the laziness that typically pushes innovation), then you better use Symbiosis Zaps.</p><p>With cross-chain zaps, instead you can choose a token on the source network and turn it into a LP token on the destination network. And that’s it!</p><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/19dab9007834d81ac6b260c40211090b431f36945c5d659aa29405e0553775b1.png" alt="" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="hide-figcaption"></figcaption></figure><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/f99ff56eda008865b608738bf1183f96187f5b2de687466ed293553219e239c2.png" alt="Straight outta Symbiosis App 🚀" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Straight outta Symbiosis App 🚀</figcaption></figure><p>Buckle Up! Cross-Chain DeFi Liquidity is Coming</p><p>Further on, we’re planning to integrate several DeFi-native protocols so that Symbiosis can be used as a unified cross-chain communication layer. On top of that, pretty much the same workflow will be available to third parties via Symbiosis SDK.</p><p>Watch this space for more! 👾</p><p>Follow us on social media</p><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://twitter.com/symbiosis_fi">Twitter</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://t.me/symbiosis_finance">Telegram</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://discord.gg/DckkhfWN">Discord</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://web.facebook.com/symbiosis.finance/">Facebook</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.instagram.com/symbiosis.fi/">Instagram</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.linkedin.com/company/symbiosis-finance?trk=pulse-article_main-author-card">Linkedin</a></p>]]></content:encoded>
            <author>symbiosis-finance@newsletter.paragraph.com (Symbiosis Finance)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/7273faaeff4d730e5f70bc19281976c71398a7d186ed1bb272e42485dc4487da.png" length="0" type="image/png"/>
        </item>
        <item>
            <title><![CDATA[Integrating 1inch network
]]></title>
            <link>https://paragraph.com/@symbiosis-finance/integrating-1inch-network</link>
            <guid>8AyIlMe8J3SPCTdA9O40</guid>
            <pubDate>Thu, 12 May 2022 14:18:27 GMT</pubDate>
            <description><![CDATA[Today we’re proud to announce that we’re partnering and integrating 1inch to enable the best price discovery for cross-chain swaps. That’s a tremendous step for us as now we will be using the best on the market solution for arbitrary asset swaps, and for ourselves better concentrate on working out our ultimate proposition: any to any tokens, EVM and non-EVM networks, all in a single click.Best-in-Class Routing meets Cross-Chain LiquidityAs one probably recall, the Symbiosis protocol manages s...]]></description>
            <content:encoded><![CDATA[<p>Today we’re proud to announce that we’re partnering and integrating 1inch to enable the best price discovery for cross-chain swaps.</p><p>That’s a tremendous step for us as now we will be using the best on the market solution for arbitrary asset swaps, and for ourselves better concentrate on working out our ultimate proposition: any to any tokens, EVM and non-EVM networks, all in a single click.</p><h1 id="h-best-in-class-routing-meets-cross-chain-liquidity" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Best-in-Class Routing meets Cross-Chain Liquidity</h1><p>As one probably recall, the <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="http://symbiosis.finance/?utm_source=***&amp;utm_medium=Referral&amp;utm_campaign=***">Symbiosis</a> protocol manages stablecoin liquidity pools and routes the transaction through existing DEXes, so the partnership with 1inch is essential to enable the best prices for the end-users as the 1inch Aggregation protocol Pathfinder is working on both sides: on the source chain and destination chain sides.</p><p>The technical details of Metarouter v3 and its interaction with a 1inch router is present <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://docs.symbiosis.finance/crosschain-liquidity-engine/metarouter-v3">here</a>.</p><p>Everything is done under the hood, the users don’t need to switch between different interfaces. Especially the difference becomes sensitive on large transactions — in that case, using 1inch routing provides by far the best price per swap. Just like that.</p><h1 id="h-new-interface" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">New Interface</h1><p>On the eve of the 1inch release, we’ve slightly changed the user interface to keep the colour calmer.</p><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/bdf76bcb282a119e7e57d9a4ca3b0460070a8183b075a7310eefaa2b13df7605.png" alt="" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="hide-figcaption"></figcaption></figure><p>Also, we’ve made slight changes to make the experience smoother for our Swap/LP users. We’ll experiment with different colors and layouts to find the best balance between our branding and convenience.</p><p>Be one of the first ones to make swaps with 1inch on our <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://app.symbiosis.finance/swap?chainIn=BNB&amp;chainOut=Polygon&amp;tokenIn=BNB&amp;tokenOut=MATIC">app</a>.</p><h1 id="h-the-path-ahead" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">The Path Ahead:</h1><p>We launched our Beta mainnet two months ago, on March 9th. With ongoing partnership campaigns and new networks, as well as with dedicated community engagement and management, we keep growing steadily.</p><p>We have much more news in store and 1inch is opening the season of big changes and announcements.</p><p>Any to any token swaps with a single click.</p><p>Hands in hands with the best (kudos to the 1inch team ✌️)</p><p>Catch up with us on social media</p><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://twitter.com/symbiosis_fi">Twitter</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://t.me/symbiosis_finance">Telegram</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://discord.gg/DckkhfWN">Discord</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://web.facebook.com/symbiosis.finance/">Facebook</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.instagram.com/symbiosis.fi/">Instagram</a> | <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.linkedin.com/company/symbiosis-finance?trk=pulse-article_main-author-card">Linkedin</a></p>]]></content:encoded>
            <author>symbiosis-finance@newsletter.paragraph.com (Symbiosis Finance)</author>
        </item>
    </channel>
</rss>