/explore
|
You are here 
|
blog.lambdaclass.com | ||
| | | | |
ajcr.github.io
Haphazard investigations |
|
| | | | | ||
| | | | |
vitalik.eth.limo
[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. |
|
| | | | | ||
| | | | |
www.rareskills.io
This article is explains how to turn a set of arithmetic constraints into Rank One Constraint System (R1CS). |
|
| | | | | ||
| | | | |
dusty.phillips.codes
The venerable RSA public key encryption algorithm is very elegant. It requires a basic understanding of modular arithmetic, which may sound scary if you havent studied it. It reduces to taking the remainder after integer long division. The RSA Wikipedia article describes five simple steps to generate the keys. Encryption and decryption are a matter of basic exponentiation. Theres no advanced math, and its easy to understand their example of working with small numbers. |
|
| | | |||
