Explore >> Select a destination
|
You are here 
|
www.rareskills.io | ||
| | | | |
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. | |
| | | | |
andrea.corbellini.name
|
|
| | | | | [AI summary] A technical blog post explaining elliptic curves over finite fields, covering modular arithmetic, point addition algorithms, cyclic subgroups, and the discrete logarithm problem in the context of cryptography. | |
| | | | |
blog.lambdaclass.com
|
|
| | | | | Introduction The use of efficient zk-SNARKs (zero-knowledge succinct non-interactive arguments of knowledge) has given rise to many new and vital applications. For example, we can delegate expensive computations to untrusted servers and receive proof showing the integrity of the computations. This proof is short and can be verified much faster | |
| | | | |
dusted.codes
|
|
| | | SHA-256 is not a secure password hashing algorithm | ||
