Regex is how we give structure to text. zk‑regex v2 gives structure to privacy. Full breakdown (with diagrams and technical details):. We’re excited to see how you use it!.

v2 is a complete re-imagination over the v1. It’s about a shift in how we treat verifiable structure within deterministic circuits. Instead of hardcoding logic into circuits, we compile once, match anywhere, and prove selectively. This architecture makes zk‑regex modular and.

Join millions who have switched to Grok.

Some real-world use cases:. 🔒 Prove your email ends in @university.edu - without revealing the full address.🧾 Show a receipt includes a vendor name - without exposing the item or price.📍 Prove a credential includes a country code - without disclosing the full string.🧠 Enforce.

The result:. ⚡ Matching is fast and flexible.♻️ Circuits are compact.🔍 Substring capture is native (via marked transitions).🧠 You can support richer patterns: Unicode, nesting, negation. And most importantly:.You prove just enough - and nothing more.

This design shift is powered by the use of NFAs (Non-Deterministic Finite Automatons) which are much leaner and flexible as compared to DFAs. And since the matching happens off-circuit, we can take advantage of the smaller traces which the NFAs provide us. But we can't use the.

v2 takes a different approach. We move regex matching outside the circuit, which generates a trace that the input string matches the regex. The circuit only verifies that the trace is valid. The match logic? Offloaded to a regex engine. The circuit? Slim and purpose-built.

In zk‑regex v1, we turned regex patterns into a Deterministic Finite Automaton (DFA) and embedded it directly in the circuit. The regex was broken into parts with public and private parts and then stitched together to have clear boundaries between public parts. With the

You’ve been diagnosed with a rare condition. To get treatment abroad, your insurer needs proof, but you don’t want to hand over your entire medical history. With zk‑regex, you can parse your medical report and generate a proof that only confirms that specific diagnosis without

RT @hyli_org: Big news! We're thrilled to introduce our 𝐓𝐞𝐜𝐡𝐧𝐢𝐜𝐚𝐥 𝐀𝐝𝐯𝐢𝐬𝐨𝐫𝐲 𝐁𝐨𝐚𝐫𝐝. These people are the daring architects of a decentralize….

RT @pranshurastogii: Ever wished your Gmail "confirmation" button could flip a switch onchain?. @zkemail makes any inbox proof‑grade: passw….

RT @hebbianloop: Is it normal to get this excited about a PR? Soon ZK email proofs on @HumnPassport

RT @prakharxsingh: So, what's inside the box? . 🤫Sneak peak inside our new documentation graphics @zkemail

RT @OpenZeppelin: 🗣️ Community Contracts additions. Along with this release, the community version of the OpenZeppelin Solidity Contracts i….

If you’re working on account abstraction, decentralized identity, or secure communication infra, ERC‑7969 may be useful. Discussion: Spec:

ERC‑7969 supports use cases like:.– Email-based wallet recovery.– Proof of email ownership (ZK identity).– Decentralized login flows.– Cross-chain email verification.

The goal is to support both:.– Live DNS lookups (normal case).– Fallback verification using cached keys or alternate sources (email headers, IPFS, etc.). This enables more resilient, decentralized email verification.

ERC‑7969 introduces a standard interface for onchain DKIM Registries. It allows contracts to check whether a given public key hash is trusted for a domain, even in the absence of live DNS resolution.

DKIM (DomainKeys Identified Mail) is how email clients verify an email was sent from a specific domain and has not been tampered with. But smart contracts can't reliably verify DKIM signatures onchain, especially when DNS fails or is inaccessible.

Email remains the most widely used identity layer online, but verifying it onchain requires better infrastructure. 👨‍💻 We're working with @okx and @OpenZeppelin on a new Ethereum.standard for DKIM Registries to address that: ERC‑7969. Wanna know what this means?👇.

We will do a quick live demo today! Join us 🚀.