This repository has been archived by the owner on Oct 1, 2024. It is now read-only.
Investigate in-circuit challenges not reliant on additional vector commitments #49
Labels
academic
This issue is academic in nature
bp+
Bulletproofs+ library
improvement
This could be better
If this is feasible, it'd save a couple hundred bytes (unless we look at a single VC for all VCs, which would convert a O(n) communication cost to O(1), yet that'd break flows reliant on successive challenges...).
The text was updated successfully, but these errors were encountered: