<?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>brandy?</title>
        <link>https://paragraph.com/@brandy</link>
        <description>undefined</description>
        <lastBuildDate>Fri, 17 Apr 2026 05:10:08 GMT</lastBuildDate>
        <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
        <generator>https://github.com/jpmonette/feed</generator>
        <language>en</language>
        <image>
            <title>brandy?</title>
            <url>https://storage.googleapis.com/papyrus_images/b7894bb1ac5cd8a310f48a0caeef93d926c8103e0379644d1cf5e80a816801b7.jpg</url>
            <link>https://paragraph.com/@brandy</link>
        </image>
        <copyright>All rights reserved</copyright>
        <item>
            <title><![CDATA[Fully Homomorphic Encryption Is Quietly Rewriting Web3’s Future]]></title>
            <link>https://paragraph.com/@brandy/fully-homomorphic-encryption-is-quietly-rewriting-web3-s-future</link>
            <guid>hJtJhkWJxCaovydk2wC5</guid>
            <pubDate>Thu, 10 Jul 2025 16:40:15 GMT</pubDate>
            <description><![CDATA[…Zama may be the team accelerating itWhile much of the crypto space remains captivated by zero-knowledge proofs, restaking layers, and modular execution stacks, a lesser-known cryptographic breakthrough is maturing under the radar: Fully Homomorphic Encryption (FHE). Unlike ZK, which focuses on proving correctness without revealing data, FHE enables something more radical: computing directly on encrypted data, without ever decrypting it. It sounds like magic — and for decades, it was. First p...]]></description>
            <content:encoded><![CDATA[<h2 id="h-zama-may-be-the-team-accelerating-it" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">…Zama may be the team accelerating it</h2><p>While much of the crypto space remains captivated by zero-knowledge proofs, restaking layers, and modular execution stacks, a lesser-known cryptographic breakthrough is maturing under the radar:</p><p><strong>Fully Homomorphic Encryption (FHE).</strong></p><p>Unlike ZK, which focuses on proving correctness without revealing data, FHE enables something more radical: <strong>computing directly on encrypted data</strong>, without ever decrypting it.</p><p>It sounds like magic — and for decades, it was. First proposed in 1978, with a working prototype only surfacing in 2009, FHE has long existed in the realm of theoretical computer science and whitepapers. For good reason: the early versions were impossibly slow, millions of times less efficient than plain computation.</p><p>Today, that’s no longer true.</p><p>Thanks to new mathematical techniques, hardware acceleration, and deep research (often open-sourced), FHE is becoming practical — fast enough for targeted real-world use cases. And one team, in particular, is betting big on its relevance to the crypto world: <strong>Zama (</strong><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://x.com/zama_fhe"><strong>X/Twitter</strong></a><strong>)</strong>.</p><h2 id="h-why-web3-needs-more-than-zk" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">🔍 Why Web3 Needs More Than ZK</h2><figure float="none" data-type="figure" class="img-center" style="max-width: null;"><img src="https://storage.googleapis.com/papyrus_images/6456d0d7d284c30c2286fbe90ffaceaada97feb37b9c0b454f8ebff5c984411f.png" alt="" blurdataurl="data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=" nextheight="600" nextwidth="800" class="image-node embed"><figcaption HTMLAttributes="[object Object]" class="hide-figcaption"></figcaption></figure><p>Let’s begin with a simple mental model:</p><ul><li><p><strong>Zero-Knowledge Proofs</strong> are about <em>proving</em> something without revealing the input.</p></li><li><p><strong>FHE</strong> is about <em>doing</em> something without ever revealing the input.</p></li></ul><p>ZK systems are brilliant at <strong>verifying</strong>: proving that a transaction is valid, a credential exists, or a computation was performed correctly. This makes them ideal for applications like:</p><ul><li><p>zkRollups (proof of correct state transition)</p></li><li><p>anonymous payments (e.g., Tornado Cash, Aztec)</p></li><li><p>selective identity disclosures (e.g., Sismo, Veramo)</p></li></ul><p>But ZK falls short when it comes to <strong>processing private data inside a contract</strong>. For example:</p><ul><li><p>You can prove that a vote was cast correctly — but the contract can&apos;t tally encrypted votes.</p></li><li><p>You can prove you own a certain amount of tokens — but a contract can&apos;t compute interest on a secret balance.</p></li><li><p>You can hide input data — but not <em>act</em> on it dynamically inside the chain.</p></li></ul><p>That’s where FHE fundamentally differs. It allows contracts to <strong>operate on encrypted inputs</strong>, perform logical or mathematical operations, and return encrypted outputs — <strong>without ever accessing the raw values.</strong></p><p>In a world where blockchains are becoming execution engines for increasingly sensitive applications — voting, identity, finance, AI — this is not just useful. It’s inevitable.</p><h2 id="h-zamas-architecture-building-the-fhe-stack-for-developers" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">🧱 Zama’s Architecture: Building the FHE Stack for Developers</h2><p>Zama’s strategy is twofold: build core cryptographic infrastructure, and package it for mainstream developer usability.</p><ol><li><p>TFHE-rs: The Core Zama&apos;s main FHE library is <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/zama-ai/tfhe-rs">TFHE-rs</a>, a high-performance Rust implementation of the TFHE (Torus Fully Homomorphic Encryption) scheme. It supports boolean and integer operations on encrypted values, with tunable security parameters and multithreading support.</p></li></ol><p>It’s designed to be modular and embeddable — usable in both server-side apps and on-chain environments.</p><ol><li><p><a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/zama-ai/fhevm">fhEVM</a>: The Application Layer To bridge into smart contract development, Zama introduced fhEVM — a version of the Ethereum Virtual Machine that supports FHE natively.</p></li></ol><p>The genius here is backward compatibility: developers can write Solidity-style smart contracts, use familiar tools like Hardhat, but work with encrypted inputs and outputs.</p><p>Here’s what this unlocks:</p><ul><li><p><code>add(uint256 a, uint256 b)</code> becomes <code>eadd(Encrypted a, Encrypted b)</code></p></li><li><p>Logic runs inside the encrypted domain</p></li><li><p>Result stays encrypted — no one (not even validators) sees intermediate values</p></li></ul><p>This system works today on a public devnet. It’s not a whitepaper — it’s live infrastructure.</p><h2 id="h-technical-tradeoffs-fhes-strengths-and-current-limitations" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">🧠 Technical Tradeoffs: FHE’s Strengths and Current Limitations</h2><p>FHE is powerful, but it’s not magic. It introduces unique tradeoffs that developers, investors, and protocol architects should understand.</p><h3 id="h-strengths" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">✅ Strengths:</h3><ul><li><p><strong>True End-to-End Privacy:</strong> No need to trust off-chain relayers or ZK circuits.</p></li><li><p><strong>Encrypted Computation:</strong> Allows logic to run <em>inside</em> the data, not just around it.</p></li><li><p><strong>Composable Privacy:</strong> Can be layered into existing EVM flows with relatively minor overhead.</p></li><li><p><strong>Policy Alignment:</strong> Offers stronger compliance potential (privacy-preserving + auditable).</p></li></ul><h3 id="h-limitations-as-of-mid-2025" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">⚠️ Limitations (as of mid-2025):</h3><ul><li><p><strong>Performance Overhead:</strong> Still slower than plaintext or ZK circuits, though narrowing.</p></li><li><p><strong>Tooling Immaturity:</strong> Ecosystem is early; debugging and dev UX still evolving.</p></li><li><p><strong>Non-determinism:</strong> Some operations may have random noise, which complicates reproducibility.</p></li><li><p><strong>Limited Browser Support:</strong> WebAssembly integration for FHE is experimental.</p></li></ul><p>Zama is actively addressing these, but it’s worth understanding that FHE is not yet “plug-and-play” for all use cases.</p><h2 id="h-competitive-landscape-zamas-position" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">📊 Competitive Landscape: Zama’s Position</h2><p>Zama is arguably the most advanced FHE player focused specifically on blockchain applications. But they’re not alone.</p><ul><li><p><strong>Duality</strong> (ex-DARPA researchers): Working on FHE + secure multi-party computation (MPC) hybrids.</p></li><li><p><strong>Inpher</strong>: Focusing on FHE for enterprise AI and secure analytics.</p></li><li><p><strong>IBM &amp; Microsoft Research</strong>: Academic-grade FHE research, less crypto-native.</p></li></ul><p>What sets Zama apart is its combination of:</p><ul><li><p>Deep cryptographic research (co-founders include world-class researchers in lattice cryptography)</p></li><li><p>A clear product roadmap aligned with crypto (fhEVM, open-source toolkits)</p></li><li><p>An open developer-first approach (GitHub, Discord, permissive licenses)</p></li></ul><p>In short: while others are researching, Zama is shipping.</p><h2 id="h-real-use-cases-what-fhe-enables-that-nothing-else-can" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">🧪 Real Use Cases: What FHE Enables That Nothing Else Can</h2><p>Let’s move from theory to application.</p><p>The most exciting promise of FHE is not that it can replicate what ZK already does, but that it unlocks <strong>entirely new use cases</strong> that were previously impossible on-chain — or required awkward off-chain workarounds.</p><p>Here are a few clear categories:</p><h3 id="h-1-encrypted-voting-with-public-tallying" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">🗳️ 1. Encrypted Voting (with Public Tallying)</h3><ul><li><p>Voters submit encrypted ballots.</p></li><li><p>Smart contracts compute the result inside the encrypted domain.</p></li><li><p>Final tally is revealed <strong>without exposing any individual vote</strong>.</p></li></ul><p>Contrast this with typical DAO voting: everything is public, and bribery/coercion are trivial. FHE enables <em>coercion-resistant, anonymous voting</em> with full on-chain transparency of final results.</p><h3 id="h-2-confidential-financial-logic" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">💼 2. Confidential Financial Logic</h3><p>Imagine a lending protocol that computes <strong>interest, LTV ratios, or risk scores</strong> on encrypted balances.Or a DeFi fund that calculates <strong>portfolio NAV</strong> without exposing holdings.</p><ul><li><p>No need to move logic off-chain.</p></li><li><p>No need to trust SGX, MPC, or private servers.</p></li><li><p>The math runs directly inside the chain — privately.</p></li></ul><p>This is not a ZK problem. It&apos;s a <strong>data confidentiality</strong> problem — and FHE solves it natively.</p><h3 id="h-3-ai-crypto-private-inference-on-chain" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">🧠 3. AI + Crypto: Private Inference On-Chain</h3><p>As LLMs and generative models increasingly enter the blockchain world (e.g. for reputation, prediction, or content scoring), a key issue arises:</p><blockquote><p><em>How do we run AI inference privately?</em></p></blockquote><p>With FHE, it becomes possible to run <strong>parts of an ML model inference over encrypted user data</strong>, directly on-chain, without leaking:</p><ul><li><p>Prompt contents</p></li><li><p>User identity</p></li><li><p>Inference outputs</p></li></ul><p>This opens the door for use cases like private decentralized recommendation engines, reputation models, and even crypto-native copilot agents.</p><h3 id="h-4-identity-and-credentials" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">🆔 4. Identity and Credentials</h3><p>Selective disclosure is often handled via ZK — and that works well. But sometimes the smart contract itself needs to <strong>react</strong> to private credentials:</p><ul><li><p>e.g. “This user is over 18”</p></li><li><p>or “This user holds a certain off-chain certificate”</p></li></ul><p>Instead of proving it off-chain and trusting middleware, the encrypted data can be passed to a smart contract, which evaluates the rule <strong>inside the encrypted domain</strong>, without ever learning the value.</p><p>This turns identity into a <strong>computation primitive</strong>, not just a proof.</p><h2 id="h-strategic-implications-for-the-next-generation-of-protocols" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">🧭 Strategic Implications for the Next Generation of Protocols</h2><p>FHE doesn’t compete with L2s, ZK stacks, or modular chains. Instead, it <strong>complements</strong> and enhances them — potentially becoming a base-layer capability like storage or state execution.</p><p>Here’s how different parts of the ecosystem may evolve with FHE:</p><h3 id="h-rollups-and-appchains" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">📦 Rollups &amp; Appchains</h3><ul><li><p>FHE can be integrated into rollups to offer <strong>native private compute</strong></p></li><li><p>Ideal for governance-heavy, AI-integrated, or identity-based appchains</p></li><li><p>Enables differentiation for rollups beyond throughput/scalability</p></li></ul><h3 id="h-modular-privacy-layers" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">🔐 Modular Privacy Layers</h3><ul><li><p>FHE-based modules (like Zama’s fhEVM) could become plug-ins for any chain</p></li><li><p>Similar to how Celestia provides modular DA — Zama could offer modular privacy</p></li><li><p>Composable with ZK-based integrity proofs</p></li></ul><h3 id="h-institutions-and-regulated-protocols" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">🏛 Institutions &amp; Regulated Protocols</h3><ul><li><p>FHE satisfies <strong>privacy and auditability</strong> — a rare combination</p></li><li><p>Attractive for RWAs (real-world assets), private capital markets, CBDCs</p></li><li><p>Reduces the need for confidential computing hardware (like SGX)</p></li></ul><h3 id="h-depin-and-iot-use-cases" class="text-2xl font-header !mt-6 !mb-4 first:!mt-0 first:!mb-0">🌐 DePIN &amp; IoT Use Cases</h3><ul><li><p>Encrypted sensor data can be computed on-chain without exposing raw inputs</p></li><li><p>Ideal for DePIN (Decentralized Physical Infrastructure) where privacy is critical</p></li><li><p>Useful in health, energy, transport, and edge devices</p></li></ul><h2 id="h-risks-open-questions-and-long-term-unknowns" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">⚖️ Risks, Open Questions, and Long-Term Unknowns</h2><p>No technology comes without risk. FHE is no exception.</p><p>Some of the key areas to watch:</p><ul><li><p><strong>Developer Experience:</strong> Will smart contract developers adopt encrypted logic, or will the complexity be too high?</p></li><li><p><strong>Performance:</strong> Will performance continue improving fast enough to support real-time use cases?</p></li><li><p><strong>Security Model:</strong> FHE introduces new attack surfaces (side-channel leakage, parameter selection). Formal verification tools for FHE are still young.</p></li><li><p><strong>Ecosystem Buy-In:</strong> ZK benefited from years of research, grants, and L1 funding. FHE is newer — and needs similar investment to scale.</p></li></ul><p>That said, these are the same questions people asked about ZK in 2017. The difference now is: <strong>FHE is catching up fast.</strong></p><h2 id="h-final-thought-a-quiet-revolution-is-still-a-revolution" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0">🧩 Final Thought: A Quiet Revolution Is Still a Revolution</h2><p>Most revolutions in crypto are loud. New consensus algorithms. New L1s. Multi-billion dollar airdrops. FHE is none of those things. It’s quiet. Academic. Understated. But its impact could be far more foundational.</p><p>If smart contracts remain public-by-default, Web3 will always be constrained — unable to serve real users, institutions, or privacy-critical applications. FHE changes the trust model. It allows computation <strong>without exposure</strong>. And teams like <strong>Zama</strong> are proving it’s not just possible — it’s practical.</p><p>For builders looking beyond hype cycles, and investors with a 5–10 year view, the message is simple:</p><blockquote><p><em>Don’t wait for the noise. Pay attention to the silence.That’s where the next real breakthroughs begin.</em></p></blockquote><h2 id="h-resources-and-links" class="text-3xl font-header !mt-8 !mb-4 first:!mt-0 first:!mb-0"><strong>Resources &amp; Links</strong></h2><ul><li><p>🔗 <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/zama-ai">Zama GitHub</a></p></li><li><p>🔗 <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://github.com/zama-ai/fhevm">fhEVM</a></p></li><li><p>🔗 <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://docs.zama.ai/homepage/">Zama Docs</a></p></li><li><p>🔗 <a target="_blank" rel="noopener noreferrer nofollow ugc" class="dont-break-out" href="https://discord.gg/zama">Join Zama Discord</a></p></li></ul>]]></content:encoded>
            <author>brandy@newsletter.paragraph.com (brandy?)</author>
            <enclosure url="https://storage.googleapis.com/papyrus_images/c6240802e09d550057bb872776f0336f49c3cd8bab65753a556be6faa6d8c3eb.png" length="0" type="image/png"/>
        </item>
        <item>
            <title><![CDATA[yuyuyuy]]></title>
            <link>https://paragraph.com/@brandy/yuyuyuy</link>
            <guid>qfSqZBBwRDG0uCQbI0Ff</guid>
            <pubDate>Fri, 12 Jan 2024 13:26:41 GMT</pubDate>
            <description><![CDATA[yuyuyuyu]]></description>
            <content:encoded><![CDATA[<p>yuyuyuyu</p>]]></content:encoded>
            <author>brandy@newsletter.paragraph.com (brandy?)</author>
        </item>
        <item>
            <title><![CDATA[rytr]]></title>
            <link>https://paragraph.com/@brandy/rytr</link>
            <guid>sJaefSiMdoKJHX1rQvui</guid>
            <pubDate>Fri, 12 Jan 2024 13:26:38 GMT</pubDate>
            <description><![CDATA[bob]]></description>
            <content:encoded><![CDATA[<p>bob</p>]]></content:encoded>
            <author>brandy@newsletter.paragraph.com (brandy?)</author>
        </item>
        <item>
            <title><![CDATA[cea]]></title>
            <link>https://paragraph.com/@brandy/cea</link>
            <guid>eRkNY1nicfWNzDTqz7w8</guid>
            <pubDate>Fri, 12 Jan 2024 13:26:35 GMT</pubDate>
            <description><![CDATA[cer]]></description>
            <content:encoded><![CDATA[<p>cer</p>]]></content:encoded>
            <author>brandy@newsletter.paragraph.com (brandy?)</author>
        </item>
        <item>
            <title><![CDATA[geg]]></title>
            <link>https://paragraph.com/@brandy/geg</link>
            <guid>fUDNMYidLCr3qCfGkiPr</guid>
            <pubDate>Fri, 12 Jan 2024 13:26:33 GMT</pubDate>
            <description><![CDATA[geg]]></description>
            <content:encoded><![CDATA[<p>geg</p>]]></content:encoded>
            <author>brandy@newsletter.paragraph.com (brandy?)</author>
        </item>
        <item>
            <title><![CDATA[mind]]></title>
            <link>https://paragraph.com/@brandy/mind</link>
            <guid>YmOA1kd6bwSdgGS7eqro</guid>
            <pubDate>Fri, 12 Jan 2024 13:23:29 GMT</pubDate>
            <description><![CDATA[my mind]]></description>
            <content:encoded><![CDATA[<p>my mind</p>]]></content:encoded>
            <author>brandy@newsletter.paragraph.com (brandy?)</author>
        </item>
        <item>
            <title><![CDATA[ayo]]></title>
            <link>https://paragraph.com/@brandy/ayo</link>
            <guid>xuaYvElcaEnSAeVLUwM7</guid>
            <pubDate>Wed, 10 Jan 2024 17:34:27 GMT</pubDate>
            <description><![CDATA[111]]></description>
            <content:encoded><![CDATA[<p>111</p>]]></content:encoded>
            <author>brandy@newsletter.paragraph.com (brandy?)</author>
        </item>
    </channel>
</rss>