/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 | |
| | | | |
thenumb.at
|
|
| | | | | [AI summary] The text discusses the representation of functions as vectors and their applications in various domains such as signal processing, geometry, and physics. It explains how functions can be treated as vectors in a vector space, leading to the concept of eigenfunctions and eigenvalues, which are crucial for understanding and manipulating signals and geometries. The text also covers different types of Laplacians, including the standard Laplacian, higher-dimensional Laplacians, and the Laplace-Beltrami operator, and their applications in fields like image compression, computer graphics, and quantum mechanics. The discussion includes spherical harmonics, which are used in representing functions on spheres, and their applications in game engines and glo... | |
| | | | |
cupano.com
|
|
| | | My Blog Posts. Contribute to joecupano/blog development by creating an account on GitHub. | ||
