Explore >> Select a destination
|
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. | |
| | | | |
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... | |
| | | | |
andrea.corbellini.name
|
|
| | | | | [AI summary] The text provides an in-depth explanation of elliptic curve cryptography (ECC), covering fundamental concepts such as elliptic curves over finite fields, point addition, cyclic subgroups, subgroup orders, and the discrete logarithm problem. It also discusses practical aspects like finding base points, cofactors, and the importance of choosing subgroups with high order for cryptographic security. The text emphasizes that ECC relies on the difficulty of solving the discrete logarithm problem on elliptic curves, which is considered computationally hard and forms the basis for secure cryptographic protocols like ECDH and ECDSA. | |
| | | | |
opguides.info
|
|
| | | Appendix 6 - \(\LaTeX\) & Markdown # Like the kink? # \(\LaTeX\) , pronounced Lay-Tech, is a document writing and formatting 'language' that acts pretty different from MS Word. It's primarily used for writing fancy math equations, academic, journal, or conference papers, as such, you might have to use it at some point to conform to one standard or another (like IEEE). As an example of what \(\LaTeX\) formatting looks like, check this equation out: | ||
