ludamad
ludamad
Came out of internal slack thread. Currently, we download for 2**24 circuits in bn254 no matter what in the native bb binary, it would be good to have a common...
We need a mechanism to quickly check if transactions are bunk
This has been added to barretenberg (as of pending PR) but closer to production we should do a security analysis of this. This is currently very useful for deterministic tests,...
Current pipe usage is not ideal
Recently we had to bump initial wasm memory from 27 to 28 megabytes: From an emscripten thread: https://github.com/emscripten-core/emscripten/issues/20888 "The problem I suppose is the INITIAL_MEMORY really means + stack +...
Problem: with new structured poly PR, we require up to 1.5x CRS points than before Breakdown of problem leading to more SRS points being requested: - pippenger_unsafe_optimized_for_non_dyadic_polys allows for non-power-of-2...
added a hack to sumcheck.cpp that should be undone
currently get_row does unnecessary copying, could have a row reference class that just bundles a ProverPolynomials and row index (can take a lambda x => x.q_arith etc then apply func(prover_polys)[index])
it takes significant time. since this uses significant resources, best with the master push offload PR