<?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>Posts on Purple Blog</title>
    <link>/posts/</link>
    <description>Recent content in Posts 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>Thu, 12 Mar 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="/posts/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>
    <item>
      <title>Understanding Plonk (Part 5): Polynomial Commitments</title>
      <link>/posts/5-polycom/</link>
      <pubDate>Tue, 10 Mar 2026 00:00:00 +0000</pubDate>
      <guid>/posts/5-polycom/</guid>
      <description>&lt;h2 id=&#34;what-is-a-polynomial-commitment&#34;&gt;What is a Polynomial Commitment?&lt;/h2&gt;
&lt;p&gt;A &lt;strong&gt;commitment&lt;/strong&gt; is a way to &amp;ldquo;lock&amp;rdquo; a message, resulting in a commitment value. This value is referred to as the &lt;strong&gt;commitment&lt;/strong&gt; to the object.&lt;/p&gt;
&lt;p&gt;$$
c = commit(x)
$$&lt;/p&gt;
&lt;p&gt;This commitment satisfies two essential properties: &lt;strong&gt;Hiding&lt;/strong&gt; and &lt;strong&gt;Binding&lt;/strong&gt;.&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;Hiding&lt;/strong&gt;: $c$ does not reveal any information about $x$.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Binding&lt;/strong&gt;: It is computationally infeasible to find some $x&amp;rsquo; \neq x$ such that $c = commit(x&amp;rsquo;)$.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;The simplest commitment mechanism is a hash function. Note that such a hash function must provide cryptographic security, such as SHA256 or Keccak. Besides hash functions, there are also schemes like Pedersen commitments.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Argentina Travelogue (Final): In Bariloche, Wasting Time Amidst Lakes and Mountains</title>
      <link>/posts/argentina-bariloche/</link>
      <pubDate>Thu, 29 Jan 2026 00:00:00 +0000</pubDate>
      <guid>/posts/argentina-bariloche/</guid>
      <description>This post recounts my itinerary and experiences in Bariloche. Portions can be used as a practical travel guide.</description>
    </item>
    <item>
      <title>Argentina Travelogue (IV): Ushuaia—In the Lonely End of the World, There are Still Friends</title>
      <link>/posts/argentina-ushuaia/</link>
      <pubDate>Thu, 15 Jan 2026 00:00:00 +0000</pubDate>
      <guid>/posts/argentina-ushuaia/</guid>
      <description>This post recounts my itinerary and experiences in Ushuaia. Portions can be used as a practical travel guide.</description>
    </item>
    <item>
      <title>Argentina Travelogue (III): Spending $1000  in 48 Hours: My Perito Moreno Glacier &#39;Special Forces&#39; Trip</title>
      <link>/posts/argentina-el-calafate/</link>
      <pubDate>Mon, 22 Dec 2025 00:00:00 +0000</pubDate>
      <guid>/posts/argentina-el-calafate/</guid>
      <description>&lt;h1 id=&#34;-key-takeaways&#34;&gt;🔥 Key Takeaways&lt;/h1&gt;
&lt;ol&gt;
&lt;li&gt;
&lt;p&gt;After this trip to Argentina, I’ve realized that to truly save money, I must force myself to become a meticulous planner for future long-distance travels;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Be more direct when speaking; foreigners often don&amp;rsquo;t understand subtext or &amp;ldquo;hidden meanings&amp;rdquo;;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;The glacier is absolutely worth seeing; the actual sight is incredibly breathtaking and worth every penny;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;The local roasted lamb is excellent; it&amp;rsquo;s a paradise for carnivores;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;When flying in South America, always leave plenty of buffer time;&lt;/p&gt;</description>
    </item>
    <item>
      <title>Argentina Travelogue (II): Stepping into Iguazu, Enveloped by Roaring Waters, Lush Greens, and Wild Creatures</title>
      <link>/posts/argentina-iguazu/</link>
      <pubDate>Tue, 16 Dec 2025 00:00:00 +0000</pubDate>
      <guid>/posts/argentina-iguazu/</guid>
      <description>This post mainly recounts the trip to Iguazu Falls.</description>
    </item>
    <item>
      <title>Argentina Travelogue (I): Buenos Aires, South America’s Purple City</title>
      <link>/posts/argentina-buenos-aires/</link>
      <pubDate>Sun, 07 Dec 2025 00:00:00 +0000</pubDate>
      <guid>/posts/argentina-buenos-aires/</guid>
      <description>Having just wrapped up my trip to Argentina, it felt both like a reunion with old friends and a brand-new adventure.</description>
    </item>
    <item>
      <title>Guangzhou: Delicious, Refreshing, and So Damp!</title>
      <link>/posts/guangzhou/</link>
      <pubDate>Mon, 22 Sep 2025 00:00:00 +0000</pubDate>
      <guid>/posts/guangzhou/</guid>
      <description>&lt;p&gt;I never expected to find myself in Guangdong again. Without any prior planning, I’ve somehow ended up visiting Guangdong four times in the less than six months since I returned to China in April.&lt;/p&gt;
&lt;p&gt;The first time was early April, staying in Shenzhen after coming from Hong Kong. The second was in May, visiting Shanwei with friends after returning from Dubai. The third was a layover at Baiyun Airport on my way back from Budapest via Guangzhou. Just a few days later, while &amp;ldquo;funemployed,&amp;rdquo; I helped a friend organize an event, which turned into a two-week tour of Guangzhou and Shenzhen.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Three Colors in Chiang Rai: White, Blue, and Black</title>
      <link>/posts/chiang-rai/</link>
      <pubDate>Wed, 03 Jul 2024 00:00:00 +0000</pubDate>
      <guid>/posts/chiang-rai/</guid>
      <description>&lt;p&gt;Recently, a close friend&amp;rsquo;s boyfriend came to Chiang Mai. They were planning to rent a car and drive to Chiang Rai, and invited me to join them. The itinerary was extremely simple and straightforward: the White Temple, the Blue Temple, and the Black House. Once we finished visiting the three places, we&amp;rsquo;d head straight back.&lt;/p&gt;
&lt;p&gt;My willpower, unfortunately, was weak. I let myself get dragged into the trip, abandoning the articles I was supposed to read and the work waiting for me. And just like that, I became the shining third wheel.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Da Nang Tết Survival Guide: How I Learned the Hard Way to Avoid Becoming a &#39;Sitting Duck&#39;</title>
      <link>/posts/da-nang/</link>
      <pubDate>Sun, 25 Feb 2024 00:00:00 +0000</pubDate>
      <guid>/posts/da-nang/</guid>
      <description>The Lunar New Year in Da Nang felt like a high-stakes trial. Despite the physical toll of illness and anxiety, my soul found healing in conversations that transcended borders.</description>
    </item>
  </channel>
</rss>
