<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Cryptography on Purple Blog</title>
    <link>/tags/cryptography/</link>
    <description>Recent content in Cryptography on Purple Blog</description>
    <image>
      <title>Purple Blog</title>
      <url>/images/papermod-cover.png</url>
      <link>/images/papermod-cover.png</link>
    </image>
    <generator>Hugo</generator>
    <language>en</language>
    <lastBuildDate>Tue, 10 Mar 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="/tags/cryptography/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Understanding PLONK (Part 1): Plonkish Arithmetization</title>
      <link>/posts/1-arithmetization/</link>
      <pubDate>Tue, 10 Mar 2026 00:00:00 +0000</pubDate>
      <guid>/posts/1-arithmetization/</guid>
      <description>&lt;h1 id=&#34;introduction&#34;&gt;Introduction&lt;/h1&gt;
&lt;p&gt;Arithmetization refers to the process of converting computations into mathematical objects and then proving them using zero-knowledge proofs.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Plonkish Arithmetization&lt;/strong&gt; is a unique arithmetization method specific to the Plonk proof system. Before the advent of Plonkish, the dominant circuit representation was &lt;strong&gt;R1CS&lt;/strong&gt;, which was widely adopted by systems like Pinocchio, Groth16, and Bulletproofs. In 2019, the Plonk scheme introduced a seemingly retro style of circuit encoding. However, since Plonk pushed polynomial encoding to its limits, it is no longer confined to arithmetic circuits with just &amp;ldquo;addition gates&amp;rdquo; and &amp;ldquo;multiplication gates&amp;rdquo;; it can also support more flexible &lt;strong&gt;custom gates&lt;/strong&gt; and &lt;strong&gt;lookup gates&lt;/strong&gt;.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Understanding PLONK (Part 2): Lagrange-basis</title>
      <link>/posts/2-lagrange-basis/</link>
      <pubDate>Tue, 10 Mar 2026 00:00:00 +0000</pubDate>
      <guid>/posts/2-lagrange-basis/</guid>
      <description>&lt;h1 id=&#34;introduction&#34;&gt;Introduction&lt;/h1&gt;
&lt;p&gt;In the previous article, we mentioned that to implement the protocol verification process, the Prover initially encodes each column of the $W$ table using polynomial coding and sends the encoded results to the Verifier for verification. Through further interaction, we can verify whether the equation&lt;/p&gt;
&lt;p&gt;$$
q_{L}(X) \cdot w_{a}(X) + q_{R}(X) \cdot w_{b}(X) + q_{M}(X)\cdot(w_{a}(X)\cdot w_{b}(X)) + q_{C}(X) -  q_{O}(X)\cdot w_{c}(X) \overset{?}{=} 0
$$&lt;/p&gt;
&lt;p&gt;holds.&lt;/p&gt;
&lt;p&gt;This verifies the correctness of a circuit only when the Prover is honest. However, the Prover might misbehave. &lt;strong&gt;To prevent this and ensure the circuit&amp;rsquo;s correctness and security while satisfying constraints, we need to verify&lt;/strong&gt; the relationship between $(\sigma_a(X),\sigma_b(X),\sigma_c(X))$ and $(w_a(X),w_b(X),w_c(X))$.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Understanding PLONK (Part 3): Permutation Argument</title>
      <link>/posts/3-permutation/</link>
      <pubDate>Tue, 10 Mar 2026 00:00:00 +0000</pubDate>
      <guid>/posts/3-permutation/</guid>
      <description>&lt;p&gt;Plonkish circuit encoding uses two matrices, $(Q, \sigma)$, to describe the circuit&amp;rsquo;s scaffold, where $Q$ represents the operation selectors and $\sigma$ represents permutation constraints. These constraints enforce that certain positions in the $W$ matrix must hold identical values. This article focuses on explaining the principles of the &lt;strong&gt;permutation argument&lt;/strong&gt;.&lt;/p&gt;
&lt;/br&gt;
&lt;h2 id=&#34;reviewing-copy-constraints&#34;&gt;Reviewing Copy Constraints&lt;/h2&gt;
&lt;p&gt;The permutation $\sigma$ represents the relationship between positions before and after rearrangement. But what does $\sigma$ actually look like?&lt;/p&gt;</description>
    </item>
    <item>
      <title>Understanding PLONK (Part 4): Arithmetic Constraints and Copy Constraints</title>
      <link>/posts/4-constraints/</link>
      <pubDate>Tue, 10 Mar 2026 00:00:00 +0000</pubDate>
      <guid>/posts/4-constraints/</guid>
      <description>&lt;h2 id=&#34;recap-of-permutation-argument&#34;&gt;Recap of Permutation Argument&lt;/h2&gt;
&lt;p&gt;In the previous section, we discussed how the Prover proves that two vectors $\vec{a}$ and $\vec{b}$ of length $n$ satisfy a pre-defined (public) permutation relationship $\sigma(\cdot)$, i.e.,&lt;/p&gt;
&lt;p&gt;$$
a_i = b_{\sigma(i)}.
$$&lt;/p&gt;
&lt;p&gt;The basic idea involves requesting a random challenge $\beta$ from the Verifier, combining the &amp;ldquo;original vectors&amp;rdquo; ($\vec{a}$ and $\vec{b}$) with their &amp;ldquo;position vectors&amp;rdquo; ($\vec{i}$ and $\sigma$), and generating two new vectors, denoted as $\vec{a}&amp;rsquo;$ and $\vec{b}&amp;rsquo;$:&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
