/explore
|
You are here 
|
www.rareskills.io | ||
| | | | |
rot256.dev
Introduction In this post we will take a look at the Fast Reed-Solomon IOP (FRI) proximity test, which enables an untrusted prover to convince a verifier that a committed vector is close to a Reed-Solomon codeword with communication only poly-logarithmic in the dimension of the code. This is readily used to construct practically efficient zkSNARKs from just cryptographic hash functions (rather random oracles), without the need for a trusted setup. |
|
| | | | | ||
| | | | |
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 |
|
| | | | | ||
| | | | |
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. |
|
| | | | | ||
| | | | |
hannes.robur.coop
[AI summary] This article discusses updates to cryptographic libraries in OCaml and MirageOS, focusing on elliptic curve cryptography support through the fiat-crypto project, including new features like ECDSA/EdDSA, TLS 1.3 compatibility, and improved X.509 certificate handling. |
|
| | | |||
