Zac
@zac-aztec
Bottlenecks are memory consumption, the overheads of working with finite fields when proving statements and the cost of making cryptographic commitments. We already have "linear-time" zk and I am hopeful that eventually we can get the overhead of making a zk proof to be ~100x that of the underlying computation
0 reply
0 recast
2 reactions
