Explore >> Select a destination

You are here

 beyondloom.com
None
| | jingnanshi.com
Automatic Differentiation: Forward and Reverse
90.9 parsecs away

Travel
| | Tutorial on automatic differentiation
| | rot256.dev
ROT256 : Cryptography & Other Random Bits.
90.9 parsecs away

Travel
| | 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.
| | jamie-wong.com
Ray Marching and Signed Distance Functions
83.3 parsecs away

Travel
| | One of the techniques used in many demo scenes is called ray marching. This algorithm, used in combination with a special kind of function called
| | rjlipton.com
Proving Cook's Theorem | Gödel's Lost Letter and P=NP
200.5 parsecs away

Travel
| Another proof idea using finite automata Steve Cook proved three landmark theorems with 1971 dates. The first has been called a "surprising theorem": that any deterministic pushdown automaton with two-way input tape can be simulated in linear time by a random-access machine. This implies that string matching can be done in linear time, which inspired...