<?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>FidCore</title>
        <link>https://paragraph.com/@aoraki-labs</link>
        <description>Trusted Infrastructure for Verifiable Computing.</description>
        <lastBuildDate>Thu, 05 Nov 2026 12:58:33 GMT</lastBuildDate>
        <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
        <generator>https://github.com/jpmonette/feed</generator>
        <language>en</language>
        <image>
            <title>FidCore</title>
            <url>https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/88181d200272b28f4d64cc7247f76c675e2f8e907cfa9024955d6b37fc3badec.png</url>
            <link>https://paragraph.com/@aoraki-labs</link>
        </image>
        <copyright>All rights reserved</copyright>
        <item>
            <title><![CDATA[Introducing FidCore: Trusted Infrastructure for Verifiable Computing]]></title>
            <link>https://paragraph.com/@aoraki-labs/introducing-fidcore-trusted-infrastructure-for-verifiable-computing</link>
            <guid>eb2T2QMXv8XaoJTyOgEY</guid>
            <pubDate>Tue, 27 Jan 2026 15:14:18 GMT</pubDate>
            <description><![CDATA[Introducing FidCore: Trusted Infrastructure for Verifiable Computing1. Deep Roots: Built on BeliefOur conviction in ZKP (Zero-knowledge Proof) and FHE (Fully Homomorphic Encryption) as the bedrock of trust has never wavered. Since entering the space in 2022, we have been builders, not just participants. Our track record reflects a dedication to cryptography compute acceleration: Hardware Acceleration: Accelerated GPU solution for Halo2/Aleo/RiscZero, FPGA ZPrize & ASIC acceleration solutions ...]]></description>
            <content:encoded><![CDATA[<h1 id="h-introducing-fidcore-trusted-infrastructure-for-verifiable-computing" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Introducing FidCore: Trusted Infrastructure for Verifiable Computing</h1><h2 id="h-1-deep-roots-built-on-belief" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">1. Deep Roots: Built on Belief</h2><p>Our conviction in ZKP (Zero-knowledge Proof) and FHE (Fully Homomorphic Encryption) as the bedrock of trust has never wavered. Since entering the space in 2022, we have been builders, not just participants.</p><p>Our track record reflects a dedication to cryptography compute acceleration:</p><p>Hardware Acceleration: Accelerated GPU solution for Halo2/Aleo/RiscZero, FPGA ZPrize &amp; ASIC acceleration solutions exploration.</p><p>Node Operations: Operated Prover Nodes for top-tier ZK-Rollups like Taiko, ensuring early network stability.</p><p>Technical Excellence: Research on various ZKVM solutions, like RiscZero ZKVM/SP1 ZKVM/Aleo ZKVM...</p><p>Scale Contribution: Contributed massive compute resources to the Boundless prover network and supported the SP1 ecosystem as an early partner.</p><p>Continuous Expansion: We are currently actively testing and deploying infrastructure for frontier protocols like Zisk, Aztec, Brevis, Nockchain, and Psy.</p><p>Crucially, we have established a strategic partnership with Intchains (Nasdaq: ICG) to co-develop ZK ASIC products and research next-generation algorithms. This DNA of "Software-Hardware Co-design" is what distinguishes us from generic providers.</p><h2 id="h-2-industry-insight-zk-is-the-backbone-of-the-crypto-world" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">2. Industry Insight: ZK is the Backbone of the Crypto World</h2><p>Standing here in 2026, we see a qualitative shift in the ZK landscape:</p><p>From Theory to Production: ZKVM technology has matured. Networks like Boundless now orchestrate hundreds of trillions of proved cycles. ZK-Rollup mainnets like Taiko and Scroll have demonstrated resilience over long operational periods.</p><p>The Ethereum Endgame: The Ethproofs initiative from Ethereum Foundation is pushing Layer 1 towards a ZK future. This is a milestone event—it means ZK is no longer an optional patch, but the necessary path to achieving decentralization, security, and performance simultaneously.</p><p>We believe Verifiable Computing will become the core infrastructure of the decentralized web, just as electricity is to modern industry.</p><p>However, there is a gap in the supply side: General cloud providers (like AWS) are too expensive for continuous cryptographic workloads, while hobbyist operators lack the stability required by institutional protocols. The industry demands an "Industrial Compute Grid"—massive, performant, stable, and cost-effective.</p><h2 id="h-3-fidcore-two-business-directions" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">3. FidCore: Two Business Directions</h2><p>To bridge this gap, we built FidCore—a trusted infrastructure platform for verifiable computing. Our services are structured into two complementary offerings:</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/177a6799d47c6161e91e93ca660cc312cdb66ed38ed79388a0fc2852ef2e5d39.jpg" blurdataurl="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAACAAAAARCAIAAAAzPjmrAAAACXBIWXMAAAsTAAALEwEAmpwYAAAGGUlEQVR4nG2Vb3ATdRrHfzOOjq/U8UZEUDwPez1H71RQ6SGgDMdYT6eKjjAo4MzVU5FjnDpalcNSihRHqhbE0tLaBFKaJu0mbZrEpDFpaNLmX1M2af41aZKm2U3SNrvJZrPZzW6XvQnOOb5w5jvPPK+eZ57vPM/nATRTYFmSZgqrPMXzJZ6nOK4SyyzJr1I8T63yFMMQglAKLyTlJpc6kTQnFucRhOMomimUWfJX0UyBZojfqkTngSMYKVA5nqdaJJPPfy7f/5Xq0BlVk2i8Rz39wXltfbum/hv1nhZIOeHD89lutdUwHzfH4lE0xbIFqpQv0b8vmiEYmiiVcGDxBOC5KMcVtY6gWDdztMN45zs9NQ19dc2K9e+L/nkc0jpCSmvAGYhavIGB8enxWMyOIiU6z9wsVKRwqpS/6QHxS04zBFsukAyBUwRGYiCGIpNeP0nhq3xJEMrOYKJFaj3RY2zs0h39Qf+tzMLQmCCUZkKRQbPTEoyMowhO4SxLLtNEkcqVWZJjySQSw/DUDb5EMwTJ5JMkrl9EdYtJ91IKeJGkxgY7faECRZicHlFv58jwgEY1OAxJtWolBPVf6u7M5Vf0Nq/a5fNm05HsEssWECpnw5fJcoHAM5BtsmXC2m612vyeCIlFSVweT4yhiDubyRZxMBOLK11+hdldYojlFfRSd2dvb0+PqPvH3m7ztZ/JytQ4xxX1Dt+IzevKpL0ZNEfnjATmJnOa+fBRmeILNyxCU92RaJPN2WCxNc342mfn9MmEO5txYRlAFLARp8cEB8osNeWG+/p6+6VXDEa9dKBfox3luGKRymG5lWHrzKjTGyPxIlekb9DXkfiXY6a35JpGONgUW+hPoaMry32p9PGp6dM/GRXh2OX4AkJhfnwJhBHUCM+ZZwLu4LwjGPUE/UtLi/F4OJ2K5LKLoVhMZZuVGJ09Jjuaw1IptHPI/B+RYtslaHe3fBc0flBlPaKdaLS43jTZD2mu1SrNbyvHLnp8EyhqW0rPZzNA7/Dqp65rpuAJ75ze4b0glh94r7HmhQP7P2w7JZv6QWM1wZ5kDlsVyhrjtc1H2sA759Yf/mpHc+/py7Jz0oG6D5vaJ6ytlsl2u7Ntyi6fnIwvo6pMWr+QMKUQVyYNZAaLOxZfJrJ76/976x+3gw07wQN14KEDYO0+UPXGmk21L772ZvOZtgsSaP2Ji2BvU3OXlOcKPFeYRxaMLtdCNgWz5TBDBcpFD0sHWVoQ+BtCOYQtWxHEvpQGHRpjYy+ktdpBTT1YvweAzaC6HlS/XvV07eNbdz/13MtrH916T/WWdV0QqPvo41NiQSiXWZJi8lfG9SLdyHeKgdarYplp7IpBK9GrRXp1m0ImMWhIqrIalUOTqH7ef7pz36dn7/zHUbDxIAA14L6XwG1/B39+ecP2A/f8ZVvV5u2P7HgR1H5ypLFNEJgUlnFG5v2LyJTffUx06e1vz376Y9e+L08e7vj+lebjB1tbzqkVZyFpGkuxLElSOPAEI73QWF1DC1i3C9yyAzzwKlhTC55pBA8f2vjEzrXVNVWbn7uv6snPTp4PokgkhVyPxy1ev9LkEgTeHQl8DUnPjwyKNKrWq+I2aKBVKjbPzgjCDfomLYoUDvQ2GMWyPZIhAB4BYAvYsB+Av4E7toF7X9r41Au337/pDw8+edfDW+UanSeRkJmdWqfPND1bpPBIBhkcGdJqho1G3aBcKpVe9nqvC4LA82yZJUv0/2E3BgcNcEDn8n98QQn++m9w2y4A7gaguuLVmsfA/c+s2/1u40Wl2GBXmB0uX8ifTEAOeI5Y8SQXR7Sjg3KpTj/ad1UskYj6roq1OlW/9Eo44uM4qkjhRSoHhozjH5w6t/HgSbDjffDY3j0Nba8d6wBb/gVu3/T4zr0N7bL3vob2nOjsMUya3L7FFAqnk2NwMIwtZUksiUQj8wE0tbCQiESjwWgsFI+HQ2Hf8gr6C7orDRrOdIBn3wV/euWN+mOHP28ZmvGpbV4DHJH/ZPaFQsP2WU8+e7pLeUakms6ktVY4XcJt/rnASrpQynFckeMqn4PjqF+1WvklhQqxK7jO/Q/kDY5kGOUI9AAAAABJRU5ErkJggg==" nextheight="559" nextwidth="1024" class="image-node embed"><figcaption htmlattributes="[object Object]" class="">FidCore's business</figcaption></figure><h3 id="h-genesis-compute-provider" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Genesis Compute Provider</h3><p>High performance and cost-effective computing capacity for ZK and FHE networks.</p><ul><li><p><strong>Hybrid GPU &amp; ASIC Acceleration</strong>: We orchestrate GPUs and custom ASICs to deliver optimal performance for diverse cryptographic workloads.</p></li><li><p><strong>Elastic Scale</strong>: Dynamically scale compute resources to match protocol demands, from testnet to mainnet and beyond.</p></li></ul><p>We are not transient operators. We provide compute support from the Genesis Block, guaranteeing Liveness and Finality for the networks we serve.</p><h3 id="h-verifiable-computing-cloud-platform-coming-soon" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Verifiable Computing Cloud Platform (Coming Soon)</h3><p>A unified acceleration API for developers. Submit requests easily and get proofs fast.</p><ul><li><p><strong>Zero-DevOps</strong>: No infrastructure management required. Focus on your application, not your servers.</p></li><li><p><strong>Smart Orchestration</strong>: Intelligent routing and load balancing across our compute fleet for optimal cost and performance.</p></li></ul><h2 id="h-4-our-core-advantages" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">4. Our Core Advantages</h2><p>What sets FidCore apart from generic cloud providers:</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/e8d3cbc888640e63678ef3fc7de419898643390e656c0ddc40cb8fac1083baf2.png" blurdataurl="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAACAAAAASCAIAAAC1qksFAAAACXBIWXMAAAsTAAALEwEAmpwYAAAGr0lEQVR4nCWUa0xbhxXH7ypF2qRV2z5sa9VumrSqitpqnTKtSljVSWuUTVPWpMuG0lXpaEIQuGAwrjE3GNs4fmK4NvbF4NzYl2AXsIlj17sYCNhxTKgZNo5tYnAI79gGv64f2Bhj4juRnW/nfDhH5/zP7w9ksol0Op7N4o6ZGavNNjk5hVkmpm1Wq81mGZ94YLdPTVuNJvPm9sbR0T5BHB4dFfZyeCabdDqdZsxiGZ8wmcdM5jHL5H2zeQwbmxgbOy4+D23vFzJ4KgYkkjvlckHzjb6RQq8jUYQiiNxIp9IYQrFUKJK0M7kdHQLN0Eg7kzs3Nzcw+E0/on7yxK8Z1n987lOJrFelviORwmpU06+8LZP39SNqoQgSiiA6yM7lUzi+C+zvp4MryxQa86CY7VUoL1y4zGLzqNRWBoPDYHCoVFCn0xPEi0Ht0O9Pn/tnZdXvPviY1EBvY/L7lYhcrritUkGQFLmFIMhtHk/A4fD7+pQiUVdTM6gbNbwo7wOHhzkmm/9odvaguLcbDUOQ/O5dQ6dYUl1NgqAeg8GYTEUTyZ1oNNxEZWSyeDodo9KYCwsLBFFe8Cxsb689mn0EvVzCZreNj4+HQhsEcbgbDTdSwEhkG3C5XU0U8PAwH45s9Stv8XgCOp1xpuLsG788+f5vz/ztk0qdTr+07C+XC3wBhGFYIOAHb9w8KO5lsnH96KjJZKypbRB3S24wWGw2z+vzBAL+RHKHIA46OJ0YhgF7ObyF3j4z40gkd6/XkIBXfgoAPwCO40cAcAIAAJkMjsXD/kUfidySzSb2cjgNZLrcroNiJhTacLvnpTK5uFsmFEvUanRoeNjl/m+plHO5XeRmMJ2OAfuFTGAp0MbkJ5I7V6+SAOBnAPDjn7/+1onvv/ZyzPeGhofy+TS5GfT6Hj+anbHarMvBwNd05otyoVTKSaQ9odB61TXSnUFNJLJpMpnW1oLlcoEGsvyL/r0cDqTTsRGd/lJllRrVDA0Pn7/4rx+++sarP/kFALxy3P/E64hKzeOLYRghCAJWILUkCkEQKlQLSWGXe/7/z/3OexXVNQ3LwSW3Z8HtcXWKe87+5R99SmR/Pw3gePT8xc8bmuhT09P6UYMZs0xarRNT0ybzf4wYZjKPIao7BqPJarNd/uxap1iKqNRSKTw5OWkymzXaEd2oAcMsdsfDian7GGa5ZzTDCmRq2ioUyz699EWxmAVwfPeTv3/Rp0TvGb9lc0VCsYzB5vP4YjmsVKOabiksFMu6IPhbs5nF5l2vbWqitLbQ2zEM6+lRtDG5UlgpFPeAYEcXBMMKhMURCcRSWHHr/MUrlyq/zOeTQKGQUaOaj/50QQ4ra2spDWTawICGyxXRQdbNm4LaOgqX1ymH+zncboIgmprBr8g0giBYHZ0v4ULqSJQWOoMvEF+5cr2B/PW/q+os4+MP7Pa336lA0YF4PHzMgdfnJZFbc/mU1/c4uLLUq+j78iqJVN/cRKF7fY+9vsfFYrYV7LBM3ne55+2Ohw6Ho66+5UW5gKeiGIZdr2mgtTBAkM3lipaWj4UliEO+SHLPNHZ8omw2QQfZTqfzoLgXi4eXlhZHR/Vd3dLBQY1WO2SzTYcjm/k8vr6xVk+mRyLbeCraTG1f31hDVGgXdMzX1Wv1QrHEarMiiGpufm7B43q2GgxHthopYDC4BKyurtBbj30jm0uGI5sarfbd35zh84U3GKzTFWd1Op3X54nFwwfFvWYqKxDwhyNbbUxuKptgcQSjhrsd3M6qa1+JuuV19c13BjV1JMrlz6oQ5HaplG+ktHl9HqBcLvQp1RrtyNFR3uNZQFH0tTdPvn/qj2/+6t1fv31KP3p3feNZqZSzjE/Uk8HvnN/t5XBxl0wzrKfQ2is+/PMfPvpr5efV/Ur1rHMWUalRdECj1RoMBjWq6VOix16UySbwVAxkcMORrfX1oMFgGNGNDA0P9yO3lUrEaDQ+CXh3dp/TWljiLvjUB+dOvvdhTW0zJFWoUQ3I4L518nQbk+uYmXm6ErQ77OHIZiK5Y7hnrK6hpNPxRDIC4KnoQTHrdDqpNKYa1fBFEp5AAisQSAp3cDsl0l45jJAa6GbzWDQampufWw4GYvGwx+thc0SQtJdEBjncbp6g+yYf6oJggUjSBcGtYMfs7GyptJ9I7gDxeDgafZ5OR/2LXpv9gd3xcN7l8i/6AgH/05Xl5WAgEHjydCWYSO7G45FMNo6novF4KJONh0Kbz1aDiWQEx3cTyR08FQtHtja3Vp+H1l+m0Z3dUCwe/h8rVWl38VjIGAAAAABJRU5ErkJggg==" nextheight="1536" nextwidth="2784" class="image-node embed"><figcaption htmlattributes="[object Object]" class="">FidCore's Advantages</figcaption></figure><p><strong>High Performance GPU Capacity</strong> Thousands of GPU machines with RTX 5090/4090, delivering high performance and cost-effective computing power.</p><p><strong>ZPrize Award-Winning Team</strong> ZK-optimized computing capabilities from a team recognized with ZPrize awards for cryptographic acceleration.</p><p><strong>ASIC Customization Capability</strong> Custom ASIC computing power through strategic partnership with advanced ASIC vendors for specialized workloads.</p><p><strong>Proven Operations Experience</strong> Professional and extensive experience in operating large-scale computing clusters at production level.</p><h2 id="h-5-building-the-future-of-math-trust" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">5. Building the Future of "Math Trust"</h2><p>From ZKPool to FidCore, the name changes, but our pursuit of Math Trust via verifiable computing remains constant. We believe a Math Trust supported world will be more transparent, more individual-sovereign, and more efficient, and it will be a more civilized world, especially in the coming AI &amp; Robots time.</p><p>We look forward to deepening our collaboration with global ZK protocols, Layer 2 networks, and AI privacy projects. Whether you need bootstrap compute support or customized hardware acceleration, FidCore is ready.</p><p>Let us build the physical foundation of the decentralized world together.</p><p>Connect with FidCore:</p><p><span data-name="globe_with_meridians" class="emoji" data-type="emoji">🌐</span> Website: fidcore.xyz</p>]]></content:encoded>
            <author>aoraki-labs@newsletter.paragraph.com (ZKPool)</author>
            <category>zero-knowledge</category>
            <category>compute</category>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/226008ac9406c28068ded6be322cecf253ba74fdcf7389983caa931a07eb791d.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[zkVM and its Continuation Technology]]></title>
            <link>https://paragraph.com/@aoraki-labs/zkvm-and-its-continuation-technology</link>
            <guid>cfEtcuXX3fmMiGhU8whX</guid>
            <pubDate>Sun, 10 Mar 2024 15:34:49 GMT</pubDate>
            <description><![CDATA[Firstly, welcome to the zkML demo, which operates on ZKPool and is built on RISC Zero&apos;s zkVM solution.BackgroundIncreasingly, projects such as RISC Zero are building zkVM, while others like Taiko and Optimism are utilizing zkVM to develop applications for Ethereum Layer 2. The zkVM solution is gaining more recognition. Previously, there were concerns about its performance. However, teams have continually optimized it from both the ZKP protocol and hardware perspectives. It&apos;s getting...]]></description>
            <content:encoded><![CDATA[<p>Firstly, welcome to the <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://aoraki-labs.io/zkml">zkML demo</a>, which operates on ZKPool and is built on RISC Zero&apos;s zkVM solution.</p><h1 id="h-background" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Background</h1><p>Increasingly, projects such as RISC Zero are building zkVM, while others like Taiko and Optimism are utilizing zkVM to develop applications for Ethereum Layer 2.</p><p>The zkVM solution is gaining more recognition. Previously, there were concerns about its performance. However, teams have continually optimized it from both the ZKP protocol and hardware perspectives. It&apos;s getting faster and faster.</p><p>In particular, zkVM&apos;s continuation technology provides significant advantages, enabling parallel proving and compatibility with consumer-level devices.</p><p>Additionally, continuation technology aids in the use of proof recursion, which can help preserve privacy.</p><h1 id="h-whats-zkvms-continuation" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">What’s zkVM’s continuation?</h1><blockquote><p>In the context of our zkVM, continuations are a mechanism for splitting a large program into several smaller segments that can be computed and proven independently.</p></blockquote><p>Consider RISC Zero&apos;s zkVM as an example. A Rust program can be compiled into a RISC-V image. This image can be executed in the zkVM environment, generating a large execution session.</p><p>This session can be split into smaller segments, each of which can be proved in parallel.</p><p>If we delve deeper, we can see that the whole session may contain numerous cycles. We can define the limit of cycles for each segment. This approach allows us to handle large tasks by breaking them into smaller ones. These smaller tasks can run on lower-end devices, such as consumer-level GPUs.</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/1cea4bb01d30ef52384790ee7e2224a2ac059b66d3d20a3fb58490cdd4ef00f3.png" alt="zkVM&apos;s continuation solution (Reference 2)" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">zkVM&apos;s continuation solution (Reference 2)</figcaption></figure><p>Note that to obtain the final proof of the entire session, we need to join the proof of each segment through proof recursion.</p><p>For instance, if a program is divided into four segments, we must prove each of these four segments and then perform proof recursion three times.</p><h1 id="h-the-value-of-continuation-technology" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">The value of continuation technology</h1><p>In the Zero-Knowledge Proof (ZKP) proving system, without continuation technology, the circuit could be quite large, necessitating the manual division of big circuits into smaller ones.</p><p>For zkVM, since we can divide large proving tasks into smaller ones, we can execute these tasks in parallel. This could potentially reduce the latency of proving, even when taking the cost of proof recursion into account.</p><p>In fact, a parallel computing system has several requirements:</p><ol><li><p>The parallel tasks are relatively independent with minimal interaction between them.</p></li><li><p>There is a low amount of data transfer between the scheduler and parallel tasks.</p></li><li><p>The total latency can be reduced.</p></li><li><p>The overall computational load doesn&apos;t increase linearly with the number of parallel tasks.</p></li></ol><p>Fortunately, the zkVM&apos;s continuation technology meets the above requirements.</p><p>In addition, the zkVM&apos;s continuation has these other advantages:</p><ol><li><p>This can reduce the memory requirements for parallel tasks, enabling more individuals with consumer-level devices to participate, thereby promoting decentralization among provers.</p></li><li><p>It supports pausing and resuming a zkVM.</p></li><li><p>It can preserve privacy through proof recursion.</p></li></ol><h1 id="h-the-applications-of-zkvm-with-continuation" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">The applications of zkVM with continuation</h1><p>zkVM can simplify the proving of all Rust programs without the need to write circuits. Its continuation technology can also reduce latency through parallel proving.</p><p>This is why teams developing zkEVM, including Taiko and Scroll, are also exploring zkVM solutions.</p><p>While zkML requires a large amount of computation with zkVM, continuation technology ensures that any large models such as LLM can use zkVM for proving. This is particularly useful as proving performance continues to improve.</p><p>Finally, its application in a privacy preservation scenario will be highly anticipated.</p><h1 id="h-best-practice-of-zkvm-solutions" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Best practice of zkVM solutions</h1><p>One challenge for zkVM is identifying the optimal solution for parallel proving, particularly determining the number of segments.</p><p>If we split the tasks into segments (assuming <em>n</em>=2^<em>i</em>). Then we will need <em>n</em> segment proving tasks and (<em>n</em>-1) recursion proving tasks.</p><p>Thus, the total proving computation loading is:</p><p>$$L=nL_{seg}+(n-1)L_{rec}$$</p><p>In which:</p><p><em>L</em>: Total computation loading</p><p><em>L</em>seg: The computation of one segment</p><p><em>L</em>rec: The computation loading of proof recursion</p><p>Thus, compared to not splitting, the overall computational load will increase.</p><p>On the other hand, if more than <em>n</em> devices can participate in parallel proving, which will complete both the segment&apos;s proof and recursive proof, then the latency will be:</p><p>$$T=T_{seg}+iT_{rec}$$</p><p>In which:</p><p><em>T</em>: Total computation latency</p><p><em>T</em>seg: The computation latency of one segment</p><p>Trec: The computation latency of proof recursion</p><p>As evident, when <em>i</em> is large, the proving latency might be significantly reduced. However, it&apos;s important to balance this with the increased total computational load due to more segments.</p><h1 id="h-the-future-of-zkvm" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">The future of zkVM</h1><p>We believe that zkVM will become increasingly advantageous as performance improves, given its significant benefits for general-purpose usage.</p><p>Reference:</p><ol><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.risczero.com/blog/continuations">Using Continuations to Prove Any EVM Transaction</a></p></li><li><br></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.risczero.com/blog/proof-composition">Proof Composition: Unlocking Recursion and Modularity for ZK Developers</a></p></li></ol>]]></content:encoded>
            <author>aoraki-labs@newsletter.paragraph.com (ZKPool)</author>
        </item>
        <item>
            <title><![CDATA[How to access ZKPool for ZKML proof task]]></title>
            <link>https://paragraph.com/@aoraki-labs/how-to-access-zkpool-for-zkml-proof-task</link>
            <guid>EJ7L9o97Vqim63HMiQIu</guid>
            <pubDate>Wed, 07 Feb 2024 02:32:30 GMT</pubDate>
            <description><![CDATA[IntroductionZKPool aims to build a decentralized prover pool that supports various zero knowledge proof (ZKP) projects, including ZK-rollup projects like Taiko, Scroll, ZK-bridge projects like Orbiter Finance and other ZKP projects. In this document, we present a demo that demonstrates how to send ZKML proof tasks based on RiscZero&apos;s ZKVM to ZKPool and generate the proof correctly. Additionally, ZKPool has the capability to split proof tasks into smaller ones using RiscZero&apos;s contin...]]></description>
            <content:encoded><![CDATA[<h1 id="h-introduction" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Introduction</h1><p>ZKPool aims to build a decentralized prover pool that supports various zero knowledge proof (ZKP) projects, including ZK-rollup projects like Taiko, Scroll, ZK-bridge projects like Orbiter Finance and other ZKP projects. In this document, we present a demo that demonstrates how to send ZKML proof tasks based on RiscZero&apos;s ZKVM to ZKPool and generate the proof correctly. Additionally, ZKPool has the capability to split proof tasks into smaller ones using RiscZero&apos;s continuation technology and distribute them to multiple provers to be processed in parallel. This allows for faster proof generation and enables lower-performance devices, including consumer devices like MacBooks, to participate.</p><p>This flow serves as an example for other ZKP requesters who need to access ZKPool&apos;s prover resources.</p><h2 id="h-zkpool-proving-flow" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">ZKPool Proving Flow</h2><p>We use a ZKML demo to explain the proving flow.</p><p>The proving flow can be described by the following diagram:</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/458a6ab045a431762a84649d1977c5c473448d52892e3eadb32b02276cef882f.png" alt="ZKPool proving flow" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">ZKPool proving flow</figcaption></figure><p>The flow involves the following participants:</p><ol><li><p>User: The person who initiates proof tasks through the user interface (UI).</p></li><li><p>ZKP requesters: Those who generate ZKML proof tasks and request proofs.</p></li><li><p>ZKPool, which consists of several components:</p><p>- Aoraki node: Receives, splits, and aggregates proof tasks, and submits the proofs. It will be open-source and decentralized.</p><p>- Aoraki ZKP provers: Receive proof tasks from the Aoraki node, and generate proofs.</p><p>- Aoraki contract: Publishes proof tasks and receives proofs.</p></li></ol><p>The overall proving flow is as follows:</p><ol><li><p>The user triggers a proof task from the UI.</p></li><li><p>The ZKP requester receives the user&apos;s input, generates a ZKML proof task, and inquires about the price with ZKPool&apos;s Aoraki node.</p></li><li><p>The Aoraki node provides the price quote for the proof, along with its signature and address.</p></li><li><p>The ZKP requester submits the tasks and proof bond to the Aoraki contract.</p></li><li><p>The Aoraki contract publishes the proof tasks, indicating which prover will handle each task.</p></li><li><p>The Aoraki node retrieves the proof tasks from the contract.</p></li><li><p>If the proof tasks are related to ZKVM, the Aoraki node splits them and dispatches smaller tasks to connected ZKP provers.</p></li><li><p>The ZKP provers generate the proofs and send them back to the Aoraki nodes.</p></li><li><p>The Aoraki nodes verify the proofs and submit them to the contract (verification will be based on verifiers&apos; consensus in the future).</p></li><li><p>The Aoraki contract calls the requester&apos;s contract for verification or publishes proof information that can be fetched by the ZKP requester&apos;s off-chain module for verification.</p></li></ol><h1 id="h-zkml" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">ZKML</h1><p>When ZK technology is applied to generate proofs for machine learning computations, it is referred to as ZKML. For more information, you can refer to this article: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://mirror.xyz/privacy-scaling-explorations.eth/K88lOS4XegJGzMoav9K5bLuT9Zhn3Hz2KkhB3ITq-m8">link</a></p><p>Several teams, such as Modulus Labs and EZKL, are working in this area. Machine learning encompasses traditional algorithms (classification, regression), CNN image recognition, and LLM models, which have gained popularity in recent years.</p><p>Generating proofs for machine learning computations is challenging due to their complexity. In this ZKML demo, we use the decision tree classifier as an example, referring to the <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/risc0/risc0/tree/main/examples/smartcore-ml">smartcore-ml</a> repository.</p><p>The prover needs to generate a proof demonstrating the correct classifier result and the correct usage of the machine learning model.</p><p>We will provide a more detailed technical document soon, including the API, and the open-source code will be available on our <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/aoraki-labs">Github</a>.</p><h1 id="h-zkvm-and-continuation" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">ZKVM &amp; Continuation</h1><p>Several ZKVM (Zero-Knowledge Virtual Machine) solutions are currently under development, such as Risc Zero, Powdr, zkWasm, and more.</p><p>ZKVM compiles target code into a specific instruction set and uses ZKP to prove the execution trace. It differs from ZKEVM, which proves the execution of the Ethereum Virtual Machine (EVM).</p><p>RiscZero has developed a proving system that compiles any computation code written in Rust, C/C++, or other languages using the popular RISC-V instruction set. It runs the RISC-V image in its virtual machine, generates traces, and uses zero-knowledge proof technology to prove the execution of these traces.</p><p>Notably, RiscZero utilizes continuation technology to split proving sessions into segments. Each segment can be independently proved and verified. By using recursion technology to prove the transition between segments, a single succinct proof can be generated for the entire session.</p><p>Running a ZKP prover is a challenging task that typically requires high-performance devices. Here are some examples:</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/10d49e7442ea5321c374511ea073025a6f5cef4ab23db755e6f8debc4312320e.jpg" alt="Device requirements example of ZKP prover" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Device requirements example of ZKP prover</figcaption></figure><p>Currently, most ZKP provers use GPUs for acceleration. However, these algorithms require large DDR memory to store proving keys, witness data, point values, etc. This makes it difficult to run the proving system on low-end GPU devices or consumer devices, which hinders decentralization.</p><p>Additionally, some ZKP tasks are integral and cannot be easily split. For example, the Halo2 plonk backend needs to generate proofs for each circuit, and when the circuit is large, the proving time and memory requirements are high.</p><p>However, ZKVM-based solutions show potential for splitting proof tasks into smaller segments and running them on lower-performance devices, such as RiscZero, Powdr, and Delphinus Labs&apos; zkWasm.</p><p>This feature has significant advantages for decentralization, as it allows for the splitting of large proof tasks into smaller ones. These smaller tasks can be executed in parallel, and each task has lower device requirements. This means that more low-end devices can participate, and the proving process can be completed in a shorter time.</p><p>ZKPool is committed to decentralizing ZKP provers, and the zkVM solution is an ideal approach to split, dispatch, and aggregate proof tasks, ultimately improving overall proving performance and decentralizing ZKP provers.</p><p>For more details about RiscZero&apos;s continuation technology, please refer to <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.risczero.com/news/continuations">RiscZero News</a>.</p><p>In this demo, we split the proof tasks into four segments, with each segment&apos;s tasks being executed on MacBook GPUs, NVIDIA 3080 GPUs, etc.</p><p>By having more than four provers participating in parallel, the proof can be generated within a few seconds.</p><p>This demonstrates the potential of using continuation technology to complete more complex ZKML tasks for machine learning models.</p><h1 id="h-conclusion" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Conclusion</h1><p>In summary:</p><ol><li><p>We illustrate a flow for accessing ZKPool&apos;s proving resources.</p></li><li><p>A ZKML demo is used as an example of how to utilize ZKPool&apos;s proving resources.</p></li><li><p>RiscZero&apos;s continuation technology is employed to split proof tasks through ZKPool&apos;s Aoraki nodes, achieving faster proving finality and compatibility with consumer devices.</p></li></ol>]]></content:encoded>
            <author>aoraki-labs@newsletter.paragraph.com (ZKPool)</author>
        </item>
        <item>
            <title><![CDATA[The Partnership Between ZKPool and Loopring: Exploration of advanced proving system ]]></title>
            <link>https://paragraph.com/@aoraki-labs/the-partnership-between-zkpool-and-loopring-exploration-of-advanced-proving-system</link>
            <guid>xZM2uLlTDh1bVAPYhjK6</guid>
            <pubDate>Thu, 07 Dec 2023 13:05:47 GMT</pubDate>
            <description><![CDATA[IntroductionWith great excitement, we, ZKPool, announce our partnership with Loopring Tech, a prominent application-specific zk-Rollup project. With its battle-tested zk-Rollup technology, Loopring builds scalable payment apps, non-custodial exchanges, and NFT marketplaces on Ethereum. This collaboration marks a significant milestone in our journey towards building the best Zero Knowledge Proof (ZKP) infrastructure and making ZKP flow in the digital world.Enhancing Performance and Reducing Pr...]]></description>
            <content:encoded><![CDATA[<h2 id="h-introduction" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Introduction</h2><p>With great excitement, we, ZKPool, announce our partnership with <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://loopring.io/">Loopring Tech,</a> a prominent <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://ethereum.org/en/layer-2/#use-layer-2">application-specific zk-Rollup project</a>. With its battle-tested zk-Rollup technology, Loopring builds scalable payment apps, non-custodial exchanges, and NFT marketplaces on Ethereum.</p><p>This collaboration marks a significant milestone in our journey towards building the best Zero Knowledge Proof (ZKP) infrastructure and making ZKP flow in the digital world.</p><h2 id="h-enhancing-performance-and-reducing-proving-costs" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Enhancing Performance and Reducing Proving Costs</h2><p>At ZKPool, our mission is to connect ZKP applications and ZKP provers, providing high-performance and low-cost proving through shared proving resources. Our platform is highly reliable and redundant, ensuring partners can trust our infrastructure for their ZKP needs.</p><p>By joining forces, Loopring can further reduce the proving costs associated with their zk-Rollup project. Our shared proving resources will enable Loopring to optimize its operations and enhance the efficiency of its ZKP processes.</p><h2 id="h-building-a-reliable-proving-system" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Building a Reliable Proving System</h2><p>In the field of ZKP infrastructure, reliability is of utmost importance. By leveraging our expertise and resources, we aim to create a robust infrastructure that can support the increasing demand for ZKP applications.</p><p>Loopring&apos;s expertise in zk-Rollup technology and ZKPool&apos;s proven track record in providing high-performance and robust ZKP solutions create a strong foundation for developing a reliable proving system with high liveness. Together, we will work towards developing cutting-edge technologies and innovations that push the boundaries of what is possible in the ZKP space.</p><h2 id="h-conclusion" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Conclusion</h2><p>The partnership between ZKPool and Loopring is a testament to our vision of building the best ZKP infrastructure.</p><p>We are excited to embark on this journey together and look forward to having our solution benefit the whole ZKP ecosystem.</p>]]></content:encoded>
            <author>aoraki-labs@newsletter.paragraph.com (ZKPool)</author>
        </item>
        <item>
            <title><![CDATA[The Partnership Between ZKPool and MinerDAO]]></title>
            <link>https://paragraph.com/@aoraki-labs/the-partnership-between-zkpool-and-minerdao</link>
            <guid>mXY2lQ1ZH9dWGO4sdE9n</guid>
            <pubDate>Sat, 02 Dec 2023 10:01:10 GMT</pubDate>
            <description><![CDATA[IntroductionIn a significant development for the world of blockchain and decentralized computation, ZKPool and MinerDAO have announced a partnership. ZKPool is a platform that aims to connect ZKP (Zero Knowledge Proof) projects and ZKP provers, facilitating the flow of Zero Knowledge Proof in the digital world. On the other hand, MinerDAO is a leading open-source community that focuses on building blockchain infrastructure for decentralized computation, decentralized storage, P2P CDN, and sta...]]></description>
            <content:encoded><![CDATA[<h2 id="h-introduction" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Introduction</h2><p>In a significant development for the world of blockchain and decentralized computation, ZKPool and MinerDAO have announced a partnership. ZKPool is a platform that aims to connect ZKP (Zero Knowledge Proof) projects and ZKP provers, facilitating the flow of Zero Knowledge Proof in the digital world. On the other hand, MinerDAO is a leading open-source community that focuses on building blockchain infrastructure for decentralized computation, decentralized storage, P2P CDN, and staking.</p><h2 id="h-studying-zkp-provers-opensource-status-and-benchmarking-performance" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Studying ZKP Provers Opensource Status and Benchmarking Performance</h2><p>As part of the collaboration, both ZKPool and MinerDAO will undertake a joint effort to study the opensource status of ZKP provers. This research will involve a comprehensive analysis of the existing ZKP provers and their performance. By benchmarking the performance of various ZKP provers, the partnership aims to identify the compatibility between ZKP projects and hardware resources.</p><h2 id="h-sharing-research-results-with-zkp-accelerator-operators" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Sharing Research Results with ZKP Accelerator Operators</h2><p>The research conducted by ZKPool and MinerDAO will not be confined to their partnership alone. Both parties are committed to sharing all the research results with the operators of ZKP accelerators. This collaborative approach ensures that the knowledge gained from the research is disseminated widely, benefiting the broader community of ZKP accelerator operators. By sharing insights and findings, the aim is to foster innovation and collaboration in the field of ZKP proving.</p><h2 id="h-conclusion" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Conclusion</h2><p>The partnership between ZKPool and MinerDAO marks an important step forward in the advancement of Zero Knowledge Proof and blockchain infrastructure.</p><p>Ultimately, the partnership between ZKPool and MinerDAO seeks to build the best ZKP proving infrastructure by uniting ZKP accelerators from all over the world.</p><p>Get the latest from ZKPool:</p><ul><li><p>Website: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://zkpool.io/">https://zkpool.io/</a></p></li><li><p>Discord: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://t.co/GrX87mUp3Y">discord.gg/PUkc9BhfcT</a></p></li><li><p>GitHub: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/aoraki-labs">https://github.com/aoraki-labs</a></p></li><li><p>Twitter: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://twitter.com/zk_pool">https://twitter.com/zk_pool</a></p></li></ul><p>Get the latest from MinerDAO:</p><ul><li><p>Website: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://minerdao.in/">https://minerdao.in/</a></p></li><li><p>GitHub: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/minerdao">https://github.com/minerdao</a></p></li><li><p>Twitter: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://twitter.com/minerdao_in">https://twitter.com/minerdao_in</a></p></li></ul>]]></content:encoded>
            <author>aoraki-labs@newsletter.paragraph.com (ZKPool)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/a197323a0985cffc1602105b7280f6959201523ee7188d3d68a51203f0bbb942.png" length="0" type="image/png"/>
        </item>
        <item>
            <title><![CDATA[ZKPool's Open Interface with ZKP Projects]]></title>
            <link>https://paragraph.com/@aoraki-labs/zkpool-s-open-interface-with-zkp-projects</link>
            <guid>ZyuByRu8aS2EjghsMrwc</guid>
            <pubDate>Mon, 13 Nov 2023 16:15:50 GMT</pubDate>
            <description><![CDATA[This document introduces how new or existing ZKP projects can access ZKPool&apos;s prover resources. It covers the background, the module structure, the interface, and the flow. The goal is to make it easier for ZKP projects to access ZKPool and utilize its open and decentralized proving system with an economical design.Centralized Proving System vs Decentralized Proving SystemCurrently, many ZKP applications still use a centralized proving system. However, decentralizing the proving system h...]]></description>
            <content:encoded><![CDATA[<p>This document introduces how new or existing ZKP projects can access ZKPool&apos;s prover resources. It covers the background, the module structure, the interface, and the flow. The goal is to make it easier for ZKP projects to access ZKPool and utilize its open and decentralized proving system with an economical design.</p><h1 id="h-centralized-proving-system-vs-decentralized-proving-system" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Centralized Proving System vs Decentralized Proving System</h1><p>Currently, many ZKP applications still use a centralized proving system. However, decentralizing the proving system has significant advantages for ZKP projects.</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/ddcdc7e1632a8b7deab607e733e0567061150fdf1d3d07f26c1daa9567fced15.jpg" alt="Centralized Provers vs Decentralized Provers" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Centralized Provers vs Decentralized Provers</figcaption></figure><p>In particular, it is challenging for small ZKP projects to maintain their prover clusters. Additionally, we can achieve a higher utilization rate for the provers by sharing a prover pool among various ZKP projects via ZKPool.</p><h1 id="h-migration-from-a-centralized-proving-system-to-a-decentralized-proving-system" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Migration from a Centralized Proving System to a Decentralized Proving System</h1><p>To migrate from a centralized proving system to a decentralized proving system for a ZKP project, the ZKPool proposes the following steps:</p><ol><li><p>Design an interface to separate ZKP requesters and ZKP provers. The ZKP Requester-Prover-Separation (RPS) model is a framework that we use.</p></li><li><p>Design prove tokenomics, which involves the following components:</p><p>(1) Define a proving task distribution strategy. Here are several strategies to consider:</p><p>* POW (not recommended).</p><p>* Multiple provers competing based on certain metrics.</p><p>* Single prover assigned to a single task (recommended for overall cost savings).</p><p>(2) Define a reward mechanism. Once the prover submits the correct proof, they should be rewarded.</p><p>(3) Define a penalty mechanism. The prover will be penalized if it fails to generate the correct proof.</p></li></ol><p>Designing such proving tokenomics is not an easy task. In this case, ZKPool provides a common contract to implement this type of proving tokenomics, while the ZKP project&apos;s contract only needs to provide its verification interface to the ZKPool contract.</p><h1 id="h-architecture" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Architecture</h1><p>The architecture consists of the following modules:</p><ul><li><p>ZKP Requester: This module represents the ZKP project or ZKP applications from the partner who sends the ZKP proving tasks to ZKPool.</p></li><li><p>ZKP Requester Contract: This module represents the contract of the ZKP Requester.</p></li><li><p>ZKPool Service: This module represents ZKPool&apos;s service, which provides price quotations, resource scheduling, and other functionalities.</p></li><li><p>ZKPool Contract: This module represents ZKPool&apos;s contract.</p></li><li><p>Prover: This module represents the prover, which connects to the ZKPool service and generates the proof for the ZKP requester.</p></li></ul><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/cfa4426e7e60f954e0bbb3e01cc63a2563e787c6f354eb0afc6b76ef207aeca5.png" alt="The architecture of ZKPool&apos;s Open Interface with ZKP projects" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">The architecture of ZKPool&apos;s Open Interface with ZKP projects</figcaption></figure><h1 id="h-design-principle" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Design Principle</h1><p>The ZKPool contract is located outside the ZKP requester contract and serves as an optional entry point for the partner. It does not interfere with the ZKP requester contract.</p><p>When submitting a proof using the ZKPool contract, no verification is performed (or optional verification), instead, the contract directly calls the functions of the ZKP requester contract. If the function execution is successful, it indicates that the proof has been successful.</p><p>Because it involves economic responsibility (e.g., ZKP requester must submit within 24 hours or face penalties), the ZKPool and ZKP requester need to agree on liability and assume certain responsibilities through liability. If the proof is submitted within a specific time frame, the liability will be returned. The requester can claim the liability if the proof is not submitted within the specified time frame.</p><p>On the ZKPool side, when a task is confirmed, it will schedule a prover to handle this task.</p><h1 id="h-flow" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Flow</h1><ol><li><p>The ZKPool service stakes liability into the ZKPool contract.</p></li><li><p>The requester that needs to generate proof communicates with ZKPool Service off-chain to negotiate tasks and obtain the corresponding information like a reward, completion time, and a signature of the task fulfillment responsibility.</p></li><li><p>The requester publishes the task to the ZKPool contract. The contract returns an identifier for the task (e.g., task1) to easily retrieve information about the task. The ZKPool service immediately receives the proof task&apos;s reward in advance.</p></li><li><p>The ZKPool service schedules a prover to do such a proving task.</p></li><li><p>The prover submits the proof to the ZKPool service.</p></li><li><p>The ZKPool service submits the proof to the ZKPool contract within the specified time (less than LiabilityWindow).</p></li><li><p>The ZKPool contract performs a simple check and calls the corresponding function of the ZKP requester contract. If the function runs successfully, the task status is changed to &quot;done&quot;.</p></li><li><p>The ZKPool contract transfers liability to the ZKPool service and provides it with a reward based on the negotiated price.</p></li><li><p>The ZKPool shares rewards with the prover.</p></li><li><p>The ZKP requester monitors the ZKPool contract and is aware when the proof is successfully verified.</p></li></ol><p>Note: If the proof is not submitted after the LiabilityWindow, the requester can claim all the liability through the ZKPool contract.</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/39e003a4a390d518dbd81a03f177d15d16971c4017b8cd812807336c7af0b5b9.png" alt="The flow about proving tasks from ZKP requester to ZKPool" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">The flow about proving tasks from ZKP requester to ZKPool</figcaption></figure><h1 id="h-summary" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Summary</h1><p>This document introduces the interface and flow for ZKP projects to access ZKPool prover resources. It is particularly helpful for the centralized proving system.</p><p>Thanks to the ZKPool contract, modifications to ZKP projects are minimal.</p><p>In the future, we will provide more details on managing the ZKPool Service&apos;s prover using a contract to achieve the internal reward-penalty mechanism and transparent revenue allocation. We will also explain how to run the ZKPool service in a decentralized manner. With these design considerations, the entire proving system can operate purely decentralized.</p>]]></content:encoded>
            <author>aoraki-labs@newsletter.paragraph.com (ZKPool)</author>
        </item>
        <item>
            <title><![CDATA[ZKP Requester-Prover Separation model to support Full ZK and Optimistic ZK]]></title>
            <link>https://paragraph.com/@aoraki-labs/zkp-requester-prover-separation-model-to-support-full-zk-and-optimistic-zk</link>
            <guid>YU321FLDk3ysMVGZ5qkI</guid>
            <pubDate>Wed, 01 Nov 2023 09:26:58 GMT</pubDate>
            <description><![CDATA[Thanks to ZeroKPunk for the review and feedback. Zero Knowledge Proof (ZKP) has many application scenarios, including rollup, bridge, and oracle. This leads to the development of projects like ZK-rollup, ZK-bridge, and ZK-oracle. Hybrid and optimistic designs have been recently applied to ZKP technology. For example, Orbiter Finance proposes an optimistic ZK bridge protocol, while Taiko presents a progressive hybrid rollup solution. Optimistic ZK operates under the presumption that all state ...]]></description>
            <content:encoded><![CDATA[<p><em>Thanks to </em><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://twitter.com/zerokpunk"><em>ZeroKPunk</em></a><em> for the review and feedback.</em></p><p>Zero Knowledge Proof (ZKP) has many application scenarios, including rollup, bridge, and oracle. This leads to the development of projects like ZK-rollup, ZK-bridge, and ZK-oracle.</p><p>Hybrid and optimistic designs have been recently applied to ZKP technology. For example, Orbiter Finance proposes an optimistic ZK bridge protocol, while Taiko presents a progressive hybrid rollup solution.</p><p>Optimistic ZK operates under the presumption that all state transitions are correct, without requiring an immediate validity proof. However, it establishes a predetermined challenge window, during which any participant can dispute a fraudulent activity by submitting either a validity proof or a fraud proof.</p><p>This design reduces the overall proving cost for ZKP projects while still ensuring safety by incentivizing decentralized challengers to monitor the systems and challenge fraud behavior.</p><h1 id="h-optimistic-zk-bridge-protocol" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Optimistic ZK Bridge Protocol</h1><p>Orbiter Finance is a prominent cross-rollup project. It proposes the &quot;<a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/Orbiter-Finance/papers/blob/main/yellowpaper/yellowpaper.pdf">Orbiter Cross Rollup Protocol: Optimistic For The Obedient Majority And Severe Arbitration For Malicious Minority</a>&quot;.</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/5d0e7d291b426bf03b6697a91142d2c8edfb37a5e16da785f1306b5ef96b47b0.jpg" alt="Optimistic Cross-rollup Transaction Flow. (From Orbiter Finance)" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Optimistic Cross-rollup Transaction Flow. (From Orbiter Finance)</figcaption></figure><p>It defines a decentralized, secure, and cost-effective cross-rollup bridge design, supported by ZKP technology.</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/e83e40363117bb126dd11b234d916819e21cc26e7ecd9b3e203dba7b2cb93b93.png" alt="Orbiter’s decentralization design" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Orbiter’s decentralization design</figcaption></figure><p>There are several important factors to consider for such a design.</p><p>Firstly, historic bridge projects have experienced multiple security issues, resulting in significant losses for users. Centralization also poses security concerns. Therefore, decentralization is crucial for bridges.</p><p>Secondly, there needs to be a mechanism to ensure accurate transactional processes between the source chain/rollup and the destination chain/rollup.</p><p>Furthermore, it is essential to find a cost-effective way to generate such proof. ZKP is a viable option with less gas fee, compared with on-chain Merkle proofs.</p><p>In particular, for a cross-rollup bridge, the cost is a primary consideration, and the entire design aims to minimize expenses. This means reducing on-chain transactions and minimizing gas usage for each on-chain transaction are of utmost importance.</p><p>In Orbiter&apos;s design, apart from the bridge payment scenario, there is another scenario that requires ZKP. In this scenario, a role called &quot;submitter&quot; aggregates the cross-rollup transaction information and sends it to L1 to ensure accurate rewards for decentralized dealer roles.</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/15d471a0c581ced0b9059c6f5bf5be7d154d312944eac477bfc00bc2bec7d62f.png" alt="Orbiter’s decentralized submitter design" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Orbiter’s decentralized submitter design</figcaption></figure><p>Orbiter&apos;s protocol assumes that the majority of actors are not faulty and handles cross-rollup events optimistically to ensure timely execution. If each cross-rollup transaction requires proof, the execution of the entire bridge transaction will be slow. Therefore, when there is no malicious behavior, there is no need to generate proof, saving the cost of proving. However, if malicious behavior is detected in the maker or submitter, the challenger can generate proof and the challenged submitter should also submit proof.</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/e976e941b88147f5a6453de06e0277f694d444eb9cdd8801ff1f86261af25eec.png" alt="Orbiter’s optimistic zk-bridge design" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Orbiter’s optimistic zk-bridge design</figcaption></figure><h1 id="h-zkpools-requestor-prover-separation-model" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">ZKPool’s Requestor-Prover Separation Model</h1><p>When it comes to using ZKP technology, there are different modes available:</p><ol><li><p>Full zk: In this mode, each transition requires a ZKP. This can be achieved through projects like ZK-bridge, such as Polyhedra, or ZK-rollup such as Scroll.</p></li><li><p>Optimistic zk: In this mode, ZKP is only required when a transition is challenged. An example of this mode is Taiko and Orbiter.</p></li></ol><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/e6277f5c0a5a89c7aeaecb135bed00baad29635a1982d4fd658763a3ab1443a3.png" alt="Full zk and optimistic zk" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Full zk and optimistic zk</figcaption></figure><p>When defining an abstract model, it becomes apparent that both ZK-bridge and ZK-rollup can share some similarities. Specifically, this can be seen in the relationship between ZKP requestors and ZKP provers, as illustrated in the picture below. Here the ZKP requestors refer to the module that has requirements to generate a ZKP.</p><p>The scenarios are as follows:</p><ol><li><p>In the ZK-rollup project:</p><ul><li><p>In full zk mode, the sequencer works as the ZKP requestor.</p></li><li><p>In optimistic zk mode, the challenger works as the ZKP requestor.</p></li></ul></li><li><p>In the ZK-bridge project:</p><ol><li><p>In full zk mode, the maker works as the ZKP requestor.</p></li><li><p>In optimistic zk mode, the challenger works as the ZKP requestor.</p></li></ol></li></ol><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/55c38b4a58f1651f9ac475561b585b55c2c7b11b0f6ccd4affca80eb9f84ed15.png" alt="ZKP requester and ZKP provers " blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">ZKP requester and ZKP provers</figcaption></figure><p>As mentioned before, in optimistic zk, there may not always be a proving task. Therefore, if we combine the ZKP requestors and ZKP provers in the same module, the provers may be idle, and their computation power may not be fully utilized.</p><p>However, if we design a requestor-prover separation model and make the prover a shared pool, we can improve the prover&apos;s utilization rate. When there are no challenges for the optimistic scenario, the prover can take on proving tasks from other ZKP projects. That means ZKPool plays a significant role in zk-bridge projects, particularly in hybrid and optimistic scenarios.</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/41c5aba3d52b8e810bbd1903ea96d639e3c932ec81264bfcad9a5a40d35a1cff.png" alt="ZKPool’s role to share ZKP provers among ZKP requesters" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">ZKPool’s role to share ZKP provers among ZKP requesters</figcaption></figure><p>The ZKP requester-prover separation model applies not only to rollup and bridge but also to oracle and all other ZKP projects.</p><h1 id="h-conclusion" class="text-4xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Conclusion</h1><p>Based on the information presented, we can draw the following conclusions:</p><ol><li><p>ZKP (Zero-Knowledge Proof) technology is essential for ZKP projects, including rollup, bridge, oracle, and other related projects.</p></li><li><p>ZKPool allows us to consider the maker/submitter of ZK-bridge and the sequencers of ZK-rollup as the same role, known as the ZKP requestor.</p></li><li><p>By using ZKPool&apos;s ZKP requestor-prover separation model, the utilization rate of provers can be increased. This model also promotes decentralization in all ZKP projects.</p></li></ol>]]></content:encoded>
            <author>aoraki-labs@newsletter.paragraph.com (ZKPool)</author>
        </item>
        <item>
            <title><![CDATA[ZKPool's Aggregation of Multi-Prover]]></title>
            <link>https://paragraph.com/@aoraki-labs/zkpool-s-aggregation-of-multi-prover</link>
            <guid>mWLEAHe5it2WMlo88zCj</guid>
            <pubDate>Tue, 31 Oct 2023 09:59:12 GMT</pubDate>
            <description><![CDATA[What&apos;s a multi-prover system?In a ZKP (Zero Knowledge Proof) system, multiple types of proofs can be generated for the same proving task. The verifier can only verify a state transition when all the generated proofs are verified. The types of proofs include ZK-SNARK, ZK-STARK, SGX, and so on.Multi-prover system (From Taiko&apos;s blog)Vitalik proposed the multi-prover design in a speech.Vitalik&apos;s multi-prover proposal (From Vitalik&apos;s share)Especially, SGX proof is a type of pro...]]></description>
            <content:encoded><![CDATA[<h2 id="h-whats-a-multi-prover-system" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">What&apos;s a multi-prover system?</h2><p>In a ZKP (Zero Knowledge Proof) system, multiple types of proofs can be generated for the same proving task. The verifier can only verify a state transition when all the generated proofs are verified. The types of proofs include ZK-SNARK, ZK-STARK, SGX, and so on.</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/5322cd298d13f7eccf99ce77a89f14230eb4559b9817ef73b46f3ff27b2e3fa6.png" alt="Multi-prover system (From Taiko&apos;s blog)" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Multi-prover system (From Taiko&apos;s blog)</figcaption></figure><p>Vitalik proposed the multi-prover design in a speech.</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/b64ae8abe1d866091d4258013e1c4b8579b5ff318ad813f35af99300f5a20410.png" alt="Vitalik&apos;s multi-prover proposal (From Vitalik&apos;s share)" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Vitalik&apos;s multi-prover proposal (From Vitalik&apos;s share)</figcaption></figure><p>Especially, SGX proof is a type of proof guaranteed by hardware. It eliminates the need for complex proving computations using special hardware to execute code and ensure honest computation securely.</p><p>To run SGX, the prover must have a dedicated machine with SGX support.</p><h2 id="h-why-is-multi-prover-necessary-for-zkp-projects" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Why is multi-prover necessary for ZKP projects?</h2><p>It&apos;s because ZK-EVM or ZK-VM won&apos;t be bug-free for a long time. The multi-prover system can avoid the error state being mistakenly verified by error-proof. Requiring and verifying all different proofs guarantees a much safer condition.</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/187f231afb3c7ce0542c54971d04650e88a33b7ee9a45f29d597d9141a3bd707.png" alt="Why multi-prover is necessary? (From Vitalik&apos;s Share)" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Why multi-prover is necessary? (From Vitalik&apos;s Share)</figcaption></figure><p>Here is a picture to illustrate the meaning of multi-prover.</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/10f29ca10232f858459b9ba54893e4cf391fd04e67b01f9556a1071b45addb4b.png" alt="Safety of multi-prover (From Taiko&apos;s blog)" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Safety of multi-prover (From Taiko&apos;s blog)</figcaption></figure><h2 id="h-how-can-zkpool-benefit-the-multi-prover-scenario" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">How can ZKPool benefit the multi-prover scenario?</h2><p>Prover operators then face a significant challenge. The ZKP project needs provers to generate multiple proofs simultaneously (to save gas fees) or at different times (like Taiko’s progressive hybrid rollup design) for the same block. It becomes difficult for individual or institutional operators to have ZK and SGX prover capability.</p><p>ZKPool can act as a super-prover by aggregating proofs from independent SGX and ZK provers and then sending the aggregated proofs to the verifier.</p><p>Therefore, each individual can use either ZK provers or SGX provers exclusively.</p><p>Furthermore, in a multi-prover system, by comparing different proofs off-chain before submitting, we can save on-chain costs. The decentralization of off-chain multi-prover benefits such honest comparison.</p><p>ZKPool aims to support different Zero-Knowledge Proof (ZKP) projects. It enables using different kinds of provers to generate proofs for various projects, thereby maximizing hardware utilization.</p><p>This is how ZKPool benefits the multi-prover based ZK-rollup.</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/44b5cb56527458854328f4fb796006d5dc6993cc62c6677d31531b6b029846af.png" alt="ZKPool&apos;s architecture to support multi-prover" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">ZKPool&apos;s architecture to support multi-prover</figcaption></figure><p>We are firmly convinced that a multi-prover approach is crucial for the development and success of the ZK-rollup ecosystem and other ZK-related applications, such as ZK-bridge and ZK-oracles.</p><h2 id="h-reference" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Reference</h2><ol><li><p>Taiko&apos;s progressive hybrid rollup design: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/taikoxyz/taiko-mono/pull/14705">https://github.com/taikoxyz/taiko-mono/pull/14705</a></p></li><li><p>Multi-prover introduction from Taiko: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://taiko.mirror.xyz/Kx1Mp4WJjd83K1KDEwp1pM7xi9QmpSahxJg3S_N7NE4">https://taiko.mirror.xyz/Kx1Mp4WJjd83K1KDEwp1pM7xi9QmpSahxJg3S_N7NE4</a></p></li><li><p>Vitalik&apos;s proposal on &quot;Multi-Prover for Rollup Security,&quot;: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.youtube.com/watch?v=6hfVzCWT6YI">https://www.youtube.com/watch?v=6hfVzCWT6YI</a></p></li></ol>]]></content:encoded>
            <author>aoraki-labs@newsletter.paragraph.com (ZKPool)</author>
        </item>
        <item>
            <title><![CDATA[ZKPool A1 is Alive and Opens Prover Market]]></title>
            <link>https://paragraph.com/@aoraki-labs/zkpool-a1-is-alive-and-opens-prover-market</link>
            <guid>z4LSmb5uO6O45vj6NNW1</guid>
            <pubDate>Wed, 27 Sep 2023 01:51:30 GMT</pubDate>
            <description><![CDATA[Today marks the launch of ZKPool A1, which is our first step towards two-tier proving tokenomics. This upgrade supports Taiko A5, which will have off-chain prover selection. ZKPool receives proof tasks and rewards from sequencers, and the Taiko contract acts as an arbitrator to publish tasks and send rewards.1. Open to ZKP RequestersFor the first time, ZKPool is opening the prover market to ZKP (Zero-Knowledge Proof) projects. The prover market points to Taiko at the following URLs: HTTP: htt...]]></description>
            <content:encoded><![CDATA[<p>Today marks the launch of ZKPool A1, which is our first step towards two-tier proving tokenomics. This upgrade supports Taiko A5, which will have off-chain prover selection. ZKPool receives proof tasks and rewards from sequencers, and the Taiko contract acts as an arbitrator to publish tasks and send rewards.</p><h2 id="h-1-open-to-zkp-requesters" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">1. Open to ZKP Requesters</h2><p>For the first time, ZKPool is opening the prover market to ZKP (Zero-Knowledge Proof) projects. The prover market points to Taiko at the following URLs:</p><p>HTTP: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="http://taiko-a5-prover-simple.zkpool.io/">http://taiko-a5-prover-simple.zkpool.io</a></p><p>HTTPS: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://taiko-a5-prover.zkpool.io/">https://taiko-a5-prover.zkpool.io</a></p><p>This means that any sequencers of Taiko can access ZKPool&apos;s prover resources. Our goal is to open the prover resources to all ZKP projects, which we refer to as ZKP requesters. We plan to release a guide soon on how ZKP requesters can access ZKPool&apos;s prover resources permissionlessly.</p><h2 id="h-2-open-to-provers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">2. Open to Provers</h2><p>On the other side, provers can still join ZKPool permissionlessly. We guarantee that provers can seamlessly join and receive proof rewards in a few minutes. Provers do not need to pay for gas or a bond to join.</p><p>We are also collaborating with other ZKP projects to ensure that provers can achieve high utilization rates and receive more rewards.</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/5e5cd79de453ec474335851b9bb8118e17f4c0c4026ef01f175def281e3e7512.jpg" alt="Two-tier proving tokenomics" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Two-tier proving tokenomics</figcaption></figure><h2 id="h-3-zkpool-ecosystem" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0"><strong>3. ZKPool Ecosystem</strong></h2><p>The diagram below illustrates the ZKPool ecosystem:</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/72cd9228ae5038a128fff11ac5f4951bdff747689429a964f02d35c1d3a0db8e.png" alt="ZKPool Ecosystem" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">ZKPool Ecosystem</figcaption></figure><p>In addition to ZKP requesters and ZKP provers, there is also a role for ZKP accelerators, who can provide accelerated binaries for certain ZKP projects. ZKP requesters and ZKP provers can also act as ZKP accelerators.</p><h2 id="h-4-taiko-a5-dashboard" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">4. Taiko A5 Dashboard</h2><p>Lastly, we have published the Taiko A5 Dashboard, where you can view detailed on-chain status updates of Taiko A5. Visit <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://data.zkpool.io/public/dashboards/tB19TP9i8MicP2MAzQSlB6IQ27M5JKPkUg7HN2Kz">here</a> and enjoy 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/6d6524328065ab4b6a4e8563dcb81b04027e24482db112c79d7e6f342ece1f30.jpg" 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/23fd2f9caf0672120a798191032119a3b82e77525bdda81d22a60da2c733b4fc.jpg" alt="Taiko A5 Dashboard" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Taiko A5 Dashboard</figcaption></figure><h2 id="h-5-conclusion" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">5. Conclusion</h2><p>For more details on ZKPool A1, click <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://docs.zkpool.io/">here</a>.</p><p>ZKPool A1 is just the beginning, and we have a lot more work to do to reach our target of an open and decentralized system to make the zero-knowledge proof flow in the digital world.</p><p>Thank you to all ZKP requesters and ZKP provers for your participation.</p><h2 id="h-follow-us" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0"><strong>Follow us:</strong></h2><p>Get the latest from ZKPool:</p><ul><li><p>Website: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://zkpool.io/">https://zkpool.io/</a></p></li><li><p>Discord: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://t.co/GrX87mUp3Y">discord.gg/PUkc9BhfcT</a></p></li><li><p>GitHub: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/aoraki-labs">https://github.com/aoraki-labs</a></p></li><li><p>Twitter: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://twitter.com/zk_pool">https://twitter.com/zk_pool</a></p></li></ul>]]></content:encoded>
            <author>aoraki-labs@newsletter.paragraph.com (ZKPool)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/699858c4b2d758e31f982ea86b0a87394a98208ea4dceefa0640448d2c50ebd9.png" length="0" type="image/png"/>
        </item>
        <item>
            <title><![CDATA[The Infra Ecosystem of ZK-rollup: Sequencers, ZKPool, Provers, MEV, etc.]]></title>
            <link>https://paragraph.com/@aoraki-labs/the-infra-ecosystem-of-zk-rollup-sequencers-zkpool-provers-mev-etc</link>
            <guid>WoLpuNaHzXtgoFhNSBj2</guid>
            <pubDate>Tue, 19 Sep 2023 04:50:27 GMT</pubDate>
            <description><![CDATA[In the ZK-rollup ecosystem, the infrastructure includes nodes, sequencers, provers, and more. In Ethereum Layer 1, there are validators but no provers. Flashbots can connect MEV searchers with validators.Flashbot architecture (Reference 1)ZK-rollup or Layer 2 (L2) has some differences. It has provers, and each block must be proved and have a proof. Here is a landscape of the ecosystem based on our understanding, using the Taiko project as an example. The Taiko project defines itself as a base...]]></description>
            <content:encoded><![CDATA[<p>In the ZK-rollup ecosystem, the infrastructure includes nodes, sequencers, provers, and more. In Ethereum Layer 1, there are validators but no provers. Flashbots can connect MEV searchers with validators.</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/43248f3ec7f5c7bfa957f7037b419efdb9cf821603f6f812e63a4c97eb58c683.png" alt="Flashbot architecture (Reference 1)" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Flashbot architecture (Reference 1)</figcaption></figure><p>ZK-rollup or Layer 2 (L2) has some differences. It has provers, and each block must be proved and have a proof.</p><p>Here is a landscape of the ecosystem based on our understanding, using the Taiko project as an example. The Taiko project defines itself as a based rollup. The user experience is no different from L1, including using ETH as gas fee.</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/6875ab11a20080e3ad25cd80aae16ea07886016598bb5378d0f4ceafa6a06f65.jpg" alt="Landscape of ZK-rollup infrastructure ecosystem" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Landscape of ZK-rollup infrastructure ecosystem</figcaption></figure><p>In L2, MEV follows a similar flow. MEV searchers can visit the mempool of L2 and extract value. However, for the MEV capturer of L2, it&apos;s not enough to just build a transaction bundle of L2. The transaction proposing an L2 block needs to be guaranteed to be included in an L1 block, or the value of L2 MEV cannot be captured. Therefore, an L2 MEV searcher should also be an L1 MEV searcher. (Reference 2)</p><p>Another difference is that each block needs to be proved. In Taiko&apos;s design, before a block is proposed, it should be bound with a prover. Here, ZKPool plays the role of a prover pool. ZKPool can provide the price of a block, and the sequencer can choose and then the contract in L1 can confirm the assigned prover. Finally, ZKPool captures the event and starts scheduling a prover to do the work.</p><p>To summarize, L2 has an infrastructure ecosystem consisting of MEV searchers, ZKPool, and provers. Within this framework, MEV captures the value and may become the sequencers of L2. Provers contribute proof and get rewards from sequencers. ZKPool collects prover resources and selects the most efficient ones with a favorable performance-price ratio.</p><h2 id="h-references" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">References</h2><ol><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://taiko.mirror.xyz/VjNjFws6OOVez5YCDMwjy4BUiDqZBHYDvcW4-JZGDkc">Taiko MEV article</a></p></li><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://docs.flashbots.net/flashbots-auction/overview">Flashbots introduction</a></p></li></ol>]]></content:encoded>
            <author>aoraki-labs@newsletter.paragraph.com (ZKPool)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/70ea79512b98660bb5e3576e375323e1671323839dfbdb2cd4a25949a6e8bd1e.png" length="0" type="image/png"/>
        </item>
        <item>
            <title><![CDATA[Exploration of ZKP Proving Tokenomics]]></title>
            <link>https://paragraph.com/@aoraki-labs/exploration-of-zkp-proving-tokenomics</link>
            <guid>Xyev8xKeLZnOBYeU0Hte</guid>
            <pubDate>Sat, 09 Sep 2023 15:56:24 GMT</pubDate>
            <description><![CDATA[By Hugo (Twitter: @bluepoint_eth). Special thanks to Brecht and Hao for their feedback and review.TL;DRA two-tier zero-knowledge proof (ZKP) proving tokenomics is proposed, with a shared ZKP prover pool and universal modular prover being critical components of the ZKP ecosystem.ZKP provers represent the next generation of blockchain computation powerThere is a fundamental difference between proof-of-work (PoW) miners and ZKP provers.The design of the ZK-rollup proving tokenomics poses a chall...]]></description>
            <content:encoded><![CDATA[<p><em>By Hugo (Twitter: @bluepoint_eth). Special thanks to Brecht and Hao for their feedback and review.</em></p><h2 id="h-tldr" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">TL;DR</h2><ol><li><p>A two-tier zero-knowledge proof (ZKP) proving tokenomics is proposed, with a shared ZKP prover pool and universal modular prover being critical components of the ZKP ecosystem.</p></li><li><p>ZKP provers represent the next generation of blockchain computation power</p></li><li><p>There is a fundamental difference between proof-of-work (PoW) miners and ZKP provers.</p></li><li><p>The design of the ZK-rollup proving tokenomics poses a challenge known as the “impossible trinity”: balancing performance, cost, and decentralization.</p></li><li><p>An analysis is presented here of several ZKP proving tokenomics, using Taiko’s solutions as an example.</p></li></ol><h2 id="h-1-introduction" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">1. Introduction</h2><p>In recent years, Zero-Knowledge Proof (ZKP) technology has made significant progress. It has become increasingly popular in projects that require computation scaling or privacy preservation.</p><p>ZKP, specifically the SNARK (Succinct Non-interactive Argument of Knowledge) protocol, has gained widespread recognition in Ethereum’s scaling direction. Ethereum’s roadmap includes a target of “Snark Everything,” and Vitalik Buterin has claimed that “zK-SNARKs are going to be as important as blockchain in the next 10 years.”</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/dc7eba0b8206c0d7d40f6d74f9e80661ab4adebff1b19b811f59ebd560b71b99.jpg" alt="Vitalik’s statement about zK-SNARK" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Vitalik’s statement about zK-SNARK</figcaption></figure><p>However, generating a zero-knowledge proof is a much more complex computation than an existing computation.</p><p>For example, in Ethereum, the computation of a block with 10M Gas takes less than 1 second, as shown in the picture below.</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/aa32703abf24b37d0acf3bef903e18ecd119ec7c24744e61e32710dc640940d8.webp" alt="EVM Performance (Reference 1)" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">EVM Performance (Reference 1)</figcaption></figure><p>However, generating a proof for a block in a 128-core CPU for a circuit in ZKEVM may take more than 1700 seconds. Please refer to the benchmark result from the PSE team.</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/d31c868781d81a554ae0b5921a4065c17260c911cb03a771fbea74709e55be37.webp" alt="ZKEVM benchmark (Reference 2)" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">ZKEVM benchmark (Reference 2)</figcaption></figure><p>Even with a GPU, a ZKEVM requires hundreds of seconds to generate a proof. This means that verifying EVM computations with ZKP costs more than 1000 times the original computation.</p><p>There will be huge requirements for ZKP computation power, as there will be many ZKP projects, including L2 projects like zkSync, Scroll, Taiko, Polygon, Linea, and Aztec, as well as L1 projects like Aleo, Mina, and Risc Zero. There will also be other privacy, identity, and gaming-related projects that require ZKP computation power.</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/a45b4bb5549db26e48a15585c13444cb82330f1ea96bdf693668b92c3d1af257.webp" alt="ZKP tech landscape from MESSARI" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">ZKP tech landscape from MESSARI</figcaption></figure><p>Verifiable computation will be as important as computation itself in the future’s digital world, and ZKP acceleration will be the core of the next generation of blockchain’s computation power.</p><h2 id="h-2-zkp-requires-different-tokenomics-with-pow" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">2. ZKP requires different tokenomics with POW</h2><p>Proof of Work (PoW) is an algorithm used for distributed consensus. In PoW systems, participants (miners) must perform computationally intensive work to prove that they have invested a certain amount of computational resources. The goal of these algorithms is to ensure network security. Miners compete to find a hash value that meets specific conditions to gain block rewards and transaction fees.</p><p>However, ZKPs serve very different purposes and have distinct characteristics.</p><p>Here is the comparison between POW miners and ZKP provers.</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/f1ece0cfe30130bb046769aa778ed0818fbe85266d975a15cf028f1baf07474e.webp" alt="Comparison between POW miners and ZKP provers" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Comparison between POW miners and ZKP provers</figcaption></figure><p>Some ZKP projects, like Aleo, still use a POW-like mechanism, but they are not mainstream. Ethereum’s success with POS demonstrates that POW is not the only feasible solution for achieving blockchain decentralization. As a result, more projects might choose a non-POW proving system to decrease energy consumption and overall costs.</p><p>In the ZKP computation paradigm, it is necessary to design not only different provers but also different tokenomics.</p><h2 id="h-3-the-challenge-of-the-impossible-trinity-of-zkp-proving-tokenomics" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">3. The challenge of the impossible trinity of ZKP proving tokenomics</h2><p>In this context, “proving tokenomics” refers to an incentive mechanism for a decentralized ZKP proving system. The three essential metrics for a ZKP proving network are cost, performance, and decentralization. A well-designed proving tokenomics should meet these three requirements.</p><p>First and foremost, cost is a critical factor in a ZKP project, particularly for ZK-rollups. Their mission is to scale Ethereum and reduce users’ transaction costs. The proving cost is a part of the overall cost of ZK-rollups and other ZKP projects. The cost includes both the cost of a single proof and the overall cost of the proving system.</p><p>To provide a better user experience for verifying layer two transactions and achieving finality, high-performance machines are required for ZK provers. GPUs, FPGAs, or ASICs using parallelized computation can help alleviate such bottlenecks. That’s why we use a GPU to prove zkEVM in 10 minutes instead of a CPU, which could take hours.</p><p>Another critical requirement for ZKP provers is decentralization. Decentralization means that many providers can join the proving work without requiring permission, and there is redundancy and geographical dispersion to make the entire system robust and resistant to censorship.</p><p>However, meeting all three aspects in the same design, high performance, low cost, and decentralization is an impossible trinity.</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/3aa7da99a3d84e5e6b1b654a13fb15a36158c55590941be77b5daae8fa26ec00.webp" alt="The impossible trinity of ZKP proving tokenomics" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">The impossible trinity of ZKP proving tokenomics</figcaption></figure><p>Firstly, there is a conflict between cost and performance. If high performance is desired, a high price for the provers, such as GPU, FPGA, or even a cluster of GPU/FPGA, is necessary.</p><p>As the usage of ZKP becomes more prevalent in the long term, there will be a market for millions of ZK provers. At that point, a low-cost ZK ASIC chip can meet both low-cost and high-performance requirements. However, since we are in the early stages of ZKP and have not yet reached such a vast market, the unit cost for a ZK ASIC chip is relatively high. Therefore, achieving both cost-effectiveness and performance remains a challenge at this stage.</p><p>Secondly, decentralization often necessitates the redundancy of provers, resulting in higher costs for the overall proving system.</p><p>For instance, if a ZK-rollup project creates an L2 block in 1 second, and generating proof for it using a high-performance GPU takes about 10 minutes, it would require about 600 provers to fulfill the demand.</p><p><em>n</em>=<em>T_prove</em>​/<em>T_block</em>​</p><p>Here:</p><p><em>n</em> : The number of provers</p><p><em>T_prove</em>​ : Proof generation time for a block</p><p><em>T_block</em>​ : Average block generation period</p><p>If we deploy 600 GPU provers for the ZK-rollup project, the computation capacity will be sufficient to meet its throughput. However, if some provers fail to finish their tasks on time due to network failures or occasional turn-offs, additional provers must generate a proof. Increasing the number of backup provers and decentralization of ZK provers increases the total cost of the proving system. This is also why POW is not popular in ZKP projects.</p><p>Thirdly, vigorously promoting the performance of provers may lead to the domination of the proving network by the fastest prover. This conflicts with the goal of decentralization.</p><p>Establishing a tokenomic system that ensures profitability and liveness for the prover in ZKP systems is a challenging task from an economic perspective. This is the challenge of proving tokenomics.</p><h2 id="h-4-the-evolution-of-zkp-proving-economics" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">4. The evolution of ZKP proving economics</h2><p>Taiko is a decentralized ZK-rollup project that is equivalent to Ethereum, and uses Type 1 zkEVM technology. At the beginning of the Taiko project, there was a focus on designing decentralized sequencers and provers. This is the first ZK-rollup project to promote decentralized sequencers and provers actively.</p><p>Taiko introduces its principle of tokenomic design in its <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/taikoxyz/taiko-mono/blob/main/packages/protocol/docs/tokenomics_objective_metrics.md">documentation</a>, which mentions similar metrics:</p><ol><li><p>Efficient use of proving resources</p></li><li><p>Cheaper proofs over faster proofs</p></li><li><p>Prover redundancy/decentralization</p></li></ol><p>Taiko project has explored various solutions to resolve the impossible trinity of proof ZKP proving tokenomics, and it is still evolving. Here is the history of Taiko Testnet and its proving tokenomics:</p><ol><li><p>Dec 28th, 2022, Alpha-1: Prover is not open.</p></li><li><p>Mar 23rd, 2023, Alpha-2: Provers are permissionless and the fastest provers win, without an economic protocol.</p></li><li><p>Jun 7th, 2023, Alpha-3: Provers are permissionless with a dynamic-reward economic protocol.</p></li><li><p>Jun 2023: The batch auction-based tokenomics were proposed and discussed.</p></li><li><p>Jul 18th, 2023, Alpha-4: Provers are permissionless with staking-based economics.</p></li><li><p>The new proposal is on the way.</p></li></ol><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/73eb2327c0c403df891e5386d303bf9d2fbb45cfa10bf9e56408a8a5a1e452c5.webp" alt="Comparison of different ZKP proving tokenomics" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Comparison of different ZKP proving tokenomics</figcaption></figure><h2 id="h-41-dynamic-reward-proving-tokenomics-taiko-a3" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">4.1 Dynamic-reward proving tokenomics (Taiko A3)</h2><p>The tokenomics of A3 includes a dynamic reward mechanism designed to encourage provers to be low-cost and high-performance. It includes the following rules:</p><ul><li><p>The prover that submits the proof the fastest wins the block.</p></li><li><p>The reward decreases as the prover submits proof faster.</p></li></ul><p>Therefore, once a prover becomes the fastest, its best strategy is to submit proofs just slightly faster than their competitors and wait for a while to obtain a higher reward and keep a more significant profit.</p><p>Next, let’s take a look at some observed phenomena in Taiko A3.</p><p><strong>The gas war</strong></p><p>Currently, the number of active provers is gradually decreasing in A3, indicating a trend towards centralization.</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/b241be514ce22a4a8c3162b55ba69f042e5d534293cdc7c36fd9048fa5c144dc.webp" alt="Daily active provers trend on the A3 Testnet" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Daily active provers trend on the A3 Testnet</figcaption></figure><p>The reason for the above trend is that some high-performance provers can submit their proof in as little as 24 seconds, which is very fast. According to the Ethereum design, if multiple provers submit their proof within the same window, the prover with the higher gas fee will be accepted. In the Sepolia Testnet, gas fees are not in real ETH and are very cheap.</p><p>As a result, there is a gas war among these high-performance provers. They submit proof with very high gas prices, sometimes reaching up to 2000 Gwei. Some provers with very high gas fees dominate the proving tasks.</p><p>Another strategy is to optimize performance by submitting proof in 12 seconds. However, it is difficult to submit all proofs within 12 seconds and doing so results in less reward due to the faster speed according to the A3 design.</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/885dacbba4aacc1ede53f9c5c9f4855be1163c740776f29965f0be925f8ebaac.webp" alt="The prover gas fee trend on the A3 Testnet" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">The prover gas fee trend on the A3 Testnet</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/3fea3917407191ba7d849186aa62b6034ccad05a2e28b11bef15d605e62e20d6.webp" alt="High gas fees on the A3 Testnet" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">High gas fees on the A3 Testnet</figcaption></figure><p><strong>The Computation Competition</strong></p><p>Another phenomenon in A3 is the high number of failed submissions in competitions. This is because, for each block, only one winner is allowed to submit proof, and all other submissions, even if they generate a valid proof, will be rejected.</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/dbe16f912cf5cd6ce0836e33b161cd2b5b74bd675b7fe4d5ff2be320bee581fa.webp" alt="High failure rate (transactions in red boxes) in A3" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">High failure rate (transactions in red boxes) in A3</figcaption></figure><h3 id="h-42-staking-based-proving-tokenomics-taiko-a4" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">4.2 Staking-based proving tokenomics (Taiko A4)</h3><p>In A4, Taiko employs a stake-based proving tokenomics, which provides several advantages:</p><ol><li><p>Excessive computation is eliminated as only one prover is selected to generate a proof. The other provers do not need to work if they are not selected.</p></li><li><p>Encouraging low cost by giving higher weight and high-performance provers cannot guarantee a win.</p></li><li><p>The design is relatively simple compared to an auction-based solution.</p></li></ol><p>Why do we need staking? The reason is that once a prover is selected, it needs to submit proof honestly and on time. A penalty is executed if the selected prover fails to complete this task.</p><p>One crucial phenomenon in A4 is that the ZKP prover has a high probability of being slashed, especially when there is network traffic jam. Here is an example.</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/85d56d2b0f540a2b01aee666ec6723425c66b5308637bd71dacabd5ea1c0c6ef.webp" alt="Slash history the A4 Testnet" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Slash history the A4 Testnet</figcaption></figure><p>Next, we can discuss possible solutions for this issue.</p><h2 id="h-5-further-expected-improvements-in-proving-tokenomics" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">5. Further expected improvements in proving tokenomics</h2><p>Based on our analysis, the expected ZKP proving tokenomics should meet the following requirements:</p><ol><li><p>Each task should have one prover with no wasted computation.</p></li><li><p>Mechanisms should be put in place to prevent a monopoly scenario and promote decentralization.</p></li><li><p>The selected prover should provide a stake and receive a penalty if they fail to generate proof within a specified time window.</p></li><li><p>An incentive mechanism should encourage faster proof submission and lower costs.</p></li><li><p>Provers should be compensated for high gas fees.</p></li><li><p>Proof windows should be extended during traffic jams.</p></li></ol><p>Let’s further expand the discussion.</p><p>This ZKP prover’s staking mechanism is similar to Ethereum’s, as it encourages the validator to be honest. However, there are differences between them.</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/634e1eaa8d0c67ea867b64b3b74e3b35da331b7e1adc88a3e7fd8f8265ecc044.webp" alt="Comparison between Ethereum validator &amp; ZKP prover" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Comparison between Ethereum validator &amp; ZKP prover</figcaption></figure><p>As shown in the table, ZKP provers have higher costs and a higher risk of slashing compared with Ethereum validator. Meanwhile, regarding the reward, the ZKP prover’s only compensation comes from ZKP projects, but it has to cover gas fees, computation costs, and the cost of staking asset.</p><p>Here are some proposals to reduce the slash penalty, considering that ZKP provers need to pay the cost of gas fees and relatively high computation power:</p><ol><li><p>If a prover submits proof within a relatively long window, no penalty should be imposed. This is because others can submit the proof according to the design, and the prover has already incurred gas fees and computation power as costs.</p></li><li><p>If the prover never submits the proof, a lower slash amount should be imposed. In such cases, it may be challenging to differentiate between network/technology issues or dishonesty issues. Thus, a penalty is reasonable, but it should be less severe, as in most cases, the failure might be caused by network traffic jams.</p></li></ol><p>When there is a network traffic jam or very high gas fees, it is challenging for the prover to submit proof, even with reasonable gas fees. Here are some solutions that can be considered:</p><ol><li><p>Extend the proof window when the base fee is high.</p></li><li><p>A more economically rational solution is to increase the reward when the base fee is high.</p></li></ol><p>The staking mechanism brings some fund costs. It is true that there is no formal POS reward, as there is no formal POS mechanism, and we use POS as part of proving tokenomics. However, all the funds have interest costs. Thus, in a staking-based mechanism, the reward amount should be increased to cover staking costs, although it might be included in overall prover rewards.</p><p>In addition, the following improvements would be desirable:</p><ol><li><p>To encourage faster provers, after the prover is selected, their rewards can be increased if they submit proof earlier than the target proof window.</p></li><li><p>Using batch proof for a group of blocks helps reduce the overall gas fee.</p></li></ol><h2 id="h-6-two-tier-zkp-proving-tokenomics" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">6. Two-tier ZKP proving tokenomics</h2><p>Currently, many ZKP projects are using their own proving systems and tokenomics. However, this approach is not beneficial for sharing computation power across ZKP projects, which results in higher costs for the overall ZKP ecosystem.</p><p>As we analyzed in the previous section, ZKP projects require a complex mechanism to manage slash, reward, proof window, and other related aspects.</p><p>Furthermore, there is a high barrier for provers to join various ZKP projects and stake various assets.</p><p>To achieve a healthier and more cost-effective ZKP proving ecosystem, a two-tier proving tokenomics can be a good solution. Taiko proposed a <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/taikoxyz/taiko-mono/pull/14510">solution</a> after several rounds of iteration of proving tokenomics. We have further extended this solution to a two-tier framework.</p><p>Under this approach, each ZKP project operates as tier 1, defining its own tokenomics. However, the selection, scheduling, penalty, reward, and rating of provers are delegated to tier 2, which is a shared prover pool.</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/ec56dcc159147a8816da68b549f772ffd2b68ea6236fbf45daf72f23e232e396.webp" alt="Two-tier proving tokenomics" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Two-tier proving tokenomics</figcaption></figure><p>A prover pool, such as ZKPool, can aggregate the requirements of multiple ZKP projects and assign tasks to provers, enabling them to have a higher utilization rate and earn more profit. Additionally, it reduces the barrier to participation and minimizes the possible penalties.</p><p>To provide the best performance and low-cost provers to ZKP projects, ZKPool can implement a proof market with a standardized rate system to evaluate prover performance and create a competitive mechanism among provers. This system can return the best provers to ZKP projects, and ZKPool can provide extra platform incentives based on the rating system. This approach can significantly benefit ZKP projects and ZKP provers.</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/d444d790a14d35c5fb78010da2cca6266b2946fdda1ea18dd5399bf5babd660f.webp" alt="The scope of two tiers" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">The scope of two tiers</figcaption></figure><p>Here, we also propose a UMP (Universal Modular Prover) conception. A Universal Modular Prover can run on the same hardware platform while supporting the proving work of various ZKP projects.</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/fdfefe6942a468e1843834f39dff121ba78908700917f9d7a4e6f6a72c0f8f2d.webp" alt="Universal Modular Prover" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Universal Modular Prover</figcaption></figure><p>The entire ZKPool will be directed towards decentralization and promoting an economically healthy ZKP ecosystem.</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/1c5d34d072a1001551bd7e54ac169bd72d566fc2071ce9365462bc09ba82208d.webp" alt="ZKPool architecture overview" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">ZKPool architecture overview</figcaption></figure><p>The design principle of ZKPool:</p><ul><li><p>Minimizing cost for ZKP projects while maximizing revenue for provers.</p></li><li><p>Easy: Easy access to ZKP computation power for ZKP projects and easy join for ZKP provers.</p></li><li><p>Transparency: Keep revenue distribution with transparency</p></li></ul><p>The deployment of not only ZKP but also artificial intelligence and space computation will require significant computational power in web3. ZKPool can finally share all computation power across the entire web3, which we can call an acceleration layer for web3.</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/ca9e419b838d0b1317687d8c6aaeb4cd78ebb010edd359a5037690293bb947a8.webp" alt="The acceleration layer" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">The acceleration layer</figcaption></figure><h2 id="h-7-conclusion" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">7. Conclusion</h2><p>Exploring ZKP proving tokenomics has been a long journey. From our research, we have identified cost, performance, and decentralization as key metrics for ZKP proving tokenomics. Implementing a two-tier ZKP proving tokenomics system can benefit the entire system. Additionally, a shared common prover pool is critical in the ZKP ecosystem.</p><p>However, there are still challenges that must be addressed to complete this ecosystem fully. Important work includes building standard inputs for ZKP provers, reducing hardware requirements, and more. These are areas that require our attention and effort.</p><h2 id="h-reference" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Reference</h2><p>1. <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://www.semanticscholar.org/paper/EVM-Perf%3A-High-Precision-EVM-Performance-Analysis-Busse-Eberhardt/f1e7e58eca4802356feca48e1a13a6fdec444288">https://www.semanticscholar.org/paper/EVM-Perf%3A-High-Precision-EVM-Performance-Analysis-Busse-Eberhardt/f1e7e58eca4802356feca48e1a13a6fdec444288</a></p><p>2. <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://grafana.zkevm-testnet.org/d/vofy8DAVz/circuit-benchmarks?orgId=1">https://grafana.zkevm-testnet.org/d/vofy8DAVz/circuit-benchmarks?orgId=1</a></p>]]></content:encoded>
            <author>aoraki-labs@newsletter.paragraph.com (ZKPool)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/6c00bdbdbd0a47334e6eb7da89fcf45a4fe2468ec4e031ac345bff7b37816a30.jpg" length="0" type="image/jpg"/>
        </item>
        <item>
            <title><![CDATA[On the Way to Decentralization - zkSync Era Proving System Research]]></title>
            <link>https://paragraph.com/@aoraki-labs/on-the-way-to-decentralization-zksync-era-proving-system-research</link>
            <guid>a1VFYmSvYxsSBklPoZPu</guid>
            <pubDate>Wed, 17 May 2023 08:52:27 GMT</pubDate>
            <description><![CDATA[How the ZKSync Era Proving System WorksZKPool is dedicated to building the infrastructure for Ethereum zkEVM projects. One important zkEVM project is ZKSync Era. ZKSync Era has published the source code on GitHub. Below is the diagram of how ZKSync Era&apos;s proving system works.Proving System of zkSync EraThe "Metadata calculator" fetches the current blocked numbers and their storage logs, stores the metadata as witness inputs in the Postgres DB, and stores the witness input data as Merkel ...]]></description>
            <content:encoded><![CDATA[<h2 id="h-how-the-zksync-era-proving-system-works" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">How the ZKSync Era Proving System Works</h2><p>ZKPool is dedicated to building the infrastructure for Ethereum zkEVM projects. One important zkEVM project is ZKSync Era.</p><p>ZKSync Era has published the source code on <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/matter-labs/zksync-era">GitHub</a>. Below is the diagram of how ZKSync Era&apos;s proving system works.</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/864c8a76227304ac76dad60ca8888e2be5d844aa878e1ae45109bb3a72e5e35f.png" alt="Proving System of zkSync Era" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Proving System of zkSync Era</figcaption></figure><ol><li><p>The &quot;Metadata calculator&quot; fetches the current blocked numbers and their storage logs, stores the metadata as witness inputs in the Postgres DB, and stores the witness input data as Merkel treepath data in Google Cloud Storage, which are the inputs to the witness generator.</p></li><li><p>The “Witness Generator” component generates prover jobs and stores artifacts needed for the next round of proof aggregation. It can skip blocks if there are too many for the system to handle. This step itself is pretty complex. On closer inspection, there are four steps: Basic Circuits, Leaf Aggregation, Node Aggregation, and Scheduler.</p></li><li><p>The &quot;Circuit Synthesizer&quot; takes the prover jobs from the Postgres DB, synthesizes them into assemblies, and then distributes them to the prover to generate proof. Assembly here is a concept in Bellman Plonk.</p></li><li><p>&quot;Prover&quot; takes the assembly as input via a TCP connection from Circuit Synthesizer, generates the zero-knowledge proof, and stores it in the Postgres DB.</p></li><li><p>&quot;EthTxAggregator&quot; is a standalone program that scans proofs in the Postgres DB and forwards them to the chain.</p></li></ol><h2 id="h-the-path-to-decentralization" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">The path to decentralization</h2><p>From the above flow at a high level, we can see:</p><ol><li><p>The database plays a central role in the system: most components interact with the database.</p></li><li><p>The &quot;Assembly&quot; file sent by the &quot;Circuit Synthesizer&quot; to the prover is large. It contains all the witness data that the proof needs.</p></li><li><p>ZKSync has made many efforts to develop its proof generation system, from GPU groups, well-defined basic circuits, and proof aggregation mechanisms to circuit generation.</p></li></ol><p>We appreciate and look forward to zkSync&apos;s vision for decentralization, especially the ZK-Prover part, as in this Twitter <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://twitter.com/zksync/status/1641450234021838850">post</a>:</p><blockquote><p>Decentralization = Freedom</p></blockquote><blockquote><p>Our vision for decentralization is clear: The sequencer, ZK prover, zkPorter, community governance – and all other critical pieces of the zkSync Era network – will be decentralized once the core virtual machine and prover are solidified and stable.</p></blockquote><h2 id="h-zksync-era-zkpool" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">zkSync Era + ZKPool</h2><p>zkEVM projects need a lot of computational power to generate ZK proofs. ZKPool has a vision to accumulate ZK provers for Ethereum Layer2 zkRollup projects and mainly focuses on an optimized Prover task scheduling system and a Layer 2 fee/reward sharing mechanism. Eventually, the accumulated computing power and competition will reduce the proof cost. Meanwhile, the zkEVM projects achieve the decentralization of prover and high performance of proving.</p><p>ZKPool is looking forward to supporting the decentralization of zkSync Era and also the entire Ethereum Scaling world.</p>]]></content:encoded>
            <author>aoraki-labs@newsletter.paragraph.com (ZKPool)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/48c385c9ae1b2ce9681e19aa717df92a17e2693b8b58c4d80e1fca405ddca74d.png" length="0" type="image/png"/>
        </item>
        <item>
            <title><![CDATA[ZKPool - Connect Application and Accelerator of ZKP]]></title>
            <link>https://paragraph.com/@aoraki-labs/zkpool-connect-application-and-accelerator-of-zkp</link>
            <guid>5ZoNWW4cgAssoTP3w8TV</guid>
            <pubDate>Tue, 04 Apr 2023 00:51:38 GMT</pubDate>
            <description><![CDATA[zkEVM is ComingzkEVM is part of Ethereum zk-Rollup. It&apos;s an EVM-compatible virtual machine that supports generating Zero-Knowledge Proofs (ZKP). Let&apos;s review what happened in the past two weeks:3-22: Taiko Alpha-2 Testnet launched3-24: zkSync Era Mainnet Alpha launched3-27: Polygon zkEVM Mainnet Beta launched3-28: Consensys zkEVM (Linea) Testnet launchedAdditionally, on 2-27, Scroll Alpha Testnet was launched. These projects share the goal of scaling Ethereum with general-purpose zk...]]></description>
            <content:encoded><![CDATA[<h2 id="h-zkevm-is-coming" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">zkEVM is Coming</h2><p>zkEVM is part of Ethereum zk-Rollup. It&apos;s an EVM-compatible virtual machine that supports generating Zero-Knowledge Proofs (ZKP).</p><p>Let&apos;s review what happened in the past two weeks:</p><ul><li><p>3-22: Taiko Alpha-2 Testnet launched</p></li><li><p>3-24: zkSync Era Mainnet Alpha launched</p></li><li><p>3-27: Polygon zkEVM Mainnet Beta launched</p></li><li><p>3-28: Consensys zkEVM (Linea) Testnet launched</p></li></ul><p>Additionally, on 2-27, Scroll Alpha Testnet was launched.</p><p>These projects share the goal of scaling Ethereum with general-purpose zk-Rollup based on zkEVM technology.</p><h2 id="h-zk-prover-progress" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">zk Prover Progress</h2><p>Proof generation is required in zkEVM, and it can be time-consuming. Optimizing algorithms, GPU acceleration, or the design of FPGA/ASICs are needed to speed up the process. The machines that run zkEVM and generate proofs are called zk provers.</p><p>Below is a <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="">zkEVM diagram</a>.</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/71561a3b2a6f845225d16f1332733438fd84899cd7d98bc9229adbd70cf666c8.png" alt="A diagram showing how the zkEVM generates validity proofs for programs" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">A diagram showing how the zkEVM generates validity proofs for programs</figcaption></figure><p>zk Provers play a crucial role in the success of zk-Rollup projects.</p><p>Let&apos;s review the latest zk prover status in these zk-Rollup projects.</p><h3 id="h-scroll" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Scroll</h3><ul><li><p>Testnet Alpha is live.</p></li><li><p>The ZK proof system is halo2/plonk based and is customized based on the PSE team’s solution of the Ethereum Foundation.</p></li><li><p>The user can&apos;t join as a prover yet.</p></li><li><p>It had planned to open source GPU-based prover before the Mainnet, and other users can join permissionlessly.</p></li><li><p>Github: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/scroll-tech/scroll-zkevm/">https://github.com/scroll-tech/scroll-zkevm/</a></p></li></ul><h3 id="h-taiko" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Taiko</h3><ul><li><p>Testnet Alpha 2 is live.</p></li><li><p>The ZKP system is halo2/plonk based and is customized based on the PSE team’s solution of the Ethereum Foundation.</p></li><li><p>It supports running a permissionless prover for an example circuit with the entire proof generation and verification flow. And it targets decentralized sequencers and provers.</p></li><li><p>Github: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/taikoxyz/zkevm-circuits">https://github.com/taikoxyz/zkevm-circuits</a></p></li></ul><h3 id="h-zksync-era" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">zkSync Era</h3><ul><li><p>Mainnet Alpha is live.</p></li><li><p>The ZKP system is plonk based.</p></li><li><p>Centralized sequencers and provers right now, while zkSync has the vision to have decentralized sequencers, provers, and so on.</p></li><li><p>Its current internal prover uses GPU to accelerate, which was rewarded in ZPrize 2022.</p></li><li><p>Github: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/matter-labs/era-heavy-ops-service">https://github.com/matter-labs/era-heavy-ops-service</a></p></li></ul><h3 id="h-polygon-zkevm" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Polygon zkEVM</h3><ul><li><p>Mainnet beta is live.</p></li><li><p>The ZKP system is STARK &amp; SNARK based.</p></li><li><p>It runs with a trusted prover internally.</p></li><li><p>Github: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/0xPolygonHermez/zkevm-prover">https://github.com/0xPolygonHermez/zkevm-prover</a></p></li></ul><h3 id="h-consensys-linea" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">Consensys Linea</h3><ul><li><p>Testnet is live</p></li><li><p>The ZKP system uses an innovative lattice-based prover.</p></li><li><p>Its prover is not open to users yet.</p></li><li><p>Github: <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/ConsenSys/gnark">https://github.com/ConsenSys/gnark</a></p></li></ul><h2 id="h-challenges-of-zk-prover" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">Challenges of zk Prover</h2><p>As we can see, zk provers provide computation power, but some key differences with POW miners bring challenges for the zk-Rollup Ecosystem.</p><p>One challenge is balancing the trade-off between hardware costs and proof generation speed. While faster hardware can generate proofs faster, it can also be costly. Thus, projects need to find a balance to ensure the economic feasibility of the solution.</p><p>The second challenge is to incentivize provers to generate proofs. In zk-Rollup, provers are required to generate proofs for batches of transactions, which requires significant costs. To incentivize provers, zk projects must design an economic mechanism that rewards them.</p><p>For zk provers, there are the following challenges:</p><ol><li><p>Layer 2 projects may have different algorithms that are still being improved.</p></li><li><p>Currently, zk proving is still a long-tail market.</p></li><li><p>There is also a risk of losing money if they have to pay transaction fees.</p></li></ol><h2 id="h-zkpools-mission" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">ZKPool’s Mission</h2><p>To address these challenges, a specialized miner pool for zk provers could be beneficial. This would:</p><ol><li><p>Aggregate the computing power of zk provers to meet the needs of zk projects;</p></li><li><p>Reduce the risk of provers losing money;</p></li><li><p>Lowering the barrier to entry for provers.</p></li></ol><p>Aoraki Labs, founded in 2022, has recently announced its project <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="http://www.zkpool.io">ZKPool</a>, aiming to become the best ZKP infrastructure that connects applications and accelerators, promoting the development of the whole zk-Rollup and helping the Ethereum ecosystem.</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/d64bea374fc823f0c012f4d676ad6b9ed388943d44ae68ad67f23223bda41197.png" alt="ZKPool: Connect Applications to Accelerators of Zero-Knowledge Proof" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">ZKPool: Connect Applications to Accelerators of Zero-Knowledge Proof</figcaption></figure><p>To achieve this goal, ZKPool will provide a platform for developers to access a pool of optimized accelerators for proof generation. This will allow developers to focus on designing and deploying their applications without worrying about the cost and complexity of proof generation.</p><p>In addition to providing a pool of accelerators, ZKPool will also optimize the schedule of these accelerators, ensuring that they are used efficiently.</p><p>Finally, the ZKPool will pay the transaction fees and share rewards with the provers, reducing the financial risk of the provers.</p><p>Overall, ZKPool aims to become the go-to infrastructure for zk-Rollup, especially the aggregation of ZKP computation power.</p><p>Currently, we are working with zk-Rollup projects like Taiko (See the <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="http://taiko.zkpool.io">Dashboard of Taiko</a>) and Scroll and some other ZKP projects like Aleo.</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/3f4ad943fb022bb4bca35d26b70453f55523a976b9939e09d179b11514e4e8e1.jpg" alt="Taiko Testnet Dashboard" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="">Taiko Testnet Dashboard</figcaption></figure><p>We look forward to cooperating with more partners and promoting the development of the ZKP Ecosystem.</p>]]></content:encoded>
            <author>aoraki-labs@newsletter.paragraph.com (ZKPool)</author>
            <enclosure url="https://img.paragraph.com/cdn-cgi/image/format=auto/https://storage.googleapis.com/papyrus_images/e02801b2107bcaedbb9fc8b0b82d2fb11686d7a3950f49680e168cc45b73df68.png" length="0" type="image/png"/>
        </item>
    </channel>
</rss>