Explore >> Select a destination


You are here

blog.lambdaclass.com
| | vitalik.eth.limo
3.4 parsecs away

Travel
| | [AI summary] An accessible technical introduction explaining how zk-SNARKs use polynomials, finite fields, and polynomial commitments to create succinct and private zero-knowledge proofs.
| | zkplabs.network
3.7 parsecs away

Travel
| | Sangria, an innovative folding scheme for the PLONK arithmetization, represents a significant advancement in the field of incrementally verifiable computation (IVC).
| | blog.trailofbits.com
4.5 parsecs away

Travel
| |
| | www.jeremykun.com
36.1 parsecs away

Travel
| Last time we defined and gave some examples of rings. Recapping, a ring is a special kind of group with an additional multiplication operation that "plays nicely" with addition. The important thing to remember is that a ring is intended to remind us arithmetic with integers (though not too much: multiplication in a ring need not be commutative). We proved some basic properties, like zero being unique and negation being well-behaved.