Marvy

Happy Monday, back to studying ZK and staying locked in.

Day 51/100 of ZK 🔐 Today we introduced lookup arguments, one of the most practical efficiency improvements in modern zero-knowledge systems. The Problem They Solve In pure arithmetic circuits (R1CS or basic Plonkish), many common operations become expensive. Range checks (proving a value lies between 0 and 2^n − 1) and table lookups (proving a value appears in a pre-defined table) normally require a large number of constraints. For example, a 32-bit range check can cost dozens or hundreds of constraints if done naively with bit decomposition. Lookup arguments solve this by letting the prover prove that a set of values appears in a public table with far fewer constraints. Core Idea The prover has a list of values that should all belong to some table T. Instead of constraining each value individually, the prover shows that the multiset of looked-up values is consistent with the table. A common approach (popularized by Plookup and later improved by Lasso and others) works roughly as follows: The prover commits to the values that need to be looked up. A random challenge is used to form a polynomial or running product that accumulates both the looked-up values and the table entries. The verifier checks that the accumulated polynomial satisfies an algebraic identity proving the multisets match. Because the check is done globally with polynomials rather than per-value constraints, the cost grows much more slowly than the number of lookups. Why This Matters Lookup arguments dramatically reduce the size of circuits that need range checks, bitwise operations, or access to large tables (for example, S-boxes in hash functions or model weights in ZKML). Modern SNARK systems (including many PLONK variants) therefore treat lookups as a first-class primitive.

Every one showcasing their Web games. Here is mine @Playvalorhq A FPS game that rewards you G$ for playing. You also get the chance to play with your friends. And to top it all you can stake G$ when you get challenged by a friend and the winner takes all Check it out here playvalor.app/

Happy new month

It’s about to be that time of the year.

Good morning.☀️ Monday is here, and I’m already looking forward to what we’ll make of this week. Building in Web3 has a way of keeping you on your toes. One minute, you’re deep in product decisions; the next, you’re thinking about what comes next and how much further you can take the vision. Between Valor and BitYield, there’s a lot I’m excited about, and I’m looking forward to seeing how the pieces come together. New week, new conversations, more building, and hopefully a few wins worth celebrating. What’s everyone building or working towards this week?