number of lookup commitments O(l) instead of O(N)
Opened this issue · 0 comments
chaosma commented
In the current design of halo2, each lookup cost the commitment over all rows (e.g. N rows). In practice, we may only want to lookup l items with l<<N. It is possible to only commit l items using log derivative protocol. However, this is not possible with the current halo2 codebase. Is it possible to do it without modify halo2's api?