Explore >> Select a destination
|
You are here 
|
www.jeremykun.com | ||
| | | | |
anuragbishnoi.wordpress.com
|
|
| | | | | In the previous post, we saw the problem of determining the asymptotic growth of the function $latex T_L(n)$, which is the largest size of vector subspace $latex C \subseteq \mathbb{F}_3^n$, with the property that for any three distinct vectors $latex u, v, w$ in $latex C$, there is a coordinate $latex i$, such that $latex... | |
| | | | |
jeremykun.wordpress.com
|
|
| | | | | There are two basic problems in information theory that are very easy to explain. Two people, Alice and Bob, want to communicate over a digital channel over some long period of time, and they know the probability that certain messages will be sent ahead of time. For example, English language sentences are more likely than... | |
| | | | |
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. | |
| | | | |
cambodianbeginnings.wordpress.com
|
|
| | | Visit the post for more. | ||
