ebfull
ebfull
In some kinds of protocols (for example, relay networks) it may make sense for both sides of the transmission to be capable of sending to the other side. However, in...
``` rust type Foo = protocol!( Recv usize, Send usize, Nest { Send usize, Nest { Recv usize, Choose [ { Escape Z }, { Send usize, Escape S }...
I want to use something like `bincode` or `serde` or `nom` or something else as a proof-of-concept.
Similar to how session_types works, but specifically for our `Blocking` backend.
None of these have safety implications, but there are a number of coherence constraints ideal for `Choose`: - We don't want types like `Choose` to be expressible. That is, there...
There are some things we may change in halo2 to maintain backwards compatibility with proofs that were constructed in older versions of `halo2`. However, once we do actually make a...
The current `plonk` proving and verifying APIs are configurable by callers with respect to several different things: * your curve * your challenge space * your transcript backend (which supports...
Rationale: There's [a technique](https://hackmd.io/@dJO3Nbl4RTirkR2uDM6eOA/BkoOdpwFF) that lets us make fixed columns almost free inside of recursion, which works ideally when fixed columns are not queried at non-cur rotations. I can't think...
I'll use this issue to collect any outstanding variable name adjustments that have to be made within the book. (The goal of #495 is to at least get the code...